./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.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 72aca9735a0330ad4ed4e9de4f21904354ce62c742d488d0b09ce6da875c2798 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:48:09,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:48:09,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:48:09,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:48:09,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:48:09,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:48:09,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:48:09,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:48:09,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:48:09,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:48:09,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:48:09,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:48:09,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:48:09,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:48:09,233 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:48:09,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:48:09,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:48:09,234 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:48:09,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:48:09,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:48:09,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:48:09,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:48:09,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:48:09,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:48:09,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:48:09,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:48:09,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:48:09,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:48:09,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:48:09,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:48:09,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:48:09,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:48:09,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:48:09,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:48:09,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:48:09,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:48:09,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:48:09,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:48:09,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:48:09,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:48:09,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:48:09,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:48:09,239 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72aca9735a0330ad4ed4e9de4f21904354ce62c742d488d0b09ce6da875c2798 [2024-10-14 03:48:09,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:48:09,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:48:09,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:48:09,502 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:48:09,502 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:48:09,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-10-14 03:48:10,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:48:11,135 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:48:11,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-10-14 03:48:11,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/186f01bf3/71680973bd1349f7afc9f27e075c78f7/FLAG90af33ec4 [2024-10-14 03:48:11,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/186f01bf3/71680973bd1349f7afc9f27e075c78f7 [2024-10-14 03:48:11,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:48:11,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:48:11,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:48:11,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:48:11,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:48:11,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:48:11" (1/1) ... [2024-10-14 03:48:11,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3facaa30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:11, skipping insertion in model container [2024-10-14 03:48:11,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:48:11" (1/1) ... [2024-10-14 03:48:11,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:48:11,514 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8448,8461] [2024-10-14 03:48:11,535 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12616,12629] [2024-10-14 03:48:11,560 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20366,20379] [2024-10-14 03:48:11,585 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27098,27111] [2024-10-14 03:48:11,643 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[47963,47976] [2024-10-14 03:48:11,704 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[73065,73078] [2024-10-14 03:48:11,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:48:11,877 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:48:11,916 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[8448,8461] [2024-10-14 03:48:11,936 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12616,12629] [2024-10-14 03:48:12,018 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[20366,20379] [2024-10-14 03:48:12,042 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[27098,27111] [2024-10-14 03:48:12,065 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[47963,47976] [2024-10-14 03:48:12,090 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[73065,73078] [2024-10-14 03:48:12,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:48:12,172 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:48:12,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12 WrapperNode [2024-10-14 03:48:12,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:48:12,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:48:12,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:48:12,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:48:12,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,325 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6152 [2024-10-14 03:48:12,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:48:12,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:48:12,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:48:12,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:48:12,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,405 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:48:12,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,490 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:48:12,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:48:12,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:48:12,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:48:12,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (1/1) ... [2024-10-14 03:48:12,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:48:12,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:48:12,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:48:12,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:48:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:48:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:48:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:48:12,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:48:12,848 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:48:12,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:48:15,212 INFO L? ?]: Removed 1224 outVars from TransFormulas that were not future-live. [2024-10-14 03:48:15,212 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:48:15,284 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:48:15,284 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:48:15,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:48:15 BoogieIcfgContainer [2024-10-14 03:48:15,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:48:15,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:48:15,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:48:15,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:48:15,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:48:11" (1/3) ... [2024-10-14 03:48:15,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714a2ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:48:15, skipping insertion in model container [2024-10-14 03:48:15,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:48:12" (2/3) ... [2024-10-14 03:48:15,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714a2ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:48:15, skipping insertion in model container [2024-10-14 03:48:15,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:48:15" (3/3) ... [2024-10-14 03:48:15,295 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-10-14 03:48:15,309 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:48:15,309 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-14 03:48:15,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:48:15,399 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;@7f84cc14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:48:15,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 03:48:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 1188 states, 1181 states have (on average 1.787468247248095) internal successors, (2111), 1187 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:48:15,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:15,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:15,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:15,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash 440971975, now seen corresponding path program 1 times [2024-10-14 03:48:15,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:15,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497914738] [2024-10-14 03:48:15,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:15,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:15,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497914738] [2024-10-14 03:48:15,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497914738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:15,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:15,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:48:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649476599] [2024-10-14 03:48:15,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:15,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:48:15,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:15,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:48:15,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:48:15,966 INFO L87 Difference]: Start difference. First operand has 1188 states, 1181 states have (on average 1.787468247248095) internal successors, (2111), 1187 states have internal predecessors, (2111), 0 states have call successors, (0), 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.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:17,025 INFO L93 Difference]: Finished difference Result 2198 states and 3799 transitions. [2024-10-14 03:48:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:48:17,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-14 03:48:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:17,048 INFO L225 Difference]: With dead ends: 2198 [2024-10-14 03:48:17,048 INFO L226 Difference]: Without dead ends: 1433 [2024-10-14 03:48:17,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:17,064 INFO L432 NwaCegarLoop]: 1135 mSDtfsCounter, 6727 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6727 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:17,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6727 Valid, 1519 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:48:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-10-14 03:48:17,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1419. [2024-10-14 03:48:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1413 states have (on average 1.300070771408351) internal successors, (1837), 1418 states have internal predecessors, (1837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1837 transitions. [2024-10-14 03:48:17,189 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1837 transitions. Word has length 51 [2024-10-14 03:48:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:17,190 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 1837 transitions. [2024-10-14 03:48:17,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1837 transitions. [2024-10-14 03:48:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:48:17,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:17,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:17,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:48:17,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:17,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash -230979491, now seen corresponding path program 1 times [2024-10-14 03:48:17,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:17,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240342249] [2024-10-14 03:48:17,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:17,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:17,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-10-14 03:48:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:17,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240342249] [2024-10-14 03:48:17,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240342249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:17,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:48:17,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680625819] [2024-10-14 03:48:17,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:17,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:48:17,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:17,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:48:17,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:48:17,341 INFO L87 Difference]: Start difference. First operand 1419 states and 1837 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:18,137 INFO L93 Difference]: Finished difference Result 2664 states and 3515 transitions. [2024-10-14 03:48:18,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:48:18,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-14 03:48:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:18,143 INFO L225 Difference]: With dead ends: 2664 [2024-10-14 03:48:18,144 INFO L226 Difference]: Without dead ends: 1805 [2024-10-14 03:48:18,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:18,146 INFO L432 NwaCegarLoop]: 633 mSDtfsCounter, 4443 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4443 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:18,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4443 Valid, 900 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:48:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2024-10-14 03:48:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1795. [2024-10-14 03:48:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1789 states have (on average 1.3186137506987143) internal successors, (2359), 1794 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2359 transitions. [2024-10-14 03:48:18,178 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2359 transitions. Word has length 51 [2024-10-14 03:48:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:18,179 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 2359 transitions. [2024-10-14 03:48:18,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2359 transitions. [2024-10-14 03:48:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:48:18,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:18,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:18,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:48:18,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:18,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:18,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1941934323, now seen corresponding path program 1 times [2024-10-14 03:48:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:18,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501498076] [2024-10-14 03:48:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:18,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:18,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:18,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501498076] [2024-10-14 03:48:18,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501498076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:18,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:18,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:48:18,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703600322] [2024-10-14 03:48:18,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:18,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:48:18,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:18,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:48:18,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:48:18,291 INFO L87 Difference]: Start difference. First operand 1795 states and 2359 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:19,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:19,049 INFO L93 Difference]: Finished difference Result 3576 states and 4760 transitions. [2024-10-14 03:48:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:48:19,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-14 03:48:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:19,058 INFO L225 Difference]: With dead ends: 3576 [2024-10-14 03:48:19,059 INFO L226 Difference]: Without dead ends: 2638 [2024-10-14 03:48:19,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:19,062 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 4016 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4016 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:19,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4016 Valid, 857 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:48:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2024-10-14 03:48:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2632. [2024-10-14 03:48:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 2626 states have (on average 1.3115003808073116) internal successors, (3444), 2631 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 3444 transitions. [2024-10-14 03:48:19,116 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 3444 transitions. Word has length 51 [2024-10-14 03:48:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:19,116 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 3444 transitions. [2024-10-14 03:48:19,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3444 transitions. [2024-10-14 03:48:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:48:19,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:19,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:19,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:48:19,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:19,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash -274476207, now seen corresponding path program 1 times [2024-10-14 03:48:19,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:19,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653992252] [2024-10-14 03:48:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:19,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:19,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653992252] [2024-10-14 03:48:19,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653992252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:19,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:19,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:48:19,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194408978] [2024-10-14 03:48:19,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:19,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:48:19,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:48:19,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:48:19,435 INFO L87 Difference]: Start difference. First operand 2632 states and 3444 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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-10-14 03:48:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:20,979 INFO L93 Difference]: Finished difference Result 4763 states and 6443 transitions. [2024-10-14 03:48:20,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:48:20,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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-10-14 03:48:20,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:20,991 INFO L225 Difference]: With dead ends: 4763 [2024-10-14 03:48:20,991 INFO L226 Difference]: Without dead ends: 4235 [2024-10-14 03:48:20,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:48:20,994 INFO L432 NwaCegarLoop]: 650 mSDtfsCounter, 3229 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3229 SdHoareTripleChecker+Valid, 3398 SdHoareTripleChecker+Invalid, 2986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:20,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3229 Valid, 3398 Invalid, 2986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:48:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2024-10-14 03:48:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 2632. [2024-10-14 03:48:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 2626 states have (on average 1.3111195734958112) internal successors, (3443), 2631 states have internal predecessors, (3443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 3443 transitions. [2024-10-14 03:48:21,049 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 3443 transitions. Word has length 53 [2024-10-14 03:48:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:21,050 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 3443 transitions. [2024-10-14 03:48:21,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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-10-14 03:48:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3443 transitions. [2024-10-14 03:48:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:48:21,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:21,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:21,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:48:21,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:21,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash -603870735, now seen corresponding path program 1 times [2024-10-14 03:48:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:21,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051835068] [2024-10-14 03:48:21,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:21,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:21,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:21,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:21,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051835068] [2024-10-14 03:48:21,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051835068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:21,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:21,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:48:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128616078] [2024-10-14 03:48:21,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:21,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:48:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:21,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:48:21,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:48:21,314 INFO L87 Difference]: Start difference. First operand 2632 states and 3443 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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-10-14 03:48:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:22,379 INFO L93 Difference]: Finished difference Result 3761 states and 4977 transitions. [2024-10-14 03:48:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:48:22,379 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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-10-14 03:48:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:22,389 INFO L225 Difference]: With dead ends: 3761 [2024-10-14 03:48:22,389 INFO L226 Difference]: Without dead ends: 3755 [2024-10-14 03:48:22,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:48:22,392 INFO L432 NwaCegarLoop]: 645 mSDtfsCounter, 4096 mSDsluCounter, 2044 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4096 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:22,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4096 Valid, 2689 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:48:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2024-10-14 03:48:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 2632. [2024-10-14 03:48:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 2626 states have (on average 1.3107387661843108) internal successors, (3442), 2631 states have internal predecessors, (3442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 3442 transitions. [2024-10-14 03:48:22,455 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 3442 transitions. Word has length 53 [2024-10-14 03:48:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:22,456 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 3442 transitions. [2024-10-14 03:48:22,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 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-10-14 03:48:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3442 transitions. [2024-10-14 03:48:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:48:22,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:22,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:22,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:48:22,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:22,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1273862225, now seen corresponding path program 1 times [2024-10-14 03:48:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:22,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228652713] [2024-10-14 03:48:22,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:22,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:22,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:22,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228652713] [2024-10-14 03:48:22,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228652713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:22,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:22,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:48:22,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756863692] [2024-10-14 03:48:22,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:22,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:48:22,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:22,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:48:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:22,790 INFO L87 Difference]: Start difference. First operand 2632 states and 3442 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 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-10-14 03:48:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:23,573 INFO L93 Difference]: Finished difference Result 3899 states and 5217 transitions. [2024-10-14 03:48:23,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:48:23,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 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-10-14 03:48:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:23,583 INFO L225 Difference]: With dead ends: 3899 [2024-10-14 03:48:23,583 INFO L226 Difference]: Without dead ends: 3215 [2024-10-14 03:48:23,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:48:23,586 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 3840 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3840 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:23,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3840 Valid, 1902 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:48:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2024-10-14 03:48:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 2632. [2024-10-14 03:48:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2632 states, 2626 states have (on average 1.3103579588728103) internal successors, (3441), 2631 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 3441 transitions. [2024-10-14 03:48:23,637 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 3441 transitions. Word has length 53 [2024-10-14 03:48:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:23,637 INFO L471 AbstractCegarLoop]: Abstraction has 2632 states and 3441 transitions. [2024-10-14 03:48:23,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 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-10-14 03:48:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 3441 transitions. [2024-10-14 03:48:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 03:48:23,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:23,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:23,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:48:23,640 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:23,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:23,640 INFO L85 PathProgramCache]: Analyzing trace with hash -843774436, now seen corresponding path program 1 times [2024-10-14 03:48:23,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:23,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232497309] [2024-10-14 03:48:23,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:23,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:23,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:23,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:23,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232497309] [2024-10-14 03:48:23,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232497309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:23,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:23,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:23,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514669096] [2024-10-14 03:48:23,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:23,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:23,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:23,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:23,704 INFO L87 Difference]: Start difference. First operand 2632 states and 3441 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:23,807 INFO L93 Difference]: Finished difference Result 3808 states and 5162 transitions. [2024-10-14 03:48:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:23,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-14 03:48:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:23,815 INFO L225 Difference]: With dead ends: 3808 [2024-10-14 03:48:23,815 INFO L226 Difference]: Without dead ends: 2397 [2024-10-14 03:48:23,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:23,817 INFO L432 NwaCegarLoop]: 995 mSDtfsCounter, 632 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:23,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1364 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:48:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2024-10-14 03:48:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2395. [2024-10-14 03:48:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2389 states have (on average 1.3114273754709083) internal successors, (3133), 2394 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3133 transitions. [2024-10-14 03:48:23,857 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3133 transitions. Word has length 54 [2024-10-14 03:48:23,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:23,858 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 3133 transitions. [2024-10-14 03:48:23,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3133 transitions. [2024-10-14 03:48:23,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 03:48:23,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:23,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:23,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:48:23,861 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-10-14 03:48:23,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash 586810076, now seen corresponding path program 1 times [2024-10-14 03:48:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:23,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147060191] [2024-10-14 03:48:23,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:23,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:23,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147060191] [2024-10-14 03:48:23,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147060191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:23,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:23,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:23,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547473945] [2024-10-14 03:48:23,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:23,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:23,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:23,940 INFO L87 Difference]: Start difference. First operand 2395 states and 3133 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:24,001 INFO L93 Difference]: Finished difference Result 4033 states and 5592 transitions. [2024-10-14 03:48:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:24,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-14 03:48:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:24,008 INFO L225 Difference]: With dead ends: 4033 [2024-10-14 03:48:24,008 INFO L226 Difference]: Without dead ends: 2928 [2024-10-14 03:48:24,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:24,010 INFO L432 NwaCegarLoop]: 961 mSDtfsCounter, 490 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:24,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1445 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2024-10-14 03:48:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2926. [2024-10-14 03:48:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2920 states have (on average 1.3544520547945205) internal successors, (3955), 2925 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 3955 transitions. [2024-10-14 03:48:24,050 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 3955 transitions. Word has length 54 [2024-10-14 03:48:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:24,051 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 3955 transitions. [2024-10-14 03:48:24,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 3955 transitions. [2024-10-14 03:48:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 03:48:24,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:24,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:24,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:48:24,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:24,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash -117726025, now seen corresponding path program 1 times [2024-10-14 03:48:24,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:24,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249052677] [2024-10-14 03:48:24,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:24,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:24,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:24,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249052677] [2024-10-14 03:48:24,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249052677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:24,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:24,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:24,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261718072] [2024-10-14 03:48:24,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:24,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:24,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:24,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:24,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:24,112 INFO L87 Difference]: Start difference. First operand 2926 states and 3955 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:24,163 INFO L93 Difference]: Finished difference Result 5824 states and 8242 transitions. [2024-10-14 03:48:24,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:24,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-14 03:48:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:24,174 INFO L225 Difference]: With dead ends: 5824 [2024-10-14 03:48:24,177 INFO L226 Difference]: Without dead ends: 4033 [2024-10-14 03:48:24,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:24,181 INFO L432 NwaCegarLoop]: 960 mSDtfsCounter, 448 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:24,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1478 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4033 states. [2024-10-14 03:48:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4033 to 4031. [2024-10-14 03:48:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4031 states, 4025 states have (on average 1.3788819875776397) internal successors, (5550), 4030 states have internal predecessors, (5550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5550 transitions. [2024-10-14 03:48:24,235 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5550 transitions. Word has length 54 [2024-10-14 03:48:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:24,236 INFO L471 AbstractCegarLoop]: Abstraction has 4031 states and 5550 transitions. [2024-10-14 03:48:24,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5550 transitions. [2024-10-14 03:48:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 03:48:24,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:24,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:24,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:48:24,238 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:24,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:24,242 INFO L85 PathProgramCache]: Analyzing trace with hash -812769836, now seen corresponding path program 1 times [2024-10-14 03:48:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:24,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548961379] [2024-10-14 03:48:24,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:24,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:24,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548961379] [2024-10-14 03:48:24,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548961379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:24,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:24,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:24,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854279911] [2024-10-14 03:48:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:24,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:24,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:24,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:24,298 INFO L87 Difference]: Start difference. First operand 4031 states and 5550 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:24,400 INFO L93 Difference]: Finished difference Result 8004 states and 11198 transitions. [2024-10-14 03:48:24,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:24,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-14 03:48:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:24,412 INFO L225 Difference]: With dead ends: 8004 [2024-10-14 03:48:24,412 INFO L226 Difference]: Without dead ends: 4543 [2024-10-14 03:48:24,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:24,416 INFO L432 NwaCegarLoop]: 702 mSDtfsCounter, 693 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:24,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1007 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:48:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2024-10-14 03:48:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 3632. [2024-10-14 03:48:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3632 states, 3627 states have (on average 1.393162393162393) internal successors, (5053), 3631 states have internal predecessors, (5053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3632 states to 3632 states and 5053 transitions. [2024-10-14 03:48:24,508 INFO L78 Accepts]: Start accepts. Automaton has 3632 states and 5053 transitions. Word has length 55 [2024-10-14 03:48:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:24,508 INFO L471 AbstractCegarLoop]: Abstraction has 3632 states and 5053 transitions. [2024-10-14 03:48:24,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3632 states and 5053 transitions. [2024-10-14 03:48:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 03:48:24,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:24,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:24,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:48:24,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:24,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash 930333266, now seen corresponding path program 1 times [2024-10-14 03:48:24,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:24,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113460645] [2024-10-14 03:48:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:25,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:25,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113460645] [2024-10-14 03:48:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113460645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:25,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:25,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:48:25,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269824743] [2024-10-14 03:48:25,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:25,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:48:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:48:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:48:25,006 INFO L87 Difference]: Start difference. First operand 3632 states and 5053 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:25,486 INFO L93 Difference]: Finished difference Result 5947 states and 8327 transitions. [2024-10-14 03:48:25,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:48:25,489 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-14 03:48:25,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:25,497 INFO L225 Difference]: With dead ends: 5947 [2024-10-14 03:48:25,498 INFO L226 Difference]: Without dead ends: 5846 [2024-10-14 03:48:25,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:48:25,500 INFO L432 NwaCegarLoop]: 601 mSDtfsCounter, 2958 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2958 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:25,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2958 Valid, 2361 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:48:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5846 states. [2024-10-14 03:48:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5846 to 3582. [2024-10-14 03:48:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 3579 states have (on average 1.3948030176026822) internal successors, (4992), 3581 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 4992 transitions. [2024-10-14 03:48:25,569 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 4992 transitions. Word has length 55 [2024-10-14 03:48:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:25,569 INFO L471 AbstractCegarLoop]: Abstraction has 3582 states and 4992 transitions. [2024-10-14 03:48:25,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 4992 transitions. [2024-10-14 03:48:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 03:48:25,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:25,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:25,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:48:25,571 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-10-14 03:48:25,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1102645022, now seen corresponding path program 1 times [2024-10-14 03:48:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:25,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529724845] [2024-10-14 03:48:25,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:25,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529724845] [2024-10-14 03:48:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529724845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:25,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:25,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:25,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016818189] [2024-10-14 03:48:25,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:25,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:25,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:25,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:25,626 INFO L87 Difference]: Start difference. First operand 3582 states and 4992 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:25,681 INFO L93 Difference]: Finished difference Result 7231 states and 10248 transitions. [2024-10-14 03:48:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:25,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-14 03:48:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:25,687 INFO L225 Difference]: With dead ends: 7231 [2024-10-14 03:48:25,687 INFO L226 Difference]: Without dead ends: 4050 [2024-10-14 03:48:25,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:25,691 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 486 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:25,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 694 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2024-10-14 03:48:25,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 3271. [2024-10-14 03:48:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3271 states, 3269 states have (on average 1.405016824717039) internal successors, (4593), 3270 states have internal predecessors, (4593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4593 transitions. [2024-10-14 03:48:25,727 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4593 transitions. Word has length 55 [2024-10-14 03:48:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:25,728 INFO L471 AbstractCegarLoop]: Abstraction has 3271 states and 4593 transitions. [2024-10-14 03:48:25,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4593 transitions. [2024-10-14 03:48:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:48:25,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:25,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:25,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:48:25,729 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-10-14 03:48:25,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:25,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1266882465, now seen corresponding path program 1 times [2024-10-14 03:48:25,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:25,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334686190] [2024-10-14 03:48:25,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:25,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:26,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:26,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334686190] [2024-10-14 03:48:26,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334686190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:26,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:26,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-14 03:48:26,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433516257] [2024-10-14 03:48:26,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:26,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 03:48:26,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:26,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 03:48:26,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:48:26,584 INFO L87 Difference]: Start difference. First operand 3271 states and 4593 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 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-10-14 03:48:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:27,857 INFO L93 Difference]: Finished difference Result 5537 states and 7765 transitions. [2024-10-14 03:48:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 03:48:27,857 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 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-10-14 03:48:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:27,864 INFO L225 Difference]: With dead ends: 5537 [2024-10-14 03:48:27,864 INFO L226 Difference]: Without dead ends: 5533 [2024-10-14 03:48:27,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 03:48:27,866 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 3886 mSDsluCounter, 4374 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3886 SdHoareTripleChecker+Valid, 4881 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:27,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3886 Valid, 4881 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:48:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2024-10-14 03:48:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 3284. [2024-10-14 03:48:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3284 states, 3282 states have (on average 1.4049360146252285) internal successors, (4611), 3283 states have internal predecessors, (4611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 4611 transitions. [2024-10-14 03:48:27,910 INFO L78 Accepts]: Start accepts. Automaton has 3284 states and 4611 transitions. Word has length 56 [2024-10-14 03:48:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:27,910 INFO L471 AbstractCegarLoop]: Abstraction has 3284 states and 4611 transitions. [2024-10-14 03:48:27,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 18 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-10-14 03:48:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 4611 transitions. [2024-10-14 03:48:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 03:48:27,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:27,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:27,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:48:27,915 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-10-14 03:48:27,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:27,915 INFO L85 PathProgramCache]: Analyzing trace with hash 923154397, now seen corresponding path program 1 times [2024-10-14 03:48:27,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:27,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475920484] [2024-10-14 03:48:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:27,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475920484] [2024-10-14 03:48:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475920484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:28,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:28,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:48:28,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055127229] [2024-10-14 03:48:28,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:28,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:48:28,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:28,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:48:28,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:48:28,332 INFO L87 Difference]: Start difference. First operand 3284 states and 4611 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 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-10-14 03:48:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:28,901 INFO L93 Difference]: Finished difference Result 5293 states and 7414 transitions. [2024-10-14 03:48:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:48:28,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 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-10-14 03:48:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:28,908 INFO L225 Difference]: With dead ends: 5293 [2024-10-14 03:48:28,909 INFO L226 Difference]: Without dead ends: 5208 [2024-10-14 03:48:28,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:48:28,911 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 3161 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3161 SdHoareTripleChecker+Valid, 2599 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:28,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3161 Valid, 2599 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:48:28,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5208 states. [2024-10-14 03:48:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5208 to 3242. [2024-10-14 03:48:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3242 states, 3241 states have (on average 1.4057389694538722) internal successors, (4556), 3241 states have internal predecessors, (4556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3242 states to 3242 states and 4556 transitions. [2024-10-14 03:48:28,972 INFO L78 Accepts]: Start accepts. Automaton has 3242 states and 4556 transitions. Word has length 57 [2024-10-14 03:48:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:28,973 INFO L471 AbstractCegarLoop]: Abstraction has 3242 states and 4556 transitions. [2024-10-14 03:48:28,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 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-10-14 03:48:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 4556 transitions. [2024-10-14 03:48:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 03:48:28,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:28,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:28,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:48:28,975 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:28,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash -244476177, now seen corresponding path program 1 times [2024-10-14 03:48:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:28,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820411867] [2024-10-14 03:48:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:29,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:29,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820411867] [2024-10-14 03:48:29,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820411867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:29,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:29,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:48:29,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813904299] [2024-10-14 03:48:29,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:29,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:48:29,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:29,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:48:29,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:48:29,060 INFO L87 Difference]: Start difference. First operand 3242 states and 4556 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:29,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:29,140 INFO L93 Difference]: Finished difference Result 10326 states and 14820 transitions. [2024-10-14 03:48:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:48:29,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-14 03:48:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:29,152 INFO L225 Difference]: With dead ends: 10326 [2024-10-14 03:48:29,152 INFO L226 Difference]: Without dead ends: 7572 [2024-10-14 03:48:29,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:29,158 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1461 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:29,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 906 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7572 states. [2024-10-14 03:48:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7572 to 5700. [2024-10-14 03:48:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5700 states, 5699 states have (on average 1.4034041059835058) internal successors, (7998), 5699 states have internal predecessors, (7998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 7998 transitions. [2024-10-14 03:48:29,231 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 7998 transitions. Word has length 60 [2024-10-14 03:48:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:29,231 INFO L471 AbstractCegarLoop]: Abstraction has 5700 states and 7998 transitions. [2024-10-14 03:48:29,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 7998 transitions. [2024-10-14 03:48:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 03:48:29,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:29,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:29,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:48:29,233 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-10-14 03:48:29,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:29,234 INFO L85 PathProgramCache]: Analyzing trace with hash 746149632, now seen corresponding path program 1 times [2024-10-14 03:48:29,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:29,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646066411] [2024-10-14 03:48:29,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:29,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:29,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:29,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646066411] [2024-10-14 03:48:29,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646066411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:29,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:29,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:48:29,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926041086] [2024-10-14 03:48:29,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:29,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:48:29,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:29,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:48:29,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:48:29,325 INFO L87 Difference]: Start difference. First operand 5700 states and 7998 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:29,397 INFO L93 Difference]: Finished difference Result 8996 states and 12665 transitions. [2024-10-14 03:48:29,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:48:29,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-14 03:48:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:29,403 INFO L225 Difference]: With dead ends: 8996 [2024-10-14 03:48:29,403 INFO L226 Difference]: Without dead ends: 3742 [2024-10-14 03:48:29,407 INFO L431 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-10-14 03:48:29,408 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 1257 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:29,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 688 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:48:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2024-10-14 03:48:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3738. [2024-10-14 03:48:29,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3738 states, 3737 states have (on average 1.3791811613593792) internal successors, (5154), 3737 states have internal predecessors, (5154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 5154 transitions. [2024-10-14 03:48:29,446 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 5154 transitions. Word has length 61 [2024-10-14 03:48:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:29,446 INFO L471 AbstractCegarLoop]: Abstraction has 3738 states and 5154 transitions. [2024-10-14 03:48:29,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 5154 transitions. [2024-10-14 03:48:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:48:29,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:29,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:29,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:48:29,448 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-10-14 03:48:29,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:29,449 INFO L85 PathProgramCache]: Analyzing trace with hash 941768707, now seen corresponding path program 1 times [2024-10-14 03:48:29,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:29,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834985208] [2024-10-14 03:48:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:29,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:29,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:29,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834985208] [2024-10-14 03:48:29,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834985208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:29,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:29,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:29,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390277860] [2024-10-14 03:48:29,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:29,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:29,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:29,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:29,549 INFO L87 Difference]: Start difference. First operand 3738 states and 5154 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:29,620 INFO L93 Difference]: Finished difference Result 10008 states and 13976 transitions. [2024-10-14 03:48:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:29,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 03:48:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:29,630 INFO L225 Difference]: With dead ends: 10008 [2024-10-14 03:48:29,630 INFO L226 Difference]: Without dead ends: 6716 [2024-10-14 03:48:29,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:29,635 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 210 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:29,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 741 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:48:29,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6716 states. [2024-10-14 03:48:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6716 to 6298. [2024-10-14 03:48:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6298 states, 6297 states have (on average 1.3800222328092742) internal successors, (8690), 6297 states have internal predecessors, (8690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6298 states to 6298 states and 8690 transitions. [2024-10-14 03:48:29,703 INFO L78 Accepts]: Start accepts. Automaton has 6298 states and 8690 transitions. Word has length 65 [2024-10-14 03:48:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:29,704 INFO L471 AbstractCegarLoop]: Abstraction has 6298 states and 8690 transitions. [2024-10-14 03:48:29,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6298 states and 8690 transitions. [2024-10-14 03:48:29,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 03:48:29,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:29,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:29,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:48:29,706 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-10-14 03:48:29,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:29,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1653754652, now seen corresponding path program 1 times [2024-10-14 03:48:29,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:29,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778328301] [2024-10-14 03:48:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:29,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:29,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:29,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778328301] [2024-10-14 03:48:29,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778328301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:29,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:29,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:48:29,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822820774] [2024-10-14 03:48:29,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:29,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:48:29,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:29,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:48:29,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:48:29,937 INFO L87 Difference]: Start difference. First operand 6298 states and 8690 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:30,006 INFO L93 Difference]: Finished difference Result 6744 states and 9283 transitions. [2024-10-14 03:48:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:48:30,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-14 03:48:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:30,017 INFO L225 Difference]: With dead ends: 6744 [2024-10-14 03:48:30,017 INFO L226 Difference]: Without dead ends: 6742 [2024-10-14 03:48:30,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:48:30,021 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 0 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:30,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2155 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:48:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2024-10-14 03:48:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6742. [2024-10-14 03:48:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6742 states, 6741 states have (on average 1.3549918409731494) internal successors, (9134), 6741 states have internal predecessors, (9134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6742 states to 6742 states and 9134 transitions. [2024-10-14 03:48:30,097 INFO L78 Accepts]: Start accepts. Automaton has 6742 states and 9134 transitions. Word has length 68 [2024-10-14 03:48:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:30,098 INFO L471 AbstractCegarLoop]: Abstraction has 6742 states and 9134 transitions. [2024-10-14 03:48:30,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6742 states and 9134 transitions. [2024-10-14 03:48:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:48:30,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:30,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:30,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:48:30,100 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-10-14 03:48:30,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:30,100 INFO L85 PathProgramCache]: Analyzing trace with hash -102334901, now seen corresponding path program 1 times [2024-10-14 03:48:30,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:30,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033473121] [2024-10-14 03:48:30,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:30,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:30,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033473121] [2024-10-14 03:48:30,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033473121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:30,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:30,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433371002] [2024-10-14 03:48:30,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:30,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:30,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:30,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:30,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:30,176 INFO L87 Difference]: Start difference. First operand 6742 states and 9134 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-10-14 03:48:30,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:30,276 INFO L93 Difference]: Finished difference Result 18115 states and 24669 transitions. [2024-10-14 03:48:30,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:30,276 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-10-14 03:48:30,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:30,292 INFO L225 Difference]: With dead ends: 18115 [2024-10-14 03:48:30,292 INFO L226 Difference]: Without dead ends: 11819 [2024-10-14 03:48:30,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:30,298 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 242 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:30,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 670 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:30,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11819 states. [2024-10-14 03:48:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11819 to 11817. [2024-10-14 03:48:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11817 states, 11816 states have (on average 1.3435172647257956) internal successors, (15875), 11816 states have internal predecessors, (15875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11817 states to 11817 states and 15875 transitions. [2024-10-14 03:48:30,417 INFO L78 Accepts]: Start accepts. Automaton has 11817 states and 15875 transitions. Word has length 69 [2024-10-14 03:48:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:30,417 INFO L471 AbstractCegarLoop]: Abstraction has 11817 states and 15875 transitions. [2024-10-14 03:48:30,417 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-10-14 03:48:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 11817 states and 15875 transitions. [2024-10-14 03:48:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 03:48:30,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:30,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:30,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:48:30,420 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-10-14 03:48:30,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:30,421 INFO L85 PathProgramCache]: Analyzing trace with hash 174156861, now seen corresponding path program 1 times [2024-10-14 03:48:30,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:30,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693133742] [2024-10-14 03:48:30,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:30,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:30,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693133742] [2024-10-14 03:48:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693133742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:30,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:30,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:48:30,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227180755] [2024-10-14 03:48:30,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:30,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:48:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:30,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:48:30,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:48:30,516 INFO L87 Difference]: Start difference. First operand 11817 states and 15875 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:30,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:30,611 INFO L93 Difference]: Finished difference Result 20711 states and 27959 transitions. [2024-10-14 03:48:30,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:48:30,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-14 03:48:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:30,635 INFO L225 Difference]: With dead ends: 20711 [2024-10-14 03:48:30,635 INFO L226 Difference]: Without dead ends: 17027 [2024-10-14 03:48:30,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:30,643 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 963 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:30,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 1077 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:30,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17027 states. [2024-10-14 03:48:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17027 to 14795. [2024-10-14 03:48:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14795 states, 14794 states have (on average 1.3406110585372448) internal successors, (19833), 14794 states have internal predecessors, (19833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14795 states to 14795 states and 19833 transitions. [2024-10-14 03:48:30,870 INFO L78 Accepts]: Start accepts. Automaton has 14795 states and 19833 transitions. Word has length 70 [2024-10-14 03:48:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:30,870 INFO L471 AbstractCegarLoop]: Abstraction has 14795 states and 19833 transitions. [2024-10-14 03:48:30,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 14795 states and 19833 transitions. [2024-10-14 03:48:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 03:48:30,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:30,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:30,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:48:30,873 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-10-14 03:48:30,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:30,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1474051796, now seen corresponding path program 1 times [2024-10-14 03:48:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:30,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329451369] [2024-10-14 03:48:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:30,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:30,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329451369] [2024-10-14 03:48:30,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329451369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:30,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:30,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:30,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339406788] [2024-10-14 03:48:30,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:30,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:30,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:30,936 INFO L87 Difference]: Start difference. First operand 14795 states and 19833 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-10-14 03:48:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:31,004 INFO L93 Difference]: Finished difference Result 17847 states and 23871 transitions. [2024-10-14 03:48:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:31,004 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-10-14 03:48:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:31,022 INFO L225 Difference]: With dead ends: 17847 [2024-10-14 03:48:31,022 INFO L226 Difference]: Without dead ends: 11749 [2024-10-14 03:48:31,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:31,032 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 169 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:31,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 805 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11749 states. [2024-10-14 03:48:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11749 to 11679. [2024-10-14 03:48:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11679 states, 11678 states have (on average 1.317091967802706) internal successors, (15381), 11678 states have internal predecessors, (15381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11679 states to 11679 states and 15381 transitions. [2024-10-14 03:48:31,146 INFO L78 Accepts]: Start accepts. Automaton has 11679 states and 15381 transitions. Word has length 72 [2024-10-14 03:48:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:31,147 INFO L471 AbstractCegarLoop]: Abstraction has 11679 states and 15381 transitions. [2024-10-14 03:48:31,147 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-10-14 03:48:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 11679 states and 15381 transitions. [2024-10-14 03:48:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 03:48:31,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:31,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:31,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:48:31,149 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-10-14 03:48:31,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:31,150 INFO L85 PathProgramCache]: Analyzing trace with hash 445370589, now seen corresponding path program 1 times [2024-10-14 03:48:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:31,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673938283] [2024-10-14 03:48:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:31,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673938283] [2024-10-14 03:48:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673938283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:31,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:31,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:48:31,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877194600] [2024-10-14 03:48:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:31,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:48:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:31,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:48:31,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:31,255 INFO L87 Difference]: Start difference. First operand 11679 states and 15381 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 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-10-14 03:48:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:31,645 INFO L93 Difference]: Finished difference Result 27447 states and 36323 transitions. [2024-10-14 03:48:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:48:31,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 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-10-14 03:48:31,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:31,677 INFO L225 Difference]: With dead ends: 27447 [2024-10-14 03:48:31,677 INFO L226 Difference]: Without dead ends: 21221 [2024-10-14 03:48:31,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:48:31,689 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 2089 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2089 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:31,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2089 Valid, 641 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:48:31,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21221 states. [2024-10-14 03:48:31,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21221 to 13539. [2024-10-14 03:48:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13539 states, 13538 states have (on average 1.3070616043728764) internal successors, (17695), 13538 states have internal predecessors, (17695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:31,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13539 states to 13539 states and 17695 transitions. [2024-10-14 03:48:31,908 INFO L78 Accepts]: Start accepts. Automaton has 13539 states and 17695 transitions. Word has length 73 [2024-10-14 03:48:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:31,909 INFO L471 AbstractCegarLoop]: Abstraction has 13539 states and 17695 transitions. [2024-10-14 03:48:31,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 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-10-14 03:48:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 13539 states and 17695 transitions. [2024-10-14 03:48:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:48:31,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:31,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:31,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:48:31,912 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-10-14 03:48:31,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1386403267, now seen corresponding path program 1 times [2024-10-14 03:48:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:31,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912449978] [2024-10-14 03:48:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:31,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:32,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:32,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912449978] [2024-10-14 03:48:32,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912449978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:32,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:32,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:48:32,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156694436] [2024-10-14 03:48:32,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:32,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:48:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:48:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:48:32,005 INFO L87 Difference]: Start difference. First operand 13539 states and 17695 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:32,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:32,103 INFO L93 Difference]: Finished difference Result 20047 states and 26393 transitions. [2024-10-14 03:48:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:48:32,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-14 03:48:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:32,126 INFO L225 Difference]: With dead ends: 20047 [2024-10-14 03:48:32,126 INFO L226 Difference]: Without dead ends: 17433 [2024-10-14 03:48:32,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:32,134 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 869 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:32,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1137 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17433 states. [2024-10-14 03:48:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17433 to 16103. [2024-10-14 03:48:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16103 states, 16102 states have (on average 1.3090920382561173) internal successors, (21079), 16102 states have internal predecessors, (21079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16103 states to 16103 states and 21079 transitions. [2024-10-14 03:48:32,297 INFO L78 Accepts]: Start accepts. Automaton has 16103 states and 21079 transitions. Word has length 74 [2024-10-14 03:48:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:32,297 INFO L471 AbstractCegarLoop]: Abstraction has 16103 states and 21079 transitions. [2024-10-14 03:48:32,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 16103 states and 21079 transitions. [2024-10-14 03:48:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:48:32,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:32,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:32,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:48:32,301 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-10-14 03:48:32,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash -591265409, now seen corresponding path program 1 times [2024-10-14 03:48:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:32,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140693908] [2024-10-14 03:48:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:32,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:32,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:32,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140693908] [2024-10-14 03:48:32,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140693908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:32,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:32,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:48:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345612462] [2024-10-14 03:48:32,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:32,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:48:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:32,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:48:32,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:48:32,444 INFO L87 Difference]: Start difference. First operand 16103 states and 21079 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:32,552 INFO L93 Difference]: Finished difference Result 25087 states and 33061 transitions. [2024-10-14 03:48:32,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:48:32,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-14 03:48:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:32,575 INFO L225 Difference]: With dead ends: 25087 [2024-10-14 03:48:32,576 INFO L226 Difference]: Without dead ends: 20897 [2024-10-14 03:48:32,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:32,586 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 878 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:32,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1179 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:48:32,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20897 states. [2024-10-14 03:48:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20897 to 19567. [2024-10-14 03:48:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19567 states, 19566 states have (on average 1.3091587447613207) internal successors, (25615), 19566 states have internal predecessors, (25615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19567 states to 19567 states and 25615 transitions. [2024-10-14 03:48:32,795 INFO L78 Accepts]: Start accepts. Automaton has 19567 states and 25615 transitions. Word has length 76 [2024-10-14 03:48:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:32,795 INFO L471 AbstractCegarLoop]: Abstraction has 19567 states and 25615 transitions. [2024-10-14 03:48:32,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 19567 states and 25615 transitions. [2024-10-14 03:48:32,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:48:32,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:32,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:32,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:48:32,799 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-10-14 03:48:32,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1074793874, now seen corresponding path program 1 times [2024-10-14 03:48:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866004926] [2024-10-14 03:48:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:32,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:32,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:32,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866004926] [2024-10-14 03:48:32,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866004926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:32,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:32,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:48:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201994703] [2024-10-14 03:48:32,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:32,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:48:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:32,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:48:32,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:48:32,952 INFO L87 Difference]: Start difference. First operand 19567 states and 25615 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:33,051 INFO L93 Difference]: Finished difference Result 26401 states and 34616 transitions. [2024-10-14 03:48:33,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:48:33,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-14 03:48:33,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:33,075 INFO L225 Difference]: With dead ends: 26401 [2024-10-14 03:48:33,075 INFO L226 Difference]: Without dead ends: 20763 [2024-10-14 03:48:33,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:33,086 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 904 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:33,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1134 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20763 states. [2024-10-14 03:48:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20763 to 19435. [2024-10-14 03:48:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19435 states, 19434 states have (on average 1.3067304723680149) internal successors, (25395), 19434 states have internal predecessors, (25395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19435 states to 19435 states and 25395 transitions. [2024-10-14 03:48:33,331 INFO L78 Accepts]: Start accepts. Automaton has 19435 states and 25395 transitions. Word has length 81 [2024-10-14 03:48:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:33,331 INFO L471 AbstractCegarLoop]: Abstraction has 19435 states and 25395 transitions. [2024-10-14 03:48:33,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 19435 states and 25395 transitions. [2024-10-14 03:48:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:48:33,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:33,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:33,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:48:33,335 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-10-14 03:48:33,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2012326034, now seen corresponding path program 1 times [2024-10-14 03:48:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:33,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756034066] [2024-10-14 03:48:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:33,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:33,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756034066] [2024-10-14 03:48:33,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756034066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:33,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:33,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:48:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263461047] [2024-10-14 03:48:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:33,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:48:33,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:33,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:48:33,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:33,473 INFO L87 Difference]: Start difference. First operand 19435 states and 25395 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:33,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:33,821 INFO L93 Difference]: Finished difference Result 22553 states and 29359 transitions. [2024-10-14 03:48:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:48:33,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-10-14 03:48:33,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:33,845 INFO L225 Difference]: With dead ends: 22553 [2024-10-14 03:48:33,845 INFO L226 Difference]: Without dead ends: 21903 [2024-10-14 03:48:33,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:48:33,853 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 1860 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:33,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 573 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:48:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21903 states. [2024-10-14 03:48:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21903 to 19433. [2024-10-14 03:48:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19433 states, 19432 states have (on average 1.3066591189790038) internal successors, (25391), 19432 states have internal predecessors, (25391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19433 states to 19433 states and 25391 transitions. [2024-10-14 03:48:34,142 INFO L78 Accepts]: Start accepts. Automaton has 19433 states and 25391 transitions. Word has length 82 [2024-10-14 03:48:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:34,143 INFO L471 AbstractCegarLoop]: Abstraction has 19433 states and 25391 transitions. [2024-10-14 03:48:34,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 19433 states and 25391 transitions. [2024-10-14 03:48:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:48:34,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:34,150 INFO L215 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] [2024-10-14 03:48:34,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 03:48:34,150 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-10-14 03:48:34,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:34,151 INFO L85 PathProgramCache]: Analyzing trace with hash -274104917, now seen corresponding path program 1 times [2024-10-14 03:48:34,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:34,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742036599] [2024-10-14 03:48:34,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:34,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742036599] [2024-10-14 03:48:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742036599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:48:34,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153285240] [2024-10-14 03:48:34,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:34,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:48:34,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:48:34,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:48:34,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:48:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:34,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 03:48:34,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:48:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:35,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:48:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:36,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153285240] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:48:36,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:48:36,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2024-10-14 03:48:36,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756045496] [2024-10-14 03:48:36,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:48:36,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 03:48:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 03:48:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-10-14 03:48:36,061 INFO L87 Difference]: Start difference. First operand 19433 states and 25391 transitions. Second operand has 20 states, 20 states have (on average 11.15) internal successors, (223), 19 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:36,978 INFO L93 Difference]: Finished difference Result 45629 states and 59672 transitions. [2024-10-14 03:48:36,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:48:36,979 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.15) internal successors, (223), 19 states have internal predecessors, (223), 0 states have call successors, (0), 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 90 [2024-10-14 03:48:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:37,017 INFO L225 Difference]: With dead ends: 45629 [2024-10-14 03:48:37,017 INFO L226 Difference]: Without dead ends: 32487 [2024-10-14 03:48:37,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 03:48:37,032 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 4163 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4163 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:37,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4163 Valid, 1606 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:48:37,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32487 states. [2024-10-14 03:48:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32487 to 19985. [2024-10-14 03:48:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19985 states, 19984 states have (on average 1.3047938350680544) internal successors, (26075), 19984 states have internal predecessors, (26075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19985 states to 19985 states and 26075 transitions. [2024-10-14 03:48:37,327 INFO L78 Accepts]: Start accepts. Automaton has 19985 states and 26075 transitions. Word has length 90 [2024-10-14 03:48:37,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:37,327 INFO L471 AbstractCegarLoop]: Abstraction has 19985 states and 26075 transitions. [2024-10-14 03:48:37,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.15) internal successors, (223), 19 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 19985 states and 26075 transitions. [2024-10-14 03:48:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:48:37,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:37,333 INFO L215 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] [2024-10-14 03:48:37,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:48:37,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-14 03:48:37,534 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-10-14 03:48:37,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:37,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1929351263, now seen corresponding path program 1 times [2024-10-14 03:48:37,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:37,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126240127] [2024-10-14 03:48:37,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:37,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:48:37,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:37,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126240127] [2024-10-14 03:48:37,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126240127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:37,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:37,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:48:37,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367852560] [2024-10-14 03:48:37,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:37,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:48:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:48:37,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:48:37,758 INFO L87 Difference]: Start difference. First operand 19985 states and 26075 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:38,195 INFO L93 Difference]: Finished difference Result 29721 states and 38745 transitions. [2024-10-14 03:48:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:48:38,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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 90 [2024-10-14 03:48:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:38,228 INFO L225 Difference]: With dead ends: 29721 [2024-10-14 03:48:38,228 INFO L226 Difference]: Without dead ends: 26237 [2024-10-14 03:48:38,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:48:38,239 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 1588 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:38,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 819 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:48:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26237 states. [2024-10-14 03:48:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26237 to 19455. [2024-10-14 03:48:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19455 states, 19454 states have (on average 1.3050272437544979) internal successors, (25388), 19454 states have internal predecessors, (25388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19455 states to 19455 states and 25388 transitions. [2024-10-14 03:48:38,567 INFO L78 Accepts]: Start accepts. Automaton has 19455 states and 25388 transitions. Word has length 90 [2024-10-14 03:48:38,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:38,567 INFO L471 AbstractCegarLoop]: Abstraction has 19455 states and 25388 transitions. [2024-10-14 03:48:38,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 19455 states and 25388 transitions. [2024-10-14 03:48:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 03:48:38,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:38,574 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:38,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 03:48:38,574 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-10-14 03:48:38,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash 666075318, now seen corresponding path program 1 times [2024-10-14 03:48:38,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:38,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529340868] [2024-10-14 03:48:38,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:38,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:38,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:38,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529340868] [2024-10-14 03:48:38,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529340868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:38,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:38,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:38,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428049685] [2024-10-14 03:48:38,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:38,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:38,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:38,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:38,681 INFO L87 Difference]: Start difference. First operand 19455 states and 25388 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:38,798 INFO L93 Difference]: Finished difference Result 37931 states and 49624 transitions. [2024-10-14 03:48:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:38,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-14 03:48:38,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:38,920 INFO L225 Difference]: With dead ends: 37931 [2024-10-14 03:48:38,921 INFO L226 Difference]: Without dead ends: 19457 [2024-10-14 03:48:38,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:38,929 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 191 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:38,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 727 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19457 states. [2024-10-14 03:48:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19457 to 19455. [2024-10-14 03:48:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19455 states, 19454 states have (on average 1.2933072889894108) internal successors, (25160), 19454 states have internal predecessors, (25160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19455 states to 19455 states and 25160 transitions. [2024-10-14 03:48:39,100 INFO L78 Accepts]: Start accepts. Automaton has 19455 states and 25160 transitions. Word has length 91 [2024-10-14 03:48:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:39,100 INFO L471 AbstractCegarLoop]: Abstraction has 19455 states and 25160 transitions. [2024-10-14 03:48:39,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 19455 states and 25160 transitions. [2024-10-14 03:48:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 03:48:39,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:39,104 INFO L215 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] [2024-10-14 03:48:39,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 03:48:39,105 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-10-14 03:48:39,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:39,105 INFO L85 PathProgramCache]: Analyzing trace with hash -730540433, now seen corresponding path program 1 times [2024-10-14 03:48:39,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:39,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153643318] [2024-10-14 03:48:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:39,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:39,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:39,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153643318] [2024-10-14 03:48:39,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153643318] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:48:39,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530678393] [2024-10-14 03:48:39,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:39,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:48:39,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:48:39,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:48:39,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:48:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:39,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 03:48:39,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:48:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:40,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:48:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:40,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530678393] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:48:40,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:48:40,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2024-10-14 03:48:40,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679794684] [2024-10-14 03:48:40,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:48:40,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 03:48:40,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:40,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 03:48:40,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-14 03:48:40,599 INFO L87 Difference]: Start difference. First operand 19455 states and 25160 transitions. Second operand has 20 states, 20 states have (on average 12.8) internal successors, (256), 20 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:42,740 INFO L93 Difference]: Finished difference Result 94094 states and 120976 transitions. [2024-10-14 03:48:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-14 03:48:42,741 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 12.8) internal successors, (256), 20 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-14 03:48:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:42,830 INFO L225 Difference]: With dead ends: 94094 [2024-10-14 03:48:42,830 INFO L226 Difference]: Without dead ends: 75121 [2024-10-14 03:48:42,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=3126, Unknown=0, NotChecked=0, Total=3906 [2024-10-14 03:48:42,862 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 5442 mSDsluCounter, 2713 mSDsCounter, 0 mSdLazyCounter, 2581 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5442 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 2581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:42,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5442 Valid, 3022 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:48:42,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75121 states. [2024-10-14 03:48:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75121 to 35895. [2024-10-14 03:48:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35895 states, 35894 states have (on average 1.266924834234134) internal successors, (45475), 35894 states have internal predecessors, (45475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35895 states to 35895 states and 45475 transitions. [2024-10-14 03:48:43,471 INFO L78 Accepts]: Start accepts. Automaton has 35895 states and 45475 transitions. Word has length 91 [2024-10-14 03:48:43,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:43,472 INFO L471 AbstractCegarLoop]: Abstraction has 35895 states and 45475 transitions. [2024-10-14 03:48:43,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.8) internal successors, (256), 20 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35895 states and 45475 transitions. [2024-10-14 03:48:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 03:48:43,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:43,478 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:43,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:48:43,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:48:43,678 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-10-14 03:48:43,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:43,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2117083852, now seen corresponding path program 1 times [2024-10-14 03:48:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:43,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399842536] [2024-10-14 03:48:43,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:43,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:43,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:43,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399842536] [2024-10-14 03:48:43,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399842536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:43,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:43,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913381400] [2024-10-14 03:48:43,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:43,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:43,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:43,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:43,745 INFO L87 Difference]: Start difference. First operand 35895 states and 45475 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:43,861 INFO L93 Difference]: Finished difference Result 49278 states and 62434 transitions. [2024-10-14 03:48:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-14 03:48:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:43,885 INFO L225 Difference]: With dead ends: 49278 [2024-10-14 03:48:43,885 INFO L226 Difference]: Without dead ends: 21619 [2024-10-14 03:48:43,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:43,902 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 134 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:43,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 746 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21619 states. [2024-10-14 03:48:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21619 to 20570. [2024-10-14 03:48:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20570 states, 20569 states have (on average 1.254071661237785) internal successors, (25795), 20569 states have internal predecessors, (25795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20570 states to 20570 states and 25795 transitions. [2024-10-14 03:48:44,082 INFO L78 Accepts]: Start accepts. Automaton has 20570 states and 25795 transitions. Word has length 94 [2024-10-14 03:48:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:44,082 INFO L471 AbstractCegarLoop]: Abstraction has 20570 states and 25795 transitions. [2024-10-14 03:48:44,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 20570 states and 25795 transitions. [2024-10-14 03:48:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 03:48:44,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:44,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:44,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 03:48:44,087 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-10-14 03:48:44,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:44,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2035409100, now seen corresponding path program 1 times [2024-10-14 03:48:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:44,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839810820] [2024-10-14 03:48:44,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:44,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:44,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839810820] [2024-10-14 03:48:44,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839810820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:44,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:44,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:48:44,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068987910] [2024-10-14 03:48:44,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:44,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:48:44,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:44,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:48:44,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:48:44,166 INFO L87 Difference]: Start difference. First operand 20570 states and 25795 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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-10-14 03:48:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:44,488 INFO L93 Difference]: Finished difference Result 41608 states and 52087 transitions. [2024-10-14 03:48:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:48:44,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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-10-14 03:48:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:44,511 INFO L225 Difference]: With dead ends: 41608 [2024-10-14 03:48:44,511 INFO L226 Difference]: Without dead ends: 21493 [2024-10-14 03:48:44,518 INFO L431 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-10-14 03:48:44,519 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 778 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:44,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 581 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:48:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21493 states. [2024-10-14 03:48:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21493 to 19763. [2024-10-14 03:48:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19763 states, 19762 states have (on average 1.2299362412711263) internal successors, (24306), 19762 states have internal predecessors, (24306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19763 states to 19763 states and 24306 transitions. [2024-10-14 03:48:44,691 INFO L78 Accepts]: Start accepts. Automaton has 19763 states and 24306 transitions. Word has length 98 [2024-10-14 03:48:44,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:44,691 INFO L471 AbstractCegarLoop]: Abstraction has 19763 states and 24306 transitions. [2024-10-14 03:48:44,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 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-10-14 03:48:44,691 INFO L276 IsEmpty]: Start isEmpty. Operand 19763 states and 24306 transitions. [2024-10-14 03:48:44,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:48:44,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:44,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:44,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 03:48:44,696 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-10-14 03:48:44,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash -971348956, now seen corresponding path program 1 times [2024-10-14 03:48:44,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:44,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185503042] [2024-10-14 03:48:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:44,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:48:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185503042] [2024-10-14 03:48:44,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185503042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:44,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:44,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:44,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414718786] [2024-10-14 03:48:44,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:44,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:44,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:44,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:44,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:44,763 INFO L87 Difference]: Start difference. First operand 19763 states and 24306 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:44,828 INFO L93 Difference]: Finished difference Result 25308 states and 31096 transitions. [2024-10-14 03:48:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:44,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 03:48:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:44,845 INFO L225 Difference]: With dead ends: 25308 [2024-10-14 03:48:44,845 INFO L226 Difference]: Without dead ends: 14089 [2024-10-14 03:48:44,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:44,855 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 147 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:44,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 727 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14089 states. [2024-10-14 03:48:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14089 to 14021. [2024-10-14 03:48:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14021 states, 14020 states have (on average 1.2166191155492154) internal successors, (17057), 14020 states have internal predecessors, (17057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14021 states to 14021 states and 17057 transitions. [2024-10-14 03:48:44,977 INFO L78 Accepts]: Start accepts. Automaton has 14021 states and 17057 transitions. Word has length 100 [2024-10-14 03:48:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:44,977 INFO L471 AbstractCegarLoop]: Abstraction has 14021 states and 17057 transitions. [2024-10-14 03:48:44,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 14021 states and 17057 transitions. [2024-10-14 03:48:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 03:48:44,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:44,981 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:44,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 03:48:44,981 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-10-14 03:48:44,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:44,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1274784863, now seen corresponding path program 1 times [2024-10-14 03:48:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861707877] [2024-10-14 03:48:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:48:45,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:45,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861707877] [2024-10-14 03:48:45,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861707877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:45,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:45,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:48:45,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542232892] [2024-10-14 03:48:45,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:45,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:48:45,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:45,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:48:45,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:48:45,051 INFO L87 Difference]: Start difference. First operand 14021 states and 17057 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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-10-14 03:48:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:45,266 INFO L93 Difference]: Finished difference Result 30426 states and 36959 transitions. [2024-10-14 03:48:45,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:48:45,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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 102 [2024-10-14 03:48:45,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:45,290 INFO L225 Difference]: With dead ends: 30426 [2024-10-14 03:48:45,290 INFO L226 Difference]: Without dead ends: 23344 [2024-10-14 03:48:45,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:48:45,301 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 252 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:45,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 825 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:48:45,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23344 states. [2024-10-14 03:48:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23344 to 17635. [2024-10-14 03:48:45,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17635 states, 17634 states have (on average 1.2193489849155041) internal successors, (21502), 17634 states have internal predecessors, (21502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17635 states to 17635 states and 21502 transitions. [2024-10-14 03:48:45,553 INFO L78 Accepts]: Start accepts. Automaton has 17635 states and 21502 transitions. Word has length 102 [2024-10-14 03:48:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:45,554 INFO L471 AbstractCegarLoop]: Abstraction has 17635 states and 21502 transitions. [2024-10-14 03:48:45,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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-10-14 03:48:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 17635 states and 21502 transitions. [2024-10-14 03:48:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 03:48:45,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:45,560 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:45,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 03:48:45,560 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-10-14 03:48:45,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:45,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1968733344, now seen corresponding path program 1 times [2024-10-14 03:48:45,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:45,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016012963] [2024-10-14 03:48:45,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:45,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:48:45,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:45,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016012963] [2024-10-14 03:48:45,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016012963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:45,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058081495] [2024-10-14 03:48:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:45,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:45,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:45,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:45,709 INFO L87 Difference]: Start difference. First operand 17635 states and 21502 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:45,828 INFO L93 Difference]: Finished difference Result 39952 states and 48401 transitions. [2024-10-14 03:48:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:45,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-10-14 03:48:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:45,856 INFO L225 Difference]: With dead ends: 39952 [2024-10-14 03:48:45,856 INFO L226 Difference]: Without dead ends: 22774 [2024-10-14 03:48:45,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:45,871 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 229 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:45,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 677 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22774 states. [2024-10-14 03:48:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22774 to 19593. [2024-10-14 03:48:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19593 states, 19592 states have (on average 1.1843099224173133) internal successors, (23203), 19592 states have internal predecessors, (23203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19593 states to 19593 states and 23203 transitions. [2024-10-14 03:48:46,123 INFO L78 Accepts]: Start accepts. Automaton has 19593 states and 23203 transitions. Word has length 102 [2024-10-14 03:48:46,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:46,123 INFO L471 AbstractCegarLoop]: Abstraction has 19593 states and 23203 transitions. [2024-10-14 03:48:46,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 19593 states and 23203 transitions. [2024-10-14 03:48:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:48:46,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:46,128 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:46,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 03:48:46,128 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-10-14 03:48:46,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1708823219, now seen corresponding path program 1 times [2024-10-14 03:48:46,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:46,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632136908] [2024-10-14 03:48:46,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:46,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:46,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632136908] [2024-10-14 03:48:46,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632136908] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:48:46,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026226849] [2024-10-14 03:48:46,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:46,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:48:46,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:48:46,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:48:46,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:48:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:46,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 03:48:46,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:48:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:47,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:48:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026226849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:48:48,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:48:48,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 15] total 34 [2024-10-14 03:48:48,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338014803] [2024-10-14 03:48:48,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:48:48,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 03:48:48,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:48,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 03:48:48,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 03:48:48,296 INFO L87 Difference]: Start difference. First operand 19593 states and 23203 transitions. Second operand has 35 states, 35 states have (on average 8.114285714285714) internal successors, (284), 34 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:52,431 INFO L93 Difference]: Finished difference Result 93174 states and 110197 transitions. [2024-10-14 03:48:52,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-14 03:48:52,432 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 8.114285714285714) internal successors, (284), 34 states have internal predecessors, (284), 0 states have call successors, (0), 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-10-14 03:48:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:52,516 INFO L225 Difference]: With dead ends: 93174 [2024-10-14 03:48:52,516 INFO L226 Difference]: Without dead ends: 76789 [2024-10-14 03:48:52,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2219 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1441, Invalid=6215, Unknown=0, NotChecked=0, Total=7656 [2024-10-14 03:48:52,543 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 6629 mSDsluCounter, 6240 mSDsCounter, 0 mSdLazyCounter, 6016 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6629 SdHoareTripleChecker+Valid, 6610 SdHoareTripleChecker+Invalid, 6162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 6016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:52,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6629 Valid, 6610 Invalid, 6162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 6016 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 03:48:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76789 states. [2024-10-14 03:48:52,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76789 to 20089. [2024-10-14 03:48:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20089 states, 20088 states have (on average 1.1835921943448826) internal successors, (23776), 20088 states have internal predecessors, (23776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20089 states to 20089 states and 23776 transitions. [2024-10-14 03:48:53,000 INFO L78 Accepts]: Start accepts. Automaton has 20089 states and 23776 transitions. Word has length 105 [2024-10-14 03:48:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:53,001 INFO L471 AbstractCegarLoop]: Abstraction has 20089 states and 23776 transitions. [2024-10-14 03:48:53,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.114285714285714) internal successors, (284), 34 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 20089 states and 23776 transitions. [2024-10-14 03:48:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:48:53,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:53,006 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:53,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:48:53,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:48:53,207 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-10-14 03:48:53,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1420544791, now seen corresponding path program 1 times [2024-10-14 03:48:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:53,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227466665] [2024-10-14 03:48:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:48:53,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:53,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227466665] [2024-10-14 03:48:53,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227466665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:53,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:53,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:48:53,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378807163] [2024-10-14 03:48:53,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:53,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:48:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:53,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:48:53,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:48:53,333 INFO L87 Difference]: Start difference. First operand 20089 states and 23776 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-10-14 03:48:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:53,585 INFO L93 Difference]: Finished difference Result 39492 states and 46720 transitions. [2024-10-14 03:48:53,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:48:53,586 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 105 [2024-10-14 03:48:53,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:53,619 INFO L225 Difference]: With dead ends: 39492 [2024-10-14 03:48:53,619 INFO L226 Difference]: Without dead ends: 31252 [2024-10-14 03:48:53,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:48:53,633 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 266 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:53,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 794 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:48:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31252 states. [2024-10-14 03:48:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31252 to 24214. [2024-10-14 03:48:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24214 states, 24213 states have (on average 1.1856027753686036) internal successors, (28707), 24213 states have internal predecessors, (28707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24214 states to 24214 states and 28707 transitions. [2024-10-14 03:48:53,875 INFO L78 Accepts]: Start accepts. Automaton has 24214 states and 28707 transitions. Word has length 105 [2024-10-14 03:48:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:53,875 INFO L471 AbstractCegarLoop]: Abstraction has 24214 states and 28707 transitions. [2024-10-14 03:48:53,876 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-10-14 03:48:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 24214 states and 28707 transitions. [2024-10-14 03:48:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:48:53,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:53,880 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:53,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-14 03:48:53,880 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-10-14 03:48:53,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash 975892200, now seen corresponding path program 1 times [2024-10-14 03:48:53,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:53,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033262111] [2024-10-14 03:48:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:54,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:54,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033262111] [2024-10-14 03:48:54,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033262111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:54,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:54,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 03:48:54,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526191883] [2024-10-14 03:48:54,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:54,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:48:54,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:54,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:48:54,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:48:54,142 INFO L87 Difference]: Start difference. First operand 24214 states and 28707 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:54,760 INFO L93 Difference]: Finished difference Result 42668 states and 50700 transitions. [2024-10-14 03:48:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:48:54,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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-10-14 03:48:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:54,801 INFO L225 Difference]: With dead ends: 42668 [2024-10-14 03:48:54,801 INFO L226 Difference]: Without dead ends: 35922 [2024-10-14 03:48:54,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:48:54,816 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 1521 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:54,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1377 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:48:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35922 states. [2024-10-14 03:48:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35922 to 33949. [2024-10-14 03:48:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33949 states, 33948 states have (on average 1.1846942382467303) internal successors, (40218), 33948 states have internal predecessors, (40218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33949 states to 33949 states and 40218 transitions. [2024-10-14 03:48:55,142 INFO L78 Accepts]: Start accepts. Automaton has 33949 states and 40218 transitions. Word has length 105 [2024-10-14 03:48:55,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:55,143 INFO L471 AbstractCegarLoop]: Abstraction has 33949 states and 40218 transitions. [2024-10-14 03:48:55,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 33949 states and 40218 transitions. [2024-10-14 03:48:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 03:48:55,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:55,149 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:55,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 03:48:55,149 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-10-14 03:48:55,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1322234227, now seen corresponding path program 1 times [2024-10-14 03:48:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:55,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278679036] [2024-10-14 03:48:55,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:48:55,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278679036] [2024-10-14 03:48:55,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278679036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:55,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:55,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192293778] [2024-10-14 03:48:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:55,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:55,221 INFO L87 Difference]: Start difference. First operand 33949 states and 40218 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-10-14 03:48:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:55,477 INFO L93 Difference]: Finished difference Result 69203 states and 82345 transitions. [2024-10-14 03:48:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:55,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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 106 [2024-10-14 03:48:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:55,527 INFO L225 Difference]: With dead ends: 69203 [2024-10-14 03:48:55,527 INFO L226 Difference]: Without dead ends: 40238 [2024-10-14 03:48:55,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:55,552 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 342 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:55,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 338 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:48:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40238 states. [2024-10-14 03:48:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40238 to 33139. [2024-10-14 03:48:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33139 states, 33138 states have (on average 1.164886233327298) internal successors, (38602), 33138 states have internal predecessors, (38602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33139 states to 33139 states and 38602 transitions. [2024-10-14 03:48:56,012 INFO L78 Accepts]: Start accepts. Automaton has 33139 states and 38602 transitions. Word has length 106 [2024-10-14 03:48:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:56,013 INFO L471 AbstractCegarLoop]: Abstraction has 33139 states and 38602 transitions. [2024-10-14 03:48:56,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-10-14 03:48:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 33139 states and 38602 transitions. [2024-10-14 03:48:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 03:48:56,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:56,019 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:56,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-14 03:48:56,020 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-10-14 03:48:56,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:56,020 INFO L85 PathProgramCache]: Analyzing trace with hash -638398484, now seen corresponding path program 1 times [2024-10-14 03:48:56,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:56,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848948653] [2024-10-14 03:48:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:56,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:48:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:56,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848948653] [2024-10-14 03:48:56,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848948653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:56,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:56,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:48:56,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721724635] [2024-10-14 03:48:56,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:56,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:48:56,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:56,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:48:56,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:48:56,116 INFO L87 Difference]: Start difference. First operand 33139 states and 38602 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-10-14 03:48:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:56,389 INFO L93 Difference]: Finished difference Result 47349 states and 54952 transitions. [2024-10-14 03:48:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:48:56,389 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 106 [2024-10-14 03:48:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:56,432 INFO L225 Difference]: With dead ends: 47349 [2024-10-14 03:48:56,433 INFO L226 Difference]: Without dead ends: 41082 [2024-10-14 03:48:56,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:48:56,448 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 241 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:56,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 805 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:48:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41082 states. [2024-10-14 03:48:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41082 to 33104. [2024-10-14 03:48:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33104 states, 33103 states have (on average 1.1648188985892518) internal successors, (38559), 33103 states have internal predecessors, (38559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33104 states to 33104 states and 38559 transitions. [2024-10-14 03:48:56,776 INFO L78 Accepts]: Start accepts. Automaton has 33104 states and 38559 transitions. Word has length 106 [2024-10-14 03:48:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:56,776 INFO L471 AbstractCegarLoop]: Abstraction has 33104 states and 38559 transitions. [2024-10-14 03:48:56,776 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-10-14 03:48:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 33104 states and 38559 transitions. [2024-10-14 03:48:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 03:48:56,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:56,780 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:56,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-14 03:48:56,781 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-10-14 03:48:56,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1161719155, now seen corresponding path program 1 times [2024-10-14 03:48:56,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:56,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111167007] [2024-10-14 03:48:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:48:56,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:56,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111167007] [2024-10-14 03:48:56,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111167007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:56,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:56,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:48:56,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681775493] [2024-10-14 03:48:56,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:56,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:48:56,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:56,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:48:56,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:48:56,984 INFO L87 Difference]: Start difference. First operand 33104 states and 38559 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 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-10-14 03:48:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:57,540 INFO L93 Difference]: Finished difference Result 65682 states and 76691 transitions. [2024-10-14 03:48:57,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:48:57,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 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 106 [2024-10-14 03:48:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:57,606 INFO L225 Difference]: With dead ends: 65682 [2024-10-14 03:48:57,606 INFO L226 Difference]: Without dead ends: 59338 [2024-10-14 03:48:57,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:48:57,625 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 1395 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:57,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 1602 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:48:57,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59338 states. [2024-10-14 03:48:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59338 to 33104. [2024-10-14 03:48:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33104 states, 33103 states have (on average 1.1647886898468416) internal successors, (38558), 33103 states have internal predecessors, (38558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33104 states to 33104 states and 38558 transitions. [2024-10-14 03:48:58,247 INFO L78 Accepts]: Start accepts. Automaton has 33104 states and 38558 transitions. Word has length 106 [2024-10-14 03:48:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:58,247 INFO L471 AbstractCegarLoop]: Abstraction has 33104 states and 38558 transitions. [2024-10-14 03:48:58,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 7 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-10-14 03:48:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 33104 states and 38558 transitions. [2024-10-14 03:48:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 03:48:58,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:58,252 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:58,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-14 03:48:58,252 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:58,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash -14238468, now seen corresponding path program 1 times [2024-10-14 03:48:58,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:58,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336791292] [2024-10-14 03:48:58,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:58,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:48:58,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:58,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336791292] [2024-10-14 03:48:58,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336791292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:48:58,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:48:58,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:48:58,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961369623] [2024-10-14 03:48:58,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:48:58,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:48:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:48:58,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:48:58,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:58,350 INFO L87 Difference]: Start difference. First operand 33104 states and 38558 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-10-14 03:48:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:48:58,502 INFO L93 Difference]: Finished difference Result 71142 states and 83198 transitions. [2024-10-14 03:48:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:48:58,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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 106 [2024-10-14 03:48:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:48:58,555 INFO L225 Difference]: With dead ends: 71142 [2024-10-14 03:48:58,556 INFO L226 Difference]: Without dead ends: 47939 [2024-10-14 03:48:58,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:48:58,579 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 233 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:48:58,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 654 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:48:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47939 states. [2024-10-14 03:48:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47939 to 45641. [2024-10-14 03:48:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45641 states, 45640 states have (on average 1.1621384750219106) internal successors, (53040), 45640 states have internal predecessors, (53040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:48:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45641 states to 45641 states and 53040 transitions. [2024-10-14 03:48:58,994 INFO L78 Accepts]: Start accepts. Automaton has 45641 states and 53040 transitions. Word has length 106 [2024-10-14 03:48:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:48:58,994 INFO L471 AbstractCegarLoop]: Abstraction has 45641 states and 53040 transitions. [2024-10-14 03:48:58,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-10-14 03:48:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 45641 states and 53040 transitions. [2024-10-14 03:48:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 03:48:58,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:48:58,999 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:48:58,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-14 03:48:58,999 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-10-14 03:48:58,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:48:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash -519407908, now seen corresponding path program 1 times [2024-10-14 03:48:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:48:59,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631959362] [2024-10-14 03:48:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:59,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:48:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:48:59,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:48:59,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631959362] [2024-10-14 03:48:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631959362] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:48:59,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771158519] [2024-10-14 03:48:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:48:59,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:48:59,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:48:59,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:48:59,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:48:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:48:59,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 03:48:59,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:49:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:49:00,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:49:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:49:01,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771158519] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:49:01,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:49:01,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 14] total 37 [2024-10-14 03:49:01,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851301959] [2024-10-14 03:49:01,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:49:01,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-14 03:49:01,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:49:01,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-14 03:49:01,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 03:49:01,590 INFO L87 Difference]: Start difference. First operand 45641 states and 53040 transitions. Second operand has 37 states, 37 states have (on average 8.108108108108109) internal successors, (300), 37 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)