./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.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 5de8a6e48c671522e021c00f8053da339f3153b1fcc0b54263671efa3814086b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:33:44,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:33:44,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:33:44,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:33:44,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:33:44,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:33:44,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:33:44,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:33:44,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:33:44,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:33:44,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:33:44,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:33:44,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:33:44,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:33:44,176 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:33:44,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:33:44,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:33:44,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:33:44,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:33:44,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:33:44,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:33:44,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:33:44,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:33:44,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:33:44,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:33:44,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:33:44,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:33:44,181 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:33:44,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:33:44,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:33:44,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:33:44,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:33:44,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:33:44,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:33:44,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:33:44,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:33:44,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:33:44,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:33:44,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:33:44,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:33:44,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:33:44,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:33:44,186 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 -> 5de8a6e48c671522e021c00f8053da339f3153b1fcc0b54263671efa3814086b [2024-11-11 21:33:44,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:33:44,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:33:44,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:33:44,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:33:44,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:33:44,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-11 21:33:45,887 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:33:46,277 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:33:46,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-11 21:33:46,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70589fb5e/fb31db2a9a394012a00efedb48a955a0/FLAG9b965c74f [2024-11-11 21:33:46,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70589fb5e/fb31db2a9a394012a00efedb48a955a0 [2024-11-11 21:33:46,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:33:46,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:33:46,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:33:46,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:33:46,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:33:46,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:33:46" (1/1) ... [2024-11-11 21:33:46,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d20ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:46, skipping insertion in model container [2024-11-11 21:33:46,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:33:46" (1/1) ... [2024-11-11 21:33:46,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:33:46,774 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8424,8437] [2024-11-11 21:33:46,815 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12951,12964] [2024-11-11 21:33:46,857 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20701,20714] [2024-11-11 21:33:46,904 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27792,27805] [2024-11-11 21:33:47,005 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[49016,49029] [2024-11-11 21:33:47,096 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[80107,80120] [2024-11-11 21:33:47,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:33:47,337 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:33:47,366 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8424,8437] [2024-11-11 21:33:47,374 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12951,12964] [2024-11-11 21:33: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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20701,20714] [2024-11-11 21:33:47,404 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27792,27805] [2024-11-11 21:33:47,437 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[49016,49029] [2024-11-11 21:33:47,479 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-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[80107,80120] [2024-11-11 21:33:47,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:33:47,579 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:33:47,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47 WrapperNode [2024-11-11 21:33:47,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:33:47,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:33:47,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:33:47,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:33:47,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:47,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:47,780 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6424 [2024-11-11 21:33:47,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:33:47,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:33:47,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:33:47,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:33:47,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:47,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:47,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:47,871 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-11 21:33:47,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:47,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:47,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:47,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:47,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:47,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:47,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:33:47,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:33:47,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:33:47,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:33:47,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (1/1) ... [2024-11-11 21:33:48,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:33:48,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:33:48,027 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-11 21:33:48,028 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-11 21:33:48,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:33:48,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:33:48,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:33:48,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:33:48,318 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:33:48,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:33:51,242 INFO L? ?]: Removed 1251 outVars from TransFormulas that were not future-live. [2024-11-11 21:33:51,243 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:33:51,300 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:33:51,300 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:33:51,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:33:51 BoogieIcfgContainer [2024-11-11 21:33:51,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:33:51,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:33:51,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:33:51,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:33:51,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:33:46" (1/3) ... [2024-11-11 21:33:51,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c18eee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:33:51, skipping insertion in model container [2024-11-11 21:33:51,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:33:47" (2/3) ... [2024-11-11 21:33:51,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c18eee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:33:51, skipping insertion in model container [2024-11-11 21:33:51,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:33:51" (3/3) ... [2024-11-11 21:33:51,312 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-11 21:33:51,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:33:51,331 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-11 21:33:51,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:33:51,455 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;@4462fe99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:33:51,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-11 21:33:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 1290 states, 1283 states have (on average 1.7716289945440373) internal successors, (2273), 1289 states have internal predecessors, (2273), 0 states have call successors, (0), 0 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-11 21:33:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-11 21:33:51,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:51,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:51,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:51,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash 692081489, now seen corresponding path program 1 times [2024-11-11 21:33:51,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:51,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552801976] [2024-11-11 21:33:51,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:51,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:52,126 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-11 21:33:52,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:52,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552801976] [2024-11-11 21:33:52,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552801976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:52,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:52,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:33:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832558212] [2024-11-11 21:33:52,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:52,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:33:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:52,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:33:52,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:33:52,172 INFO L87 Difference]: Start difference. First operand has 1290 states, 1283 states have (on average 1.7716289945440373) internal successors, (2273), 1289 states have internal predecessors, (2273), 0 states have call successors, (0), 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 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:33:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:53,819 INFO L93 Difference]: Finished difference Result 2514 states and 4326 transitions. [2024-11-11 21:33:53,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:33:53,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-11 21:33:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:53,842 INFO L225 Difference]: With dead ends: 2514 [2024-11-11 21:33:53,842 INFO L226 Difference]: Without dead ends: 1590 [2024-11-11 21:33:53,854 INFO L434 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-11 21:33:53,858 INFO L435 NwaCegarLoop]: 1054 mSDtfsCounter, 7092 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7092 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:53,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7092 Valid, 1556 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 21:33:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-11 21:33:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1584. [2024-11-11 21:33:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1578 states have (on average 1.309252217997465) internal successors, (2066), 1583 states have internal predecessors, (2066), 0 states have call successors, (0), 0 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-11 21:33:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2066 transitions. [2024-11-11 21:33:53,976 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2066 transitions. Word has length 52 [2024-11-11 21:33:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:53,977 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2066 transitions. [2024-11-11 21:33:53,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:33:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2066 transitions. [2024-11-11 21:33:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 21:33:53,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:53,982 INFO L218 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] [2024-11-11 21:33:53,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:33:53,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:53,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash -736362272, now seen corresponding path program 1 times [2024-11-11 21:33:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:53,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278886281] [2024-11-11 21:33:53,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:53,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:54,146 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-11 21:33:54,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:54,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278886281] [2024-11-11 21:33:54,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278886281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:54,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:54,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:33:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846817770] [2024-11-11 21:33:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:54,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:33:54,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:54,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:33:54,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:33:54,149 INFO L87 Difference]: Start difference. First operand 1584 states and 2066 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-11 21:33:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:55,114 INFO L93 Difference]: Finished difference Result 3198 states and 4201 transitions. [2024-11-11 21:33:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:33:55,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-11 21:33:55,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:55,124 INFO L225 Difference]: With dead ends: 3198 [2024-11-11 21:33:55,124 INFO L226 Difference]: Without dead ends: 2208 [2024-11-11 21:33:55,126 INFO L434 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-11 21:33:55,128 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 4976 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4976 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:55,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4976 Valid, 1044 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 21:33:55,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2024-11-11 21:33:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2194. [2024-11-11 21:33:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2194 states, 2188 states have (on average 1.3194698354661791) internal successors, (2887), 2193 states have internal predecessors, (2887), 0 states have call successors, (0), 0 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-11 21:33:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 2887 transitions. [2024-11-11 21:33:55,209 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 2887 transitions. Word has length 53 [2024-11-11 21:33:55,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:55,209 INFO L471 AbstractCegarLoop]: Abstraction has 2194 states and 2887 transitions. [2024-11-11 21:33:55,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-11 21:33:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2887 transitions. [2024-11-11 21:33:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 21:33:55,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:55,214 INFO L218 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] [2024-11-11 21:33:55,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:33:55,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:55,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1386389066, now seen corresponding path program 1 times [2024-11-11 21:33:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:55,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911105212] [2024-11-11 21:33:55,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:55,379 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-11 21:33:55,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:55,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911105212] [2024-11-11 21:33:55,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911105212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:55,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:55,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:33:55,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596302054] [2024-11-11 21:33:55,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:55,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:33:55,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:55,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:33:55,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:33:55,383 INFO L87 Difference]: Start difference. First operand 2194 states and 2887 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-11 21:33:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:56,221 INFO L93 Difference]: Finished difference Result 4499 states and 5989 transitions. [2024-11-11 21:33:56,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:33:56,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-11 21:33:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:56,233 INFO L225 Difference]: With dead ends: 4499 [2024-11-11 21:33:56,234 INFO L226 Difference]: Without dead ends: 3072 [2024-11-11 21:33:56,239 INFO L434 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-11 21:33:56,242 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 4462 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4462 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:56,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4462 Valid, 932 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:33:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2024-11-11 21:33:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3062. [2024-11-11 21:33:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3056 states have (on average 1.3236256544502618) internal successors, (4045), 3061 states have internal predecessors, (4045), 0 states have call successors, (0), 0 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-11 21:33:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4045 transitions. [2024-11-11 21:33:56,306 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4045 transitions. Word has length 53 [2024-11-11 21:33:56,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:56,307 INFO L471 AbstractCegarLoop]: Abstraction has 3062 states and 4045 transitions. [2024-11-11 21:33:56,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-11 21:33:56,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4045 transitions. [2024-11-11 21:33:56,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:33:56,310 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:56,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:56,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:33:56,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:56,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1763239895, now seen corresponding path program 1 times [2024-11-11 21:33:56,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:56,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422466439] [2024-11-11 21:33:56,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:56,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:56,727 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-11 21:33:56,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:56,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422466439] [2024-11-11 21:33:56,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422466439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:56,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:56,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:33:56,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441445810] [2024-11-11 21:33:56,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:56,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:33:56,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:56,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:33:56,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:33:56,732 INFO L87 Difference]: Start difference. First operand 3062 states and 4045 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:33:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:33:58,010 INFO L93 Difference]: Finished difference Result 4439 states and 5985 transitions. [2024-11-11 21:33:58,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:33:58,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-11 21:33:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:33:58,023 INFO L225 Difference]: With dead ends: 4439 [2024-11-11 21:33:58,023 INFO L226 Difference]: Without dead ends: 3735 [2024-11-11 21:33:58,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:33:58,031 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 6207 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6207 SdHoareTripleChecker+Valid, 2210 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:33:58,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6207 Valid, 2210 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 21:33:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2024-11-11 21:33:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 3062. [2024-11-11 21:33:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3056 states have (on average 1.3232984293193717) internal successors, (4044), 3061 states have internal predecessors, (4044), 0 states have call successors, (0), 0 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-11 21:33:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4044 transitions. [2024-11-11 21:33:58,114 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4044 transitions. Word has length 55 [2024-11-11 21:33:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:33:58,114 INFO L471 AbstractCegarLoop]: Abstraction has 3062 states and 4044 transitions. [2024-11-11 21:33:58,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:33:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4044 transitions. [2024-11-11 21:33:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:33:58,118 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:33:58,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:33:58,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:33:58,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:33:58,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:33:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash 622296368, now seen corresponding path program 1 times [2024-11-11 21:33:58,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:33:58,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117048044] [2024-11-11 21:33:58,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:33:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:33:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:33:58,659 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-11 21:33:58,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:33:58,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117048044] [2024-11-11 21:33:58,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117048044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:33:58,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:33:58,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:33:58,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317787546] [2024-11-11 21:33:58,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:33:58,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:33:58,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:33:58,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:33:58,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:33:58,662 INFO L87 Difference]: Start difference. First operand 3062 states and 4044 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:00,619 INFO L93 Difference]: Finished difference Result 5435 states and 7347 transitions. [2024-11-11 21:34:00,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:34:00,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-11 21:34:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:00,635 INFO L225 Difference]: With dead ends: 5435 [2024-11-11 21:34:00,636 INFO L226 Difference]: Without dead ends: 4865 [2024-11-11 21:34:00,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:34:00,639 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 5544 mSDsluCounter, 3124 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5544 SdHoareTripleChecker+Valid, 3838 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:00,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5544 Valid, 3838 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3863 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 21:34:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2024-11-11 21:34:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 3062. [2024-11-11 21:34:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3056 states have (on average 1.3229712041884816) internal successors, (4043), 3061 states have internal predecessors, (4043), 0 states have call successors, (0), 0 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-11 21:34:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4043 transitions. [2024-11-11 21:34:00,719 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4043 transitions. Word has length 55 [2024-11-11 21:34:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:00,721 INFO L471 AbstractCegarLoop]: Abstraction has 3062 states and 4043 transitions. [2024-11-11 21:34:00,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4043 transitions. [2024-11-11 21:34:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:34:00,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:00,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:34:00,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:34:00,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:00,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1268497001, now seen corresponding path program 1 times [2024-11-11 21:34:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:00,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49536314] [2024-11-11 21:34:00,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:00,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:01,060 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-11 21:34:01,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49536314] [2024-11-11 21:34:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49536314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:01,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:01,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:34:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910369002] [2024-11-11 21:34:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:01,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:34:01,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:01,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:34:01,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:34:01,064 INFO L87 Difference]: Start difference. First operand 3062 states and 4043 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:02,433 INFO L93 Difference]: Finished difference Result 4387 states and 5878 transitions. [2024-11-11 21:34:02,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:34:02,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-11 21:34:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:02,446 INFO L225 Difference]: With dead ends: 4387 [2024-11-11 21:34:02,446 INFO L226 Difference]: Without dead ends: 4381 [2024-11-11 21:34:02,448 INFO L434 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-11 21:34:02,448 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 5271 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5271 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:02,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5271 Valid, 2972 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 21:34:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2024-11-11 21:34:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 3062. [2024-11-11 21:34:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3062 states, 3056 states have (on average 1.3226439790575917) internal successors, (4042), 3061 states have internal predecessors, (4042), 0 states have call successors, (0), 0 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-11 21:34:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4042 transitions. [2024-11-11 21:34:02,518 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4042 transitions. Word has length 55 [2024-11-11 21:34:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:02,518 INFO L471 AbstractCegarLoop]: Abstraction has 3062 states and 4042 transitions. [2024-11-11 21:34:02,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:02,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4042 transitions. [2024-11-11 21:34:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:34:02,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:02,521 INFO L218 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] [2024-11-11 21:34:02,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:34:02,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:02,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:02,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1662572980, now seen corresponding path program 1 times [2024-11-11 21:34:02,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783758830] [2024-11-11 21:34:02,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:02,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:02,607 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-11 21:34:02,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:02,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783758830] [2024-11-11 21:34:02,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783758830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:02,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:02,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:02,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545872374] [2024-11-11 21:34:02,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:02,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:02,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:02,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:02,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:02,610 INFO L87 Difference]: Start difference. First operand 3062 states and 4042 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-11 21:34:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:02,674 INFO L93 Difference]: Finished difference Result 4018 states and 5491 transitions. [2024-11-11 21:34:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:02,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-11 21:34:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:02,685 INFO L225 Difference]: With dead ends: 4018 [2024-11-11 21:34:02,685 INFO L226 Difference]: Without dead ends: 3081 [2024-11-11 21:34:02,687 INFO L434 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-11 21:34:02,688 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 579 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:02,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1790 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:34:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2024-11-11 21:34:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 3079. [2024-11-11 21:34:02,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3079 states, 3073 states have (on average 1.33875691506671) internal successors, (4114), 3078 states have internal predecessors, (4114), 0 states have call successors, (0), 0 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-11 21:34:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 4114 transitions. [2024-11-11 21:34:02,738 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 4114 transitions. Word has length 56 [2024-11-11 21:34:02,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:02,739 INFO L471 AbstractCegarLoop]: Abstraction has 3079 states and 4114 transitions. [2024-11-11 21:34:02,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-11 21:34:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 4114 transitions. [2024-11-11 21:34:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:34:02,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:02,742 INFO L218 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] [2024-11-11 21:34:02,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:34:02,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:02,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1775531576, now seen corresponding path program 1 times [2024-11-11 21:34:02,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:02,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211970726] [2024-11-11 21:34:02,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:02,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:02,827 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-11 21:34:02,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:02,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211970726] [2024-11-11 21:34:02,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211970726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:02,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:02,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572771976] [2024-11-11 21:34:02,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:02,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:02,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:02,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:02,829 INFO L87 Difference]: Start difference. First operand 3079 states and 4114 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-11 21:34:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:02,895 INFO L93 Difference]: Finished difference Result 4753 states and 6649 transitions. [2024-11-11 21:34:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:02,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-11 21:34:02,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:02,915 INFO L225 Difference]: With dead ends: 4753 [2024-11-11 21:34:02,915 INFO L226 Difference]: Without dead ends: 3509 [2024-11-11 21:34:02,918 INFO L434 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-11 21:34:02,919 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 587 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:02,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1728 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:34:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2024-11-11 21:34:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 3507. [2024-11-11 21:34:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3507 states, 3501 states have (on average 1.3701799485861184) internal successors, (4797), 3506 states have internal predecessors, (4797), 0 states have call successors, (0), 0 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-11 21:34:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 4797 transitions. [2024-11-11 21:34:02,981 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 4797 transitions. Word has length 56 [2024-11-11 21:34:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:02,981 INFO L471 AbstractCegarLoop]: Abstraction has 3507 states and 4797 transitions. [2024-11-11 21:34:02,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-11 21:34:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 4797 transitions. [2024-11-11 21:34:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:34:02,984 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:02,984 INFO L218 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] [2024-11-11 21:34:02,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:34:02,984 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:02,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1498951000, now seen corresponding path program 1 times [2024-11-11 21:34:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:02,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626850667] [2024-11-11 21:34:02,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:03,061 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-11 21:34:03,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:03,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626850667] [2024-11-11 21:34:03,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626850667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:03,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:03,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501564925] [2024-11-11 21:34:03,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:03,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:03,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:03,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:03,064 INFO L87 Difference]: Start difference. First operand 3507 states and 4797 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-11 21:34:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:03,223 INFO L93 Difference]: Finished difference Result 7489 states and 10501 transitions. [2024-11-11 21:34:03,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:03,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-11 21:34:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:03,239 INFO L225 Difference]: With dead ends: 7489 [2024-11-11 21:34:03,239 INFO L226 Difference]: Without dead ends: 5080 [2024-11-11 21:34:03,244 INFO L434 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-11 21:34:03,246 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 657 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:03,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1963 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2024-11-11 21:34:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 5074. [2024-11-11 21:34:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5074 states, 5068 states have (on average 1.3681925808997633) internal successors, (6934), 5073 states have internal predecessors, (6934), 0 states have call successors, (0), 0 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-11 21:34:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5074 states to 5074 states and 6934 transitions. [2024-11-11 21:34:03,331 INFO L78 Accepts]: Start accepts. Automaton has 5074 states and 6934 transitions. Word has length 56 [2024-11-11 21:34:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:03,332 INFO L471 AbstractCegarLoop]: Abstraction has 5074 states and 6934 transitions. [2024-11-11 21:34:03,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-11 21:34:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 5074 states and 6934 transitions. [2024-11-11 21:34:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 21:34:03,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:03,335 INFO L218 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] [2024-11-11 21:34:03,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:34:03,336 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:03,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:03,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1118792296, now seen corresponding path program 1 times [2024-11-11 21:34:03,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:03,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250139082] [2024-11-11 21:34:03,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:03,976 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-11 21:34:03,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:03,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250139082] [2024-11-11 21:34:03,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250139082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:03,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:03,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:34:03,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690035183] [2024-11-11 21:34:03,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:03,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:34:03,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:03,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:34:03,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:34:03,979 INFO L87 Difference]: Start difference. First operand 5074 states and 6934 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-11 21:34:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:05,743 INFO L93 Difference]: Finished difference Result 10633 states and 14817 transitions. [2024-11-11 21:34:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:34:05,744 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-11-11 21:34:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:05,763 INFO L225 Difference]: With dead ends: 10633 [2024-11-11 21:34:05,763 INFO L226 Difference]: Without dead ends: 10570 [2024-11-11 21:34:05,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:34:05,770 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 6138 mSDsluCounter, 5302 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6138 SdHoareTripleChecker+Valid, 6321 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:05,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6138 Valid, 6321 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 21:34:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10570 states. [2024-11-11 21:34:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10570 to 5061. [2024-11-11 21:34:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5061 states, 5056 states have (on average 1.3684731012658229) internal successors, (6919), 5060 states have internal predecessors, (6919), 0 states have call successors, (0), 0 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-11 21:34:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5061 states to 5061 states and 6919 transitions. [2024-11-11 21:34:05,875 INFO L78 Accepts]: Start accepts. Automaton has 5061 states and 6919 transitions. Word has length 57 [2024-11-11 21:34:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:05,876 INFO L471 AbstractCegarLoop]: Abstraction has 5061 states and 6919 transitions. [2024-11-11 21:34:05,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-11 21:34:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5061 states and 6919 transitions. [2024-11-11 21:34:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 21:34:05,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:05,879 INFO L218 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] [2024-11-11 21:34:05,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:34:05,879 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:05,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash -677466950, now seen corresponding path program 1 times [2024-11-11 21:34:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364961716] [2024-11-11 21:34:05,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:05,944 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-11 21:34:05,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:05,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364961716] [2024-11-11 21:34:05,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364961716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:05,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:05,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:05,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700374027] [2024-11-11 21:34:05,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:05,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:05,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:05,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:05,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:05,947 INFO L87 Difference]: Start difference. First operand 5061 states and 6919 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-11 21:34:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:06,055 INFO L93 Difference]: Finished difference Result 9491 states and 13200 transitions. [2024-11-11 21:34:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:06,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-11-11 21:34:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:06,065 INFO L225 Difference]: With dead ends: 9491 [2024-11-11 21:34:06,065 INFO L226 Difference]: Without dead ends: 5440 [2024-11-11 21:34:06,070 INFO L434 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-11 21:34:06,071 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 820 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:06,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1221 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2024-11-11 21:34:06,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 4347. [2024-11-11 21:34:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4347 states, 4343 states have (on average 1.3845268247755007) internal successors, (6013), 4346 states have internal predecessors, (6013), 0 states have call successors, (0), 0 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-11 21:34:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 6013 transitions. [2024-11-11 21:34:06,167 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 6013 transitions. Word has length 57 [2024-11-11 21:34:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:06,168 INFO L471 AbstractCegarLoop]: Abstraction has 4347 states and 6013 transitions. [2024-11-11 21:34:06,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-11 21:34:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 6013 transitions. [2024-11-11 21:34:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 21:34:06,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:06,173 INFO L218 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] [2024-11-11 21:34:06,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:34:06,175 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:06,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:06,175 INFO L85 PathProgramCache]: Analyzing trace with hash -611117000, now seen corresponding path program 1 times [2024-11-11 21:34:06,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:06,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871422267] [2024-11-11 21:34:06,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:06,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-11 21:34:06,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:06,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871422267] [2024-11-11 21:34:06,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871422267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:06,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:06,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:06,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685150430] [2024-11-11 21:34:06,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:06,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:06,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:06,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:06,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:06,237 INFO L87 Difference]: Start difference. First operand 4347 states and 6013 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-11 21:34:06,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:06,326 INFO L93 Difference]: Finished difference Result 8377 states and 11806 transitions. [2024-11-11 21:34:06,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:06,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-11-11 21:34:06,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:06,334 INFO L225 Difference]: With dead ends: 8377 [2024-11-11 21:34:06,335 INFO L226 Difference]: Without dead ends: 4765 [2024-11-11 21:34:06,339 INFO L434 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-11 21:34:06,339 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 638 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:06,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1002 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4765 states. [2024-11-11 21:34:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4765 to 3818. [2024-11-11 21:34:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3818 states, 3815 states have (on average 1.397640891218873) internal successors, (5332), 3817 states have internal predecessors, (5332), 0 states have call successors, (0), 0 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-11 21:34:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 5332 transitions. [2024-11-11 21:34:06,391 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 5332 transitions. Word has length 57 [2024-11-11 21:34:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:06,392 INFO L471 AbstractCegarLoop]: Abstraction has 3818 states and 5332 transitions. [2024-11-11 21:34:06,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-11 21:34:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 5332 transitions. [2024-11-11 21:34:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 21:34:06,394 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:06,394 INFO L218 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] [2024-11-11 21:34:06,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:34:06,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:06,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1274837938, now seen corresponding path program 1 times [2024-11-11 21:34:06,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:06,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362569898] [2024-11-11 21:34:06,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:06,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:06,450 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-11 21:34:06,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:06,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362569898] [2024-11-11 21:34:06,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362569898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:06,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:06,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:06,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233366038] [2024-11-11 21:34:06,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:06,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:06,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:06,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:06,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:06,453 INFO L87 Difference]: Start difference. First operand 3818 states and 5332 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-11 21:34:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:06,573 INFO L93 Difference]: Finished difference Result 7682 states and 10899 transitions. [2024-11-11 21:34:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:06,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-11-11 21:34:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:06,580 INFO L225 Difference]: With dead ends: 7682 [2024-11-11 21:34:06,580 INFO L226 Difference]: Without dead ends: 4206 [2024-11-11 21:34:06,584 INFO L434 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-11 21:34:06,585 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 549 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:06,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 904 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4206 states. [2024-11-11 21:34:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4206 to 3371. [2024-11-11 21:34:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3371 states, 3368 states have (on average 1.4133016627078385) internal successors, (4760), 3370 states have internal predecessors, (4760), 0 states have call successors, (0), 0 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-11 21:34:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 3371 states and 4760 transitions. [2024-11-11 21:34:06,626 INFO L78 Accepts]: Start accepts. Automaton has 3371 states and 4760 transitions. Word has length 57 [2024-11-11 21:34:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:06,626 INFO L471 AbstractCegarLoop]: Abstraction has 3371 states and 4760 transitions. [2024-11-11 21:34:06,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-11 21:34:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3371 states and 4760 transitions. [2024-11-11 21:34:06,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 21:34:06,628 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:06,628 INFO L218 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] [2024-11-11 21:34:06,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:34:06,629 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:06,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash -410378211, now seen corresponding path program 1 times [2024-11-11 21:34:06,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:06,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118188736] [2024-11-11 21:34:06,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:06,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:07,215 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-11 21:34:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118188736] [2024-11-11 21:34:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118188736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:07,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:07,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:34:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639704418] [2024-11-11 21:34:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:07,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:34:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:34:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:34:07,218 INFO L87 Difference]: Start difference. First operand 3371 states and 4760 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-11 21:34:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:07,930 INFO L93 Difference]: Finished difference Result 5559 states and 7906 transitions. [2024-11-11 21:34:07,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:34:07,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-11 21:34:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:07,940 INFO L225 Difference]: With dead ends: 5559 [2024-11-11 21:34:07,941 INFO L226 Difference]: Without dead ends: 5555 [2024-11-11 21:34:07,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:34:07,945 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 2935 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2935 SdHoareTripleChecker+Valid, 2954 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:07,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2935 Valid, 2954 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:34:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5555 states. [2024-11-11 21:34:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5555 to 3367. [2024-11-11 21:34:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3367 states, 3365 states have (on average 1.4133729569093612) internal successors, (4756), 3366 states have internal predecessors, (4756), 0 states have call successors, (0), 0 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-11 21:34:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3367 states to 3367 states and 4756 transitions. [2024-11-11 21:34:07,999 INFO L78 Accepts]: Start accepts. Automaton has 3367 states and 4756 transitions. Word has length 58 [2024-11-11 21:34:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:07,999 INFO L471 AbstractCegarLoop]: Abstraction has 3367 states and 4756 transitions. [2024-11-11 21:34:07,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-11 21:34:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3367 states and 4756 transitions. [2024-11-11 21:34:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 21:34:08,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:08,002 INFO L218 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] [2024-11-11 21:34:08,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:34:08,003 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:08,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:08,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1645651769, now seen corresponding path program 1 times [2024-11-11 21:34:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:08,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404368435] [2024-11-11 21:34:08,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:08,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:08,541 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-11 21:34:08,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:08,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404368435] [2024-11-11 21:34:08,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404368435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:08,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:08,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 21:34:08,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276146337] [2024-11-11 21:34:08,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:08,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 21:34:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:08,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 21:34:08,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:34:08,543 INFO L87 Difference]: Start difference. First operand 3367 states and 4756 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-11 21:34:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:09,266 INFO L93 Difference]: Finished difference Result 5551 states and 7899 transitions. [2024-11-11 21:34:09,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:34:09,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-11 21:34:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:09,274 INFO L225 Difference]: With dead ends: 5551 [2024-11-11 21:34:09,275 INFO L226 Difference]: Without dead ends: 5547 [2024-11-11 21:34:09,277 INFO L434 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-11 21:34:09,278 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 3411 mSDsluCounter, 2511 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3411 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:09,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3411 Valid, 3061 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:34:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5547 states. [2024-11-11 21:34:09,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5547 to 3363. [2024-11-11 21:34:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3363 states, 3362 states have (on average 1.4134443783462225) internal successors, (4752), 3362 states have internal predecessors, (4752), 0 states have call successors, (0), 0 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-11 21:34:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4752 transitions. [2024-11-11 21:34:09,327 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4752 transitions. Word has length 58 [2024-11-11 21:34:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:09,327 INFO L471 AbstractCegarLoop]: Abstraction has 3363 states and 4752 transitions. [2024-11-11 21:34:09,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-11 21:34:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4752 transitions. [2024-11-11 21:34:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:34:09,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:09,329 INFO L218 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-11 21:34:09,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:34:09,330 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:09,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1327663405, now seen corresponding path program 1 times [2024-11-11 21:34:09,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:09,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678290461] [2024-11-11 21:34:09,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:09,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:09,420 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-11 21:34:09,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:09,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678290461] [2024-11-11 21:34:09,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678290461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:09,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:09,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:34:09,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137119928] [2024-11-11 21:34:09,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:09,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:34:09,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:09,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:34:09,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:34:09,424 INFO L87 Difference]: Start difference. First operand 3363 states and 4752 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-11 21:34:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:09,535 INFO L93 Difference]: Finished difference Result 10483 states and 15148 transitions. [2024-11-11 21:34:09,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:34:09,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-11 21:34:09,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:09,548 INFO L225 Difference]: With dead ends: 10483 [2024-11-11 21:34:09,549 INFO L226 Difference]: Without dead ends: 7697 [2024-11-11 21:34:09,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11 21:34:09,555 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 1614 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:09,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 1205 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7697 states. [2024-11-11 21:34:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7697 to 5839. [2024-11-11 21:34:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5839 states, 5838 states have (on average 1.4128126070572113) internal successors, (8248), 5838 states have internal predecessors, (8248), 0 states have call successors, (0), 0 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-11 21:34:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5839 states to 5839 states and 8248 transitions. [2024-11-11 21:34:09,636 INFO L78 Accepts]: Start accepts. Automaton has 5839 states and 8248 transitions. Word has length 66 [2024-11-11 21:34:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:09,636 INFO L471 AbstractCegarLoop]: Abstraction has 5839 states and 8248 transitions. [2024-11-11 21:34:09,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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-11 21:34:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5839 states and 8248 transitions. [2024-11-11 21:34:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 21:34:09,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:09,639 INFO L218 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] [2024-11-11 21:34:09,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:34:09,640 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:09,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:09,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2106166862, now seen corresponding path program 1 times [2024-11-11 21:34:09,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:09,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623313551] [2024-11-11 21:34:09,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:09,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:09,795 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-11 21:34:09,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:09,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623313551] [2024-11-11 21:34:09,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623313551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:09,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:09,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:34:09,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340749042] [2024-11-11 21:34:09,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:09,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:34:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:09,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:34:09,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:34:09,798 INFO L87 Difference]: Start difference. First operand 5839 states and 8248 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-11 21:34:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:09,898 INFO L93 Difference]: Finished difference Result 9145 states and 12967 transitions. [2024-11-11 21:34:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:34:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-11-11 21:34:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:09,905 INFO L225 Difference]: With dead ends: 9145 [2024-11-11 21:34:09,906 INFO L226 Difference]: Without dead ends: 3861 [2024-11-11 21:34:09,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:34:09,912 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 1168 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:09,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 941 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2024-11-11 21:34:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3857. [2024-11-11 21:34:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3857 states, 3856 states have (on average 1.3871887966804979) internal successors, (5349), 3856 states have internal predecessors, (5349), 0 states have call successors, (0), 0 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-11 21:34:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3857 states to 3857 states and 5349 transitions. [2024-11-11 21:34:09,977 INFO L78 Accepts]: Start accepts. Automaton has 3857 states and 5349 transitions. Word has length 67 [2024-11-11 21:34:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:09,977 INFO L471 AbstractCegarLoop]: Abstraction has 3857 states and 5349 transitions. [2024-11-11 21:34:09,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-11 21:34:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 5349 transitions. [2024-11-11 21:34:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 21:34:09,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:09,981 INFO L218 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-11 21:34:09,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:34:09,982 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:09,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash -565252104, now seen corresponding path program 1 times [2024-11-11 21:34:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:09,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342376775] [2024-11-11 21:34:09,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:09,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:10,137 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-11 21:34:10,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:10,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342376775] [2024-11-11 21:34:10,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342376775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:10,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:10,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:10,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156979176] [2024-11-11 21:34:10,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:10,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:10,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:10,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:10,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:10,139 INFO L87 Difference]: Start difference. First operand 3857 states and 5349 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-11 21:34:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:10,212 INFO L93 Difference]: Finished difference Result 10147 states and 14275 transitions. [2024-11-11 21:34:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:10,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-11 21:34:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:10,224 INFO L225 Difference]: With dead ends: 10147 [2024-11-11 21:34:10,225 INFO L226 Difference]: Without dead ends: 6845 [2024-11-11 21:34:10,230 INFO L434 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-11 21:34:10,231 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 301 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:10,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 904 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2024-11-11 21:34:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 6427. [2024-11-11 21:34:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6427 states, 6426 states have (on average 1.3907563025210083) internal successors, (8937), 6426 states have internal predecessors, (8937), 0 states have call successors, (0), 0 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-11 21:34:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6427 states to 6427 states and 8937 transitions. [2024-11-11 21:34:10,312 INFO L78 Accepts]: Start accepts. Automaton has 6427 states and 8937 transitions. Word has length 69 [2024-11-11 21:34:10,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:10,312 INFO L471 AbstractCegarLoop]: Abstraction has 6427 states and 8937 transitions. [2024-11-11 21:34:10,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 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-11 21:34:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 6427 states and 8937 transitions. [2024-11-11 21:34:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 21:34:10,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:10,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:34:10,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:34:10,316 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:10,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash -195732182, now seen corresponding path program 1 times [2024-11-11 21:34:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:10,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585793233] [2024-11-11 21:34:10,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:10,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:10,436 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-11 21:34:10,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:10,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585793233] [2024-11-11 21:34:10,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585793233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:10,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:10,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368506172] [2024-11-11 21:34:10,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:10,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:10,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:10,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:10,439 INFO L87 Difference]: Start difference. First operand 6427 states and 8937 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:10,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:10,520 INFO L93 Difference]: Finished difference Result 17545 states and 24533 transitions. [2024-11-11 21:34:10,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:10,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-11 21:34:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:10,535 INFO L225 Difference]: With dead ends: 17545 [2024-11-11 21:34:10,536 INFO L226 Difference]: Without dead ends: 11657 [2024-11-11 21:34:10,544 INFO L434 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-11 21:34:10,545 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 354 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:10,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 858 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:34:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2024-11-11 21:34:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 10823. [2024-11-11 21:34:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10823 states, 10822 states have (on average 1.3826464609129552) internal successors, (14963), 10822 states have internal predecessors, (14963), 0 states have call successors, (0), 0 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-11 21:34:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10823 states to 10823 states and 14963 transitions. [2024-11-11 21:34:10,674 INFO L78 Accepts]: Start accepts. Automaton has 10823 states and 14963 transitions. Word has length 72 [2024-11-11 21:34:10,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:10,674 INFO L471 AbstractCegarLoop]: Abstraction has 10823 states and 14963 transitions. [2024-11-11 21:34:10,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 10823 states and 14963 transitions. [2024-11-11 21:34:10,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 21:34:10,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:10,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:34:10,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:34:10,677 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:10,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:10,678 INFO L85 PathProgramCache]: Analyzing trace with hash 950824169, now seen corresponding path program 1 times [2024-11-11 21:34:10,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:10,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784094683] [2024-11-11 21:34:10,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:11,003 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-11 21:34:11,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:11,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784094683] [2024-11-11 21:34:11,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784094683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:11,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:11,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:34:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968282656] [2024-11-11 21:34:11,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:11,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:34:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:11,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:34:11,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:34:11,007 INFO L87 Difference]: Start difference. First operand 10823 states and 14963 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:11,094 INFO L93 Difference]: Finished difference Result 11713 states and 16148 transitions. [2024-11-11 21:34:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:34:11,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-11 21:34:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:11,112 INFO L225 Difference]: With dead ends: 11713 [2024-11-11 21:34:11,112 INFO L226 Difference]: Without dead ends: 11711 [2024-11-11 21:34:11,116 INFO L434 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-11 21:34:11,117 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:11,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2728 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11711 states. [2024-11-11 21:34:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11711 to 11711. [2024-11-11 21:34:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11711 states, 11710 states have (on average 1.3536293766011955) internal successors, (15851), 11710 states have internal predecessors, (15851), 0 states have call successors, (0), 0 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-11 21:34:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11711 states to 11711 states and 15851 transitions. [2024-11-11 21:34:11,254 INFO L78 Accepts]: Start accepts. Automaton has 11711 states and 15851 transitions. Word has length 72 [2024-11-11 21:34:11,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:11,254 INFO L471 AbstractCegarLoop]: Abstraction has 11711 states and 15851 transitions. [2024-11-11 21:34:11,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:11,254 INFO L276 IsEmpty]: Start isEmpty. Operand 11711 states and 15851 transitions. [2024-11-11 21:34:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 21:34:11,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:11,257 INFO L218 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] [2024-11-11 21:34:11,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:34:11,257 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:11,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:11,258 INFO L85 PathProgramCache]: Analyzing trace with hash -467379378, now seen corresponding path program 1 times [2024-11-11 21:34:11,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:11,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546724919] [2024-11-11 21:34:11,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:11,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:11,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-11 21:34:11,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:11,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546724919] [2024-11-11 21:34:11,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546724919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:11,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:11,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:11,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617200232] [2024-11-11 21:34:11,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:11,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:11,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:11,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:11,328 INFO L87 Difference]: Start difference. First operand 11711 states and 15851 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-11 21:34:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:11,438 INFO L93 Difference]: Finished difference Result 31614 states and 42824 transitions. [2024-11-11 21:34:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:11,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-11-11 21:34:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:11,472 INFO L225 Difference]: With dead ends: 31614 [2024-11-11 21:34:11,472 INFO L226 Difference]: Without dead ends: 20444 [2024-11-11 21:34:11,488 INFO L434 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-11 21:34:11,489 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 302 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:11,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 865 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:34:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20444 states. [2024-11-11 21:34:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20444 to 20442. [2024-11-11 21:34:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20442 states, 20441 states have (on average 1.3348662002837435) internal successors, (27286), 20441 states have internal predecessors, (27286), 0 states have call successors, (0), 0 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-11 21:34:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20442 states to 20442 states and 27286 transitions. [2024-11-11 21:34:11,894 INFO L78 Accepts]: Start accepts. Automaton has 20442 states and 27286 transitions. Word has length 73 [2024-11-11 21:34:11,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:11,895 INFO L471 AbstractCegarLoop]: Abstraction has 20442 states and 27286 transitions. [2024-11-11 21:34:11,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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-11 21:34:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 20442 states and 27286 transitions. [2024-11-11 21:34:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 21:34:11,897 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:11,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:34:11,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:34:11,898 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:11,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1772479294, now seen corresponding path program 1 times [2024-11-11 21:34:11,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:11,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825984062] [2024-11-11 21:34:11,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:12,016 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-11 21:34:12,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:12,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825984062] [2024-11-11 21:34:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825984062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:12,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:12,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:34:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322751094] [2024-11-11 21:34:12,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:12,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:34:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:12,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:34:12,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:34:12,020 INFO L87 Difference]: Start difference. First operand 20442 states and 27286 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:12,183 INFO L93 Difference]: Finished difference Result 35938 states and 48166 transitions. [2024-11-11 21:34:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:34:12,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-11 21:34:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:12,232 INFO L225 Difference]: With dead ends: 35938 [2024-11-11 21:34:12,233 INFO L226 Difference]: Without dead ends: 29408 [2024-11-11 21:34:12,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:34:12,251 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1023 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:12,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1495 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29408 states. [2024-11-11 21:34:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29408 to 25624. [2024-11-11 21:34:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25624 states, 25623 states have (on average 1.3303672481754674) internal successors, (34088), 25623 states have internal predecessors, (34088), 0 states have call successors, (0), 0 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-11 21:34:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25624 states to 25624 states and 34088 transitions. [2024-11-11 21:34:12,678 INFO L78 Accepts]: Start accepts. Automaton has 25624 states and 34088 transitions. Word has length 77 [2024-11-11 21:34:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:12,678 INFO L471 AbstractCegarLoop]: Abstraction has 25624 states and 34088 transitions. [2024-11-11 21:34:12,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 25624 states and 34088 transitions. [2024-11-11 21:34:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:34:12,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:12,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:34:12,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:34:12,681 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:12,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1856799535, now seen corresponding path program 1 times [2024-11-11 21:34:12,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:12,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438825919] [2024-11-11 21:34:12,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:12,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:12,804 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-11 21:34:12,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:12,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438825919] [2024-11-11 21:34:12,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438825919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:12,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:12,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:34:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401181230] [2024-11-11 21:34:12,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:12,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:34:12,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:12,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:34:12,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:34:12,807 INFO L87 Difference]: Start difference. First operand 25624 states and 34088 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:12,970 INFO L93 Difference]: Finished difference Result 39414 states and 52674 transitions. [2024-11-11 21:34:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:34:12,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:34:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:13,018 INFO L225 Difference]: With dead ends: 39414 [2024-11-11 21:34:13,019 INFO L226 Difference]: Without dead ends: 32884 [2024-11-11 21:34:13,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:34:13,038 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 1028 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:13,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 1509 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32884 states. [2024-11-11 21:34:13,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32884 to 30806. [2024-11-11 21:34:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30806 states, 30805 states have (on average 1.3273819185197209) internal successors, (40890), 30805 states have internal predecessors, (40890), 0 states have call successors, (0), 0 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-11 21:34:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30806 states to 30806 states and 40890 transitions. [2024-11-11 21:34:13,669 INFO L78 Accepts]: Start accepts. Automaton has 30806 states and 40890 transitions. Word has length 78 [2024-11-11 21:34:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:13,669 INFO L471 AbstractCegarLoop]: Abstraction has 30806 states and 40890 transitions. [2024-11-11 21:34:13,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 30806 states and 40890 transitions. [2024-11-11 21:34:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-11 21:34:13,672 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:13,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:34:13,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:34:13,673 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:13,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2010164398, now seen corresponding path program 1 times [2024-11-11 21:34:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:13,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295387163] [2024-11-11 21:34:13,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:13,977 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-11 21:34:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295387163] [2024-11-11 21:34:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295387163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:13,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:13,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:34:13,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289080531] [2024-11-11 21:34:13,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:13,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:34:13,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:34:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:34:13,979 INFO L87 Difference]: Start difference. First operand 30806 states and 40890 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:14,149 INFO L93 Difference]: Finished difference Result 44658 states and 59458 transitions. [2024-11-11 21:34:14,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:34:14,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-11 21:34:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:14,205 INFO L225 Difference]: With dead ends: 44658 [2024-11-11 21:34:14,205 INFO L226 Difference]: Without dead ends: 38088 [2024-11-11 21:34:14,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:34:14,226 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 1106 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:14,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 1334 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:14,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38088 states. [2024-11-11 21:34:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38088 to 36010. [2024-11-11 21:34:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36010 states, 36009 states have (on average 1.324280041100836) internal successors, (47686), 36009 states have internal predecessors, (47686), 0 states have call successors, (0), 0 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-11 21:34:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36010 states to 36010 states and 47686 transitions. [2024-11-11 21:34:14,891 INFO L78 Accepts]: Start accepts. Automaton has 36010 states and 47686 transitions. Word has length 78 [2024-11-11 21:34:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:14,891 INFO L471 AbstractCegarLoop]: Abstraction has 36010 states and 47686 transitions. [2024-11-11 21:34:14,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 36010 states and 47686 transitions. [2024-11-11 21:34:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 21:34:14,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:14,895 INFO L218 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] [2024-11-11 21:34:14,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:34:14,896 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:14,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1003850221, now seen corresponding path program 1 times [2024-11-11 21:34:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:14,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975904927] [2024-11-11 21:34:14,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:15,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-11 21:34:15,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:15,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975904927] [2024-11-11 21:34:15,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975904927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:15,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:15,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:34:15,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415747635] [2024-11-11 21:34:15,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:15,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:34:15,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:15,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:34:15,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:34:15,066 INFO L87 Difference]: Start difference. First operand 36010 states and 47686 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-11 21:34:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:15,376 INFO L93 Difference]: Finished difference Result 56544 states and 75121 transitions. [2024-11-11 21:34:15,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:34:15,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-11 21:34:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:15,432 INFO L225 Difference]: With dead ends: 56544 [2024-11-11 21:34:15,432 INFO L226 Difference]: Without dead ends: 44834 [2024-11-11 21:34:15,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:34:15,447 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1298 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:15,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 1339 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:15,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44834 states. [2024-11-11 21:34:15,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44834 to 41114. [2024-11-11 21:34:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41114 states, 41113 states have (on average 1.3249823656750905) internal successors, (54474), 41113 states have internal predecessors, (54474), 0 states have call successors, (0), 0 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-11 21:34:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41114 states to 41114 states and 54474 transitions. [2024-11-11 21:34:16,130 INFO L78 Accepts]: Start accepts. Automaton has 41114 states and 54474 transitions. Word has length 85 [2024-11-11 21:34:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:16,130 INFO L471 AbstractCegarLoop]: Abstraction has 41114 states and 54474 transitions. [2024-11-11 21:34:16,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-11 21:34:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 41114 states and 54474 transitions. [2024-11-11 21:34:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 21:34:16,134 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:16,134 INFO L218 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] [2024-11-11 21:34:16,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:34:16,134 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:16,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1777388971, now seen corresponding path program 1 times [2024-11-11 21:34:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939638651] [2024-11-11 21:34:16,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:16,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:16,337 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-11 21:34:16,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:16,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939638651] [2024-11-11 21:34:16,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939638651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:16,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:16,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:34:16,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826367668] [2024-11-11 21:34:16,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:16,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:34:16,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:16,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:34:16,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:34:16,339 INFO L87 Difference]: Start difference. First operand 41114 states and 54474 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-11 21:34:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:16,655 INFO L93 Difference]: Finished difference Result 65096 states and 86389 transitions. [2024-11-11 21:34:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:34:16,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-11 21:34:16,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:16,715 INFO L225 Difference]: With dead ends: 65096 [2024-11-11 21:34:16,716 INFO L226 Difference]: Without dead ends: 44566 [2024-11-11 21:34:16,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:34:16,741 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1020 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:16,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 1488 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:34:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44566 states. [2024-11-11 21:34:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44566 to 40838. [2024-11-11 21:34:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40838 states, 40837 states have (on average 1.3226730660920243) internal successors, (54014), 40837 states have internal predecessors, (54014), 0 states have call successors, (0), 0 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-11 21:34:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40838 states to 40838 states and 54014 transitions. [2024-11-11 21:34:17,503 INFO L78 Accepts]: Start accepts. Automaton has 40838 states and 54014 transitions. Word has length 85 [2024-11-11 21:34:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:17,503 INFO L471 AbstractCegarLoop]: Abstraction has 40838 states and 54014 transitions. [2024-11-11 21:34:17,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-11 21:34:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 40838 states and 54014 transitions. [2024-11-11 21:34:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 21:34:17,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:17,507 INFO L218 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] [2024-11-11 21:34:17,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:34:17,507 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:17,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1764353414, now seen corresponding path program 1 times [2024-11-11 21:34:17,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:17,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571362540] [2024-11-11 21:34:17,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:17,683 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-11 21:34:17,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:17,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571362540] [2024-11-11 21:34:17,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571362540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:17,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:17,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:34:17,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93771802] [2024-11-11 21:34:17,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:17,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:34:17,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:17,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:34:17,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:34:17,685 INFO L87 Difference]: Start difference. First operand 40838 states and 54014 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-11 21:34:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:17,858 INFO L93 Difference]: Finished difference Result 65352 states and 86485 transitions. [2024-11-11 21:34:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:34:17,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-11 21:34:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:17,906 INFO L225 Difference]: With dead ends: 65352 [2024-11-11 21:34:17,906 INFO L226 Difference]: Without dead ends: 46078 [2024-11-11 21:34:17,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:34:17,929 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 1090 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:17,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1334 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:34:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46078 states. [2024-11-11 21:34:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46078 to 40562. [2024-11-11 21:34:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40562 states, 40561 states have (on average 1.3203323389462784) internal successors, (53554), 40561 states have internal predecessors, (53554), 0 states have call successors, (0), 0 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-11 21:34:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40562 states to 40562 states and 53554 transitions. [2024-11-11 21:34:18,500 INFO L78 Accepts]: Start accepts. Automaton has 40562 states and 53554 transitions. Word has length 85 [2024-11-11 21:34:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:18,500 INFO L471 AbstractCegarLoop]: Abstraction has 40562 states and 53554 transitions. [2024-11-11 21:34:18,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-11 21:34:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 40562 states and 53554 transitions. [2024-11-11 21:34:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-11 21:34:18,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:18,504 INFO L218 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] [2024-11-11 21:34:18,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 21:34:18,505 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:18,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash 747174186, now seen corresponding path program 1 times [2024-11-11 21:34:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:18,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857123631] [2024-11-11 21:34:18,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:18,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:18,646 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-11 21:34:18,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:18,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857123631] [2024-11-11 21:34:18,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857123631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:18,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:34:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592054179] [2024-11-11 21:34:18,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:18,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:34:18,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:18,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:34:18,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:34:18,648 INFO L87 Difference]: Start difference. First operand 40562 states and 53554 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-11 21:34:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:19,399 INFO L93 Difference]: Finished difference Result 50164 states and 66192 transitions. [2024-11-11 21:34:19,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:34:19,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-11 21:34:19,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:19,460 INFO L225 Difference]: With dead ends: 50164 [2024-11-11 21:34:19,460 INFO L226 Difference]: Without dead ends: 49034 [2024-11-11 21:34:19,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:34:19,473 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 2243 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2243 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:19,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2243 Valid, 717 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:34:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49034 states. [2024-11-11 21:34:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49034 to 40560. [2024-11-11 21:34:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40560 states, 40559 states have (on average 1.3202988239355014) internal successors, (53550), 40559 states have internal predecessors, (53550), 0 states have call successors, (0), 0 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-11 21:34:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40560 states to 40560 states and 53550 transitions. [2024-11-11 21:34:20,056 INFO L78 Accepts]: Start accepts. Automaton has 40560 states and 53550 transitions. Word has length 86 [2024-11-11 21:34:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:20,056 INFO L471 AbstractCegarLoop]: Abstraction has 40560 states and 53550 transitions. [2024-11-11 21:34:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-11 21:34:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 40560 states and 53550 transitions. [2024-11-11 21:34:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-11 21:34:20,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:20,060 INFO L218 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] [2024-11-11 21:34:20,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 21:34:20,060 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:20,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1308336955, now seen corresponding path program 1 times [2024-11-11 21:34:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:20,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690380640] [2024-11-11 21:34:20,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:20,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:20,496 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-11 21:34:20,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:20,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690380640] [2024-11-11 21:34:20,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690380640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:20,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:20,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:34:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793112422] [2024-11-11 21:34:20,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:20,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:34:20,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:20,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:34:20,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:34:20,499 INFO L87 Difference]: Start difference. First operand 40560 states and 53550 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-11 21:34:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:21,116 INFO L93 Difference]: Finished difference Result 50434 states and 66532 transitions. [2024-11-11 21:34:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:34:21,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-11 21:34:21,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:21,179 INFO L225 Difference]: With dead ends: 50434 [2024-11-11 21:34:21,180 INFO L226 Difference]: Without dead ends: 49032 [2024-11-11 21:34:21,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:34:21,200 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 2247 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2247 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:21,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2247 Valid, 709 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:34:21,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49032 states. [2024-11-11 21:34:21,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49032 to 40558. [2024-11-11 21:34:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40558 states, 40557 states have (on average 1.320265305619252) internal successors, (53546), 40557 states have internal predecessors, (53546), 0 states have call successors, (0), 0 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-11 21:34:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40558 states to 40558 states and 53546 transitions. [2024-11-11 21:34:21,795 INFO L78 Accepts]: Start accepts. Automaton has 40558 states and 53546 transitions. Word has length 86 [2024-11-11 21:34:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:21,795 INFO L471 AbstractCegarLoop]: Abstraction has 40558 states and 53546 transitions. [2024-11-11 21:34:21,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-11 21:34:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 40558 states and 53546 transitions. [2024-11-11 21:34:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:34:21,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:21,802 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:34:21,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 21:34:21,802 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:21,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:21,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1313750202, now seen corresponding path program 1 times [2024-11-11 21:34:21,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:21,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925007471] [2024-11-11 21:34:21,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:21,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:34:22,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925007471] [2024-11-11 21:34:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925007471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:22,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:22,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:34:22,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315668267] [2024-11-11 21:34:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:22,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:34:22,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:22,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:34:22,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:34:22,049 INFO L87 Difference]: Start difference. First operand 40558 states and 53546 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-11 21:34:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:22,856 INFO L93 Difference]: Finished difference Result 76695 states and 101293 transitions. [2024-11-11 21:34:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:34:22,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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-11 21:34:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:22,909 INFO L225 Difference]: With dead ends: 76695 [2024-11-11 21:34:22,910 INFO L226 Difference]: Without dead ends: 58657 [2024-11-11 21:34:22,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:34:22,922 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 2297 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:22,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 1056 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:34:22,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58657 states. [2024-11-11 21:34:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58657 to 40544. [2024-11-11 21:34:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40544 states, 40543 states have (on average 1.320351232025257) internal successors, (53531), 40543 states have internal predecessors, (53531), 0 states have call successors, (0), 0 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-11 21:34:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40544 states to 40544 states and 53531 transitions. [2024-11-11 21:34:23,569 INFO L78 Accepts]: Start accepts. Automaton has 40544 states and 53531 transitions. Word has length 93 [2024-11-11 21:34:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:23,569 INFO L471 AbstractCegarLoop]: Abstraction has 40544 states and 53531 transitions. [2024-11-11 21:34:23,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-11 21:34:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 40544 states and 53531 transitions. [2024-11-11 21:34:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:34:23,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:23,580 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:34:23,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 21:34:23,580 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:23,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash 648664286, now seen corresponding path program 1 times [2024-11-11 21:34:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:23,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485186923] [2024-11-11 21:34:23,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:23,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:23,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:23,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485186923] [2024-11-11 21:34:23,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485186923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:34:23,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072406097] [2024-11-11 21:34:23,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:23,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:34:23,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:34:23,912 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-11 21:34:23,914 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-11 21:34:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:24,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 21:34:24,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:34:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:24,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:34:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:25,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072406097] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:34:25,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:34:25,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 21 [2024-11-11 21:34:25,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977187513] [2024-11-11 21:34:25,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:34:25,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:34:25,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:25,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:34:25,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:34:25,953 INFO L87 Difference]: Start difference. First operand 40544 states and 53531 transitions. Second operand has 21 states, 21 states have (on average 12.619047619047619) internal successors, (265), 21 states have internal predecessors, (265), 0 states have call successors, (0), 0 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-11 21:34:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:28,932 INFO L93 Difference]: Finished difference Result 200166 states and 264008 transitions. [2024-11-11 21:34:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-11 21:34:28,933 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 12.619047619047619) internal successors, (265), 21 states have internal predecessors, (265), 0 states have call successors, (0), 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-11 21:34:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:29,105 INFO L225 Difference]: With dead ends: 200166 [2024-11-11 21:34:29,105 INFO L226 Difference]: Without dead ends: 160152 [2024-11-11 21:34:29,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=845, Invalid=3315, Unknown=0, NotChecked=0, Total=4160 [2024-11-11 21:34:29,166 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 3714 mSDsluCounter, 3667 mSDsCounter, 0 mSdLazyCounter, 4072 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3714 SdHoareTripleChecker+Valid, 4024 SdHoareTripleChecker+Invalid, 4124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:29,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3714 Valid, 4024 Invalid, 4124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4072 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 21:34:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160152 states. [2024-11-11 21:34:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160152 to 53736. [2024-11-11 21:34:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53736 states, 53735 states have (on average 1.3190843956452964) internal successors, (70881), 53735 states have internal predecessors, (70881), 0 states have call successors, (0), 0 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-11 21:34:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53736 states to 53736 states and 70881 transitions. [2024-11-11 21:34:30,674 INFO L78 Accepts]: Start accepts. Automaton has 53736 states and 70881 transitions. Word has length 93 [2024-11-11 21:34:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:30,674 INFO L471 AbstractCegarLoop]: Abstraction has 53736 states and 70881 transitions. [2024-11-11 21:34:30,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.619047619047619) internal successors, (265), 21 states have internal predecessors, (265), 0 states have call successors, (0), 0 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-11 21:34:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 53736 states and 70881 transitions. [2024-11-11 21:34:30,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 21:34:30,684 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:30,684 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:34:30,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 21:34:30,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:34:30,885 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:30,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1428265138, now seen corresponding path program 1 times [2024-11-11 21:34:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:30,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957680942] [2024-11-11 21:34:30,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:31,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:31,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957680942] [2024-11-11 21:34:31,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957680942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:31,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:31,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:34:31,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297535270] [2024-11-11 21:34:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:31,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:34:31,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:31,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:34:31,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:34:31,004 INFO L87 Difference]: Start difference. First operand 53736 states and 70881 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-11 21:34:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:31,703 INFO L93 Difference]: Finished difference Result 160317 states and 211475 transitions. [2024-11-11 21:34:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:34:31,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-11 21:34:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:31,830 INFO L225 Difference]: With dead ends: 160317 [2024-11-11 21:34:31,830 INFO L226 Difference]: Without dead ends: 107476 [2024-11-11 21:34:31,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:34:31,882 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 1001 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:31,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 854 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:34:31,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107476 states. [2024-11-11 21:34:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107476 to 74128. [2024-11-11 21:34:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74128 states, 74127 states have (on average 1.2889095741092989) internal successors, (95543), 74127 states have internal predecessors, (95543), 0 states have call successors, (0), 0 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-11 21:34:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74128 states to 74128 states and 95543 transitions. [2024-11-11 21:34:33,408 INFO L78 Accepts]: Start accepts. Automaton has 74128 states and 95543 transitions. Word has length 97 [2024-11-11 21:34:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:33,409 INFO L471 AbstractCegarLoop]: Abstraction has 74128 states and 95543 transitions. [2024-11-11 21:34:33,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-11 21:34:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 74128 states and 95543 transitions. [2024-11-11 21:34:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 21:34:33,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:33,421 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:34:33,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-11 21:34:33,422 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:33,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2003684455, now seen corresponding path program 1 times [2024-11-11 21:34:33,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:33,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993064355] [2024-11-11 21:34:33,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:34,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:34,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993064355] [2024-11-11 21:34:34,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993064355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:34,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:34,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:34:34,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241933161] [2024-11-11 21:34:34,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:34,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:34:34,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:34,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:34:34,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:34:34,005 INFO L87 Difference]: Start difference. First operand 74128 states and 95543 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-11 21:34:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:34,620 INFO L93 Difference]: Finished difference Result 153314 states and 197556 transitions. [2024-11-11 21:34:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:34:34,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-11 21:34:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:34,714 INFO L225 Difference]: With dead ends: 153314 [2024-11-11 21:34:34,714 INFO L226 Difference]: Without dead ends: 79802 [2024-11-11 21:34:34,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:34:34,763 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 1018 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:34,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 745 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:34:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79802 states. [2024-11-11 21:34:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79802 to 70931. [2024-11-11 21:34:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70931 states, 70930 states have (on average 1.2597067531368955) internal successors, (89351), 70930 states have internal predecessors, (89351), 0 states have call successors, (0), 0 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-11 21:34:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70931 states to 70931 states and 89351 transitions. [2024-11-11 21:34:35,800 INFO L78 Accepts]: Start accepts. Automaton has 70931 states and 89351 transitions. Word has length 97 [2024-11-11 21:34:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:35,801 INFO L471 AbstractCegarLoop]: Abstraction has 70931 states and 89351 transitions. [2024-11-11 21:34:35,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 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-11 21:34:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 70931 states and 89351 transitions. [2024-11-11 21:34:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 21:34:35,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:35,808 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:34:35,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-11 21:34:35,809 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:35,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:35,809 INFO L85 PathProgramCache]: Analyzing trace with hash 321227878, now seen corresponding path program 1 times [2024-11-11 21:34:35,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:35,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399939727] [2024-11-11 21:34:35,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:35,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:34:35,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:35,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399939727] [2024-11-11 21:34:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399939727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:35,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:35,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:35,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405925137] [2024-11-11 21:34:35,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:35,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:35,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:35,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:35,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:35,887 INFO L87 Difference]: Start difference. First operand 70931 states and 89351 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-11 21:34:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:36,115 INFO L93 Difference]: Finished difference Result 90177 states and 113356 transitions. [2024-11-11 21:34:36,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:36,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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 98 [2024-11-11 21:34:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:36,175 INFO L225 Difference]: With dead ends: 90177 [2024-11-11 21:34:36,175 INFO L226 Difference]: Without dead ends: 51691 [2024-11-11 21:34:36,205 INFO L434 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-11 21:34:36,205 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 155 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:36,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 971 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:34:36,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51691 states. [2024-11-11 21:34:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51691 to 51581. [2024-11-11 21:34:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51581 states, 51580 states have (on average 1.247499030632028) internal successors, (64346), 51580 states have internal predecessors, (64346), 0 states have call successors, (0), 0 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-11 21:34:37,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51581 states to 51581 states and 64346 transitions. [2024-11-11 21:34:37,109 INFO L78 Accepts]: Start accepts. Automaton has 51581 states and 64346 transitions. Word has length 98 [2024-11-11 21:34:37,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:37,109 INFO L471 AbstractCegarLoop]: Abstraction has 51581 states and 64346 transitions. [2024-11-11 21:34:37,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-11 21:34:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 51581 states and 64346 transitions. [2024-11-11 21:34:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 21:34:37,116 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:37,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:34:37,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 21:34:37,116 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:37,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash 106277470, now seen corresponding path program 1 times [2024-11-11 21:34:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905025714] [2024-11-11 21:34:37,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:37,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:37,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905025714] [2024-11-11 21:34:37,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905025714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:37,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:37,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:37,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407666198] [2024-11-11 21:34:37,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:37,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:37,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:37,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:37,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:37,193 INFO L87 Difference]: Start difference. First operand 51581 states and 64346 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-11 21:34:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:37,349 INFO L93 Difference]: Finished difference Result 66632 states and 82877 transitions. [2024-11-11 21:34:37,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:37,350 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-11 21:34:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:37,390 INFO L225 Difference]: With dead ends: 66632 [2024-11-11 21:34:37,390 INFO L226 Difference]: Without dead ends: 35363 [2024-11-11 21:34:37,412 INFO L434 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-11 21:34:37,413 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 172 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:37,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 925 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:34:37,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35363 states. [2024-11-11 21:34:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35363 to 35331. [2024-11-11 21:34:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35331 states, 35330 states have (on average 1.2313331446362865) internal successors, (43503), 35330 states have internal predecessors, (43503), 0 states have call successors, (0), 0 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-11 21:34:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35331 states to 35331 states and 43503 transitions. [2024-11-11 21:34:38,162 INFO L78 Accepts]: Start accepts. Automaton has 35331 states and 43503 transitions. Word has length 98 [2024-11-11 21:34:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:38,162 INFO L471 AbstractCegarLoop]: Abstraction has 35331 states and 43503 transitions. [2024-11-11 21:34:38,162 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-11 21:34:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 35331 states and 43503 transitions. [2024-11-11 21:34:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:34:38,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:38,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:34:38,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-11 21:34:38,169 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:38,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:38,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2063038233, now seen corresponding path program 1 times [2024-11-11 21:34:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:38,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188886612] [2024-11-11 21:34:38,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:38,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 21:34:38,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:38,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188886612] [2024-11-11 21:34:38,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188886612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:38,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:38,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:34:38,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860313485] [2024-11-11 21:34:38,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:38,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:34:38,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:34:38,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:34:38,266 INFO L87 Difference]: Start difference. First operand 35331 states and 43503 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-11 21:34:38,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:38,407 INFO L93 Difference]: Finished difference Result 45268 states and 55703 transitions. [2024-11-11 21:34:38,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:34:38,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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 100 [2024-11-11 21:34:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:38,435 INFO L225 Difference]: With dead ends: 45268 [2024-11-11 21:34:38,435 INFO L226 Difference]: Without dead ends: 22423 [2024-11-11 21:34:38,449 INFO L434 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-11 21:34:38,450 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 161 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:38,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 957 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:34:38,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22423 states. [2024-11-11 21:34:38,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22423 to 21591. [2024-11-11 21:34:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21591 states, 21590 states have (on average 1.215886984715146) internal successors, (26251), 21590 states have internal predecessors, (26251), 0 states have call successors, (0), 0 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-11 21:34:38,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21591 states to 21591 states and 26251 transitions. [2024-11-11 21:34:38,705 INFO L78 Accepts]: Start accepts. Automaton has 21591 states and 26251 transitions. Word has length 100 [2024-11-11 21:34:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:38,706 INFO L471 AbstractCegarLoop]: Abstraction has 21591 states and 26251 transitions. [2024-11-11 21:34:38,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 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-11 21:34:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 21591 states and 26251 transitions. [2024-11-11 21:34:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 21:34:38,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:38,712 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:34:38,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-11 21:34:38,712 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:38,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1965208128, now seen corresponding path program 1 times [2024-11-11 21:34:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:38,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419740057] [2024-11-11 21:34:38,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:38,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419740057] [2024-11-11 21:34:38,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419740057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:34:38,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444327019] [2024-11-11 21:34:38,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:38,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:34:38,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:34:38,847 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-11 21:34:38,848 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-11 21:34:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:39,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 21:34:39,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:34:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:39,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:34:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:39,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444327019] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:34:39,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:34:39,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2024-11-11 21:34:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797665048] [2024-11-11 21:34:39,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:34:39,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 21:34:39,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:39,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 21:34:39,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:34:39,719 INFO L87 Difference]: Start difference. First operand 21591 states and 26251 transitions. Second operand has 14 states, 14 states have (on average 19.785714285714285) internal successors, (277), 14 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:40,684 INFO L93 Difference]: Finished difference Result 46890 states and 57060 transitions. [2024-11-11 21:34:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:34:40,685 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 19.785714285714285) internal successors, (277), 14 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-11 21:34:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:40,712 INFO L225 Difference]: With dead ends: 46890 [2024-11-11 21:34:40,712 INFO L226 Difference]: Without dead ends: 25912 [2024-11-11 21:34:40,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:34:40,727 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 3479 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3479 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:40,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3479 Valid, 1662 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:34:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25912 states. [2024-11-11 21:34:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25912 to 23074. [2024-11-11 21:34:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23074 states, 23073 states have (on average 1.1988037966454297) internal successors, (27660), 23073 states have internal predecessors, (27660), 0 states have call successors, (0), 0 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-11 21:34:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23074 states to 23074 states and 27660 transitions. [2024-11-11 21:34:40,921 INFO L78 Accepts]: Start accepts. Automaton has 23074 states and 27660 transitions. Word has length 101 [2024-11-11 21:34:40,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:40,922 INFO L471 AbstractCegarLoop]: Abstraction has 23074 states and 27660 transitions. [2024-11-11 21:34:40,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 19.785714285714285) internal successors, (277), 14 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:34:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23074 states and 27660 transitions. [2024-11-11 21:34:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 21:34:40,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:40,927 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:34:40,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:34:41,127 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,SelfDestructingSolverStorable36 [2024-11-11 21:34:41,128 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:41,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:41,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1034101961, now seen corresponding path program 1 times [2024-11-11 21:34:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:41,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875883209] [2024-11-11 21:34:41,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 21:34:41,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:41,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875883209] [2024-11-11 21:34:41,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875883209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:41,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:41,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:34:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101822722] [2024-11-11 21:34:41,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:41,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:34:41,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:41,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:34:41,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:34:41,217 INFO L87 Difference]: Start difference. First operand 23074 states and 27660 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-11 21:34:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:41,579 INFO L93 Difference]: Finished difference Result 42149 states and 50849 transitions. [2024-11-11 21:34:41,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:34:41,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-11 21:34:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:41,610 INFO L225 Difference]: With dead ends: 42149 [2024-11-11 21:34:41,610 INFO L226 Difference]: Without dead ends: 34856 [2024-11-11 21:34:41,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:34:41,622 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 388 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:41,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1120 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:34:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34856 states. [2024-11-11 21:34:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34856 to 26575. [2024-11-11 21:34:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26575 states, 26574 states have (on average 1.200007526153383) internal successors, (31889), 26574 states have internal predecessors, (31889), 0 states have call successors, (0), 0 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-11 21:34:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26575 states to 26575 states and 31889 transitions. [2024-11-11 21:34:41,870 INFO L78 Accepts]: Start accepts. Automaton has 26575 states and 31889 transitions. Word has length 103 [2024-11-11 21:34:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:41,870 INFO L471 AbstractCegarLoop]: Abstraction has 26575 states and 31889 transitions. [2024-11-11 21:34:41,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-11 21:34:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 26575 states and 31889 transitions. [2024-11-11 21:34:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 21:34:41,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:41,876 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:34:41,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-11 21:34:41,876 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:41,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1054150810, now seen corresponding path program 1 times [2024-11-11 21:34:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:41,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831361352] [2024-11-11 21:34:41,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:42,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:42,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831361352] [2024-11-11 21:34:42,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831361352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:42,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:42,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:34:42,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935692096] [2024-11-11 21:34:42,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:42,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:34:42,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:34:42,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:34:42,396 INFO L87 Difference]: Start difference. First operand 26575 states and 31889 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-11 21:34:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:43,245 INFO L93 Difference]: Finished difference Result 58867 states and 70788 transitions. [2024-11-11 21:34:43,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 21:34:43,246 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-11-11 21:34:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:43,291 INFO L225 Difference]: With dead ends: 58867 [2024-11-11 21:34:43,291 INFO L226 Difference]: Without dead ends: 45776 [2024-11-11 21:34:43,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-11-11 21:34:43,309 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 2723 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2723 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:43,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2723 Valid, 1732 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:34:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45776 states. [2024-11-11 21:34:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45776 to 43600. [2024-11-11 21:34:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43600 states, 43599 states have (on average 1.2002798229317186) internal successors, (52331), 43599 states have internal predecessors, (52331), 0 states have call successors, (0), 0 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-11 21:34:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43600 states to 43600 states and 52331 transitions. [2024-11-11 21:34:43,690 INFO L78 Accepts]: Start accepts. Automaton has 43600 states and 52331 transitions. Word has length 104 [2024-11-11 21:34:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:43,690 INFO L471 AbstractCegarLoop]: Abstraction has 43600 states and 52331 transitions. [2024-11-11 21:34:43,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 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-11 21:34:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 43600 states and 52331 transitions. [2024-11-11 21:34:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 21:34:43,698 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:43,698 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:34:43,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-11 21:34:43,699 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:43,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:43,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1201921318, now seen corresponding path program 1 times [2024-11-11 21:34:43,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:43,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772272573] [2024-11-11 21:34:43,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:43,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 21:34:43,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:43,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772272573] [2024-11-11 21:34:43,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772272573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:34:43,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:34:43,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:34:43,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027671100] [2024-11-11 21:34:43,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:34:43,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:34:43,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:43,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:34:43,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:34:43,902 INFO L87 Difference]: Start difference. First operand 43600 states and 52331 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-11 21:34:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:34:44,242 INFO L93 Difference]: Finished difference Result 67320 states and 80262 transitions. [2024-11-11 21:34:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:34:44,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 105 [2024-11-11 21:34:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:34:44,306 INFO L225 Difference]: With dead ends: 67320 [2024-11-11 21:34:44,306 INFO L226 Difference]: Without dead ends: 58934 [2024-11-11 21:34:44,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:34:44,328 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 340 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:34:44,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 997 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:34:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58934 states. [2024-11-11 21:34:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58934 to 47919. [2024-11-11 21:34:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47919 states, 47918 states have (on average 1.1996953128260779) internal successors, (57487), 47918 states have internal predecessors, (57487), 0 states have call successors, (0), 0 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-11 21:34:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47919 states to 47919 states and 57487 transitions. [2024-11-11 21:34:44,801 INFO L78 Accepts]: Start accepts. Automaton has 47919 states and 57487 transitions. Word has length 105 [2024-11-11 21:34:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:34:44,801 INFO L471 AbstractCegarLoop]: Abstraction has 47919 states and 57487 transitions. [2024-11-11 21:34:44,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 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-11 21:34:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 47919 states and 57487 transitions. [2024-11-11 21:34:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 21:34:44,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:34:44,810 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:34:44,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-11 21:34:44,810 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-11 21:34:44,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:34:44,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1516488219, now seen corresponding path program 1 times [2024-11-11 21:34:44,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:34:44,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372659168] [2024-11-11 21:34:44,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:34:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:34:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372659168] [2024-11-11 21:34:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372659168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:34:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939781986] [2024-11-11 21:34:45,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:34:45,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:34:45,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:34:45,218 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-11 21:34:45,220 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-11 21:34:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:34:45,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-11 21:34:45,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:34:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:46,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:34:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:34:47,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939781986] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:34:47,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:34:47,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 15] total 34 [2024-11-11 21:34:47,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957394562] [2024-11-11 21:34:47,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:34:47,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-11 21:34:47,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:34:47,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-11 21:34:47,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2024-11-11 21:34:47,387 INFO L87 Difference]: Start difference. First operand 47919 states and 57487 transitions. Second operand has 35 states, 35 states have (on average 8.257142857142858) internal successors, (289), 34 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)