./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 da0a9170cb1355df936e020ec31cd269723d3c83f610103689e93f9c7ac8eb3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:36:34,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:36:34,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:36:34,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:36:34,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:36:34,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:36:34,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:36:34,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:36:34,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:36:34,476 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:36:34,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:36:34,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:36:34,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:36:34,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:36:34,477 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:36:34,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:36:34,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:36:34,477 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:36:34,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:36:34,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:36:34,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:36:34,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:36:34,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:36:34,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:36:34,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:36:34,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:36:34,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:36:34,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:36:34,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:36:34,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:36:34,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:36:34,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:36:34,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:36:34,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:36:34,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:36:34,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:36:34,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:36:34,480 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> da0a9170cb1355df936e020ec31cd269723d3c83f610103689e93f9c7ac8eb3a [2025-01-09 04:36:34,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:36:34,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:36:34,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:36:34,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:36:34,745 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:36:34,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:36:35,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b61b070a8/786e40dd99b4481db7bd1c8ae3f24d6e/FLAG2f37a1592 [2025-01-09 04:36:36,270 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:36:36,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:36:36,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b61b070a8/786e40dd99b4481db7bd1c8ae3f24d6e/FLAG2f37a1592 [2025-01-09 04:36:36,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b61b070a8/786e40dd99b4481db7bd1c8ae3f24d6e [2025-01-09 04:36:36,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:36:36,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:36:36,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:36:36,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:36:36,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:36:36,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2589fdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36, skipping insertion in model container [2025-01-09 04:36:36,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:36:36,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14146,14159] [2025-01-09 04:36:36,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14793,14806] [2025-01-09 04:36:36,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16069,16082] [2025-01-09 04:36:36,592 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17045,17058] [2025-01-09 04:36:36,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25516,25529] [2025-01-09 04:36:36,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:36:36,671 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:36:36,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14146,14159] [2025-01-09 04:36:36,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14793,14806] [2025-01-09 04:36:36,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16069,16082] [2025-01-09 04:36:36,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17045,17058] [2025-01-09 04:36:36,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25516,25529] [2025-01-09 04:36:36,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:36:36,825 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:36:36,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36 WrapperNode [2025-01-09 04:36:36,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:36:36,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:36:36,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:36:36,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:36:36,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,894 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1639 [2025-01-09 04:36:36,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:36:36,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:36:36,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:36:36,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:36:36,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,920 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]. [2025-01-09 04:36:36,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:36:36,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:36:36,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:36:36,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:36:36,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (1/1) ... [2025-01-09 04:36:36,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:36:36,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:36:36,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:36:37,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:36:37,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:36:37,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:36:37,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:36:37,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:36:37,142 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:36:37,144 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:36:38,242 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-01-09 04:36:38,242 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:36:38,254 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:36:38,255 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:36:38,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:38 BoogieIcfgContainer [2025-01-09 04:36:38,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:36:38,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:36:38,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:36:38,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:36:38,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:36:36" (1/3) ... [2025-01-09 04:36:38,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3015f6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:38, skipping insertion in model container [2025-01-09 04:36:38,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:36" (2/3) ... [2025-01-09 04:36:38,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3015f6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:38, skipping insertion in model container [2025-01-09 04:36:38,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:38" (3/3) ... [2025-01-09 04:36:38,264 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:36:38,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:36:38,275 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 388 locations, 1 initial locations, 0 loop locations, and 5 error locations. [2025-01-09 04:36:38,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:36:38,332 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;@56940a2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:36:38,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 04:36:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 388 states, 382 states have (on average 1.824607329842932) internal successors, (697), 387 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 04:36:38,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:38,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:38,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:38,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1860790591, now seen corresponding path program 1 times [2025-01-09 04:36:38,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:38,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631254517] [2025-01-09 04:36:38,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:38,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:38,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 04:36:38,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 04:36:38,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:38,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:38,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631254517] [2025-01-09 04:36:38,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631254517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:38,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:38,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:38,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342048004] [2025-01-09 04:36:38,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:38,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:38,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:38,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:38,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:38,825 INFO L87 Difference]: Start difference. First operand has 388 states, 382 states have (on average 1.824607329842932) internal successors, (697), 387 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:38,994 INFO L93 Difference]: Finished difference Result 717 states and 1276 transitions. [2025-01-09 04:36:38,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:38,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-01-09 04:36:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:39,006 INFO L225 Difference]: With dead ends: 717 [2025-01-09 04:36:39,006 INFO L226 Difference]: Without dead ends: 589 [2025-01-09 04:36:39,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:39,010 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 424 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:39,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1246 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-09 04:36:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2025-01-09 04:36:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 582 states have (on average 1.4793814432989691) internal successors, (861), 586 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 861 transitions. [2025-01-09 04:36:39,078 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 861 transitions. Word has length 141 [2025-01-09 04:36:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:39,079 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 861 transitions. [2025-01-09 04:36:39,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 861 transitions. [2025-01-09 04:36:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 04:36:39,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:39,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:39,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:36:39,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:39,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1860359615, now seen corresponding path program 1 times [2025-01-09 04:36:39,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:39,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369356264] [2025-01-09 04:36:39,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:39,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:39,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 04:36:39,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 04:36:39,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:39,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:39,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369356264] [2025-01-09 04:36:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369356264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:39,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:39,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:39,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387926440] [2025-01-09 04:36:39,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:39,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:39,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:39,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:39,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:39,653 INFO L87 Difference]: Start difference. First operand 587 states and 861 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:39,779 INFO L93 Difference]: Finished difference Result 2254 states and 3288 transitions. [2025-01-09 04:36:39,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:39,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2025-01-09 04:36:39,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:39,785 INFO L225 Difference]: With dead ends: 2254 [2025-01-09 04:36:39,785 INFO L226 Difference]: Without dead ends: 1692 [2025-01-09 04:36:39,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:39,790 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 1057 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:39,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 1965 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:39,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2025-01-09 04:36:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1103. [2025-01-09 04:36:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1098 states have (on average 1.4690346083788706) internal successors, (1613), 1102 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1613 transitions. [2025-01-09 04:36:39,838 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1613 transitions. Word has length 141 [2025-01-09 04:36:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:39,841 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1613 transitions. [2025-01-09 04:36:39,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1613 transitions. [2025-01-09 04:36:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 04:36:39,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:39,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:39,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:36:39,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:39,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1839649003, now seen corresponding path program 1 times [2025-01-09 04:36:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:39,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654779755] [2025-01-09 04:36:39,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:39,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:39,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 04:36:39,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 04:36:39,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:39,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:39,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:39,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654779755] [2025-01-09 04:36:39,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654779755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:39,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:39,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:39,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198117694] [2025-01-09 04:36:39,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:39,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:39,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:39,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:39,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:39,966 INFO L87 Difference]: Start difference. First operand 1103 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:39,999 INFO L93 Difference]: Finished difference Result 2180 states and 3182 transitions. [2025-01-09 04:36:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:40,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-01-09 04:36:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:40,004 INFO L225 Difference]: With dead ends: 2180 [2025-01-09 04:36:40,005 INFO L226 Difference]: Without dead ends: 1105 [2025-01-09 04:36:40,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:40,007 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 0 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:40,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1098 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2025-01-09 04:36:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1105. [2025-01-09 04:36:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1100 states have (on average 1.4681818181818183) internal successors, (1615), 1104 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1615 transitions. [2025-01-09 04:36:40,044 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1615 transitions. Word has length 142 [2025-01-09 04:36:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:40,045 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1615 transitions. [2025-01-09 04:36:40,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1615 transitions. [2025-01-09 04:36:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 04:36:40,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:40,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:40,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:36:40,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:40,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash 734467803, now seen corresponding path program 1 times [2025-01-09 04:36:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:40,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254385672] [2025-01-09 04:36:40,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:40,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:40,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 04:36:40,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 04:36:40,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:40,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:40,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:40,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254385672] [2025-01-09 04:36:40,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254385672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:40,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:40,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:40,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012707060] [2025-01-09 04:36:40,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:40,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:40,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:40,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:40,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:40,156 INFO L87 Difference]: Start difference. First operand 1105 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:40,213 INFO L93 Difference]: Finished difference Result 3075 states and 4502 transitions. [2025-01-09 04:36:40,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:40,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-01-09 04:36:40,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:40,222 INFO L225 Difference]: With dead ends: 3075 [2025-01-09 04:36:40,223 INFO L226 Difference]: Without dead ends: 2146 [2025-01-09 04:36:40,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:40,225 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 478 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:40,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1520 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2025-01-09 04:36:40,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2108. [2025-01-09 04:36:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2103 states have (on average 1.4555397051830719) internal successors, (3061), 2107 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 3061 transitions. [2025-01-09 04:36:40,283 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 3061 transitions. Word has length 143 [2025-01-09 04:36:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:40,283 INFO L471 AbstractCegarLoop]: Abstraction has 2108 states and 3061 transitions. [2025-01-09 04:36:40,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 3061 transitions. [2025-01-09 04:36:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 04:36:40,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:40,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:40,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:36:40,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:40,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:40,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1947336930, now seen corresponding path program 1 times [2025-01-09 04:36:40,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:40,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145913952] [2025-01-09 04:36:40,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:40,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:40,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 04:36:40,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 04:36:40,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:40,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:40,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145913952] [2025-01-09 04:36:40,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145913952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:40,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:40,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:40,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141282642] [2025-01-09 04:36:40,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:40,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:40,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:40,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:40,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:40,667 INFO L87 Difference]: Start difference. First operand 2108 states and 3061 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:40,700 INFO L93 Difference]: Finished difference Result 3559 states and 5175 transitions. [2025-01-09 04:36:40,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:40,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-01-09 04:36:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:40,705 INFO L225 Difference]: With dead ends: 3559 [2025-01-09 04:36:40,706 INFO L226 Difference]: Without dead ends: 1617 [2025-01-09 04:36:40,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:40,708 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 25 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:40,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1732 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-01-09 04:36:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-01-09 04:36:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1612 states have (on average 1.4491315136476426) internal successors, (2336), 1616 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2336 transitions. [2025-01-09 04:36:40,738 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2336 transitions. Word has length 143 [2025-01-09 04:36:40,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:40,739 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2336 transitions. [2025-01-09 04:36:40,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2336 transitions. [2025-01-09 04:36:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:36:40,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:40,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:40,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:36:40,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:40,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:40,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1943179396, now seen corresponding path program 1 times [2025-01-09 04:36:40,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:40,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505885330] [2025-01-09 04:36:40,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:40,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:36:40,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:36:40,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:40,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:41,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:41,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505885330] [2025-01-09 04:36:41,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505885330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:41,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:41,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:41,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200118922] [2025-01-09 04:36:41,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:41,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:41,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:41,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:41,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:41,099 INFO L87 Difference]: Start difference. First operand 1617 states and 2336 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:41,216 INFO L93 Difference]: Finished difference Result 3195 states and 4769 transitions. [2025-01-09 04:36:41,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:41,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-01-09 04:36:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:41,225 INFO L225 Difference]: With dead ends: 3195 [2025-01-09 04:36:41,225 INFO L226 Difference]: Without dead ends: 2613 [2025-01-09 04:36:41,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:41,227 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 876 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:41,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 986 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2025-01-09 04:36:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 2611. [2025-01-09 04:36:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2606 states have (on average 1.4608595548733692) internal successors, (3807), 2610 states have internal predecessors, (3807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3807 transitions. [2025-01-09 04:36:41,269 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3807 transitions. Word has length 149 [2025-01-09 04:36:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:41,269 INFO L471 AbstractCegarLoop]: Abstraction has 2611 states and 3807 transitions. [2025-01-09 04:36:41,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3807 transitions. [2025-01-09 04:36:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 04:36:41,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:41,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:41,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:36:41,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:41,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1091266556, now seen corresponding path program 1 times [2025-01-09 04:36:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:41,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102344506] [2025-01-09 04:36:41,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:41,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:41,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 04:36:41,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 04:36:41,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:41,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:41,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:41,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102344506] [2025-01-09 04:36:41,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102344506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:41,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:41,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227437394] [2025-01-09 04:36:41,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:41,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:41,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:41,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:41,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:41,516 INFO L87 Difference]: Start difference. First operand 2611 states and 3807 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:41,615 INFO L93 Difference]: Finished difference Result 6766 states and 9838 transitions. [2025-01-09 04:36:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:41,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-01-09 04:36:41,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:41,627 INFO L225 Difference]: With dead ends: 6766 [2025-01-09 04:36:41,627 INFO L226 Difference]: Without dead ends: 4174 [2025-01-09 04:36:41,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:41,632 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 482 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:41,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 2050 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4174 states. [2025-01-09 04:36:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4174 to 4144. [2025-01-09 04:36:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4139 states have (on average 1.4406861560763469) internal successors, (5963), 4143 states have internal predecessors, (5963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5963 transitions. [2025-01-09 04:36:41,771 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5963 transitions. Word has length 149 [2025-01-09 04:36:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:41,771 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5963 transitions. [2025-01-09 04:36:41,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5963 transitions. [2025-01-09 04:36:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 04:36:41,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:41,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:41,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:36:41,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:41,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash 872222087, now seen corresponding path program 1 times [2025-01-09 04:36:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353137915] [2025-01-09 04:36:41,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:41,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 04:36:41,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 04:36:41,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:41,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:41,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:41,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353137915] [2025-01-09 04:36:41,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353137915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:41,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:41,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:41,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396335408] [2025-01-09 04:36:41,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:41,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:41,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:41,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:41,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:41,850 INFO L87 Difference]: Start difference. First operand 4144 states and 5963 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:41,891 INFO L93 Difference]: Finished difference Result 9045 states and 13014 transitions. [2025-01-09 04:36:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:41,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-01-09 04:36:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:41,908 INFO L225 Difference]: With dead ends: 9045 [2025-01-09 04:36:41,909 INFO L226 Difference]: Without dead ends: 5819 [2025-01-09 04:36:41,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:41,918 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 519 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:41,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1544 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5819 states. [2025-01-09 04:36:41,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5819 to 4144. [2025-01-09 04:36:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4139 states have (on average 1.440444551824112) internal successors, (5962), 4143 states have internal predecessors, (5962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5962 transitions. [2025-01-09 04:36:42,005 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5962 transitions. Word has length 150 [2025-01-09 04:36:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:42,008 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5962 transitions. [2025-01-09 04:36:42,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5962 transitions. [2025-01-09 04:36:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 04:36:42,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:42,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:42,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:36:42,012 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:42,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash 332518950, now seen corresponding path program 1 times [2025-01-09 04:36:42,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:42,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764552116] [2025-01-09 04:36:42,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:42,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:42,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 04:36:42,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 04:36:42,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:42,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:42,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:42,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764552116] [2025-01-09 04:36:42,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764552116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:42,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:42,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:42,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321812241] [2025-01-09 04:36:42,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:42,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:42,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:42,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:42,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:42,117 INFO L87 Difference]: Start difference. First operand 4144 states and 5962 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:42,203 INFO L93 Difference]: Finished difference Result 10908 states and 15673 transitions. [2025-01-09 04:36:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:42,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-01-09 04:36:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:42,228 INFO L225 Difference]: With dead ends: 10908 [2025-01-09 04:36:42,233 INFO L226 Difference]: Without dead ends: 7095 [2025-01-09 04:36:42,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:42,244 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 470 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:42,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1513 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7095 states. [2025-01-09 04:36:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7095 to 7069. [2025-01-09 04:36:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7069 states, 7064 states have (on average 1.4166194790486977) internal successors, (10007), 7068 states have internal predecessors, (10007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7069 states to 7069 states and 10007 transitions. [2025-01-09 04:36:42,434 INFO L78 Accepts]: Start accepts. Automaton has 7069 states and 10007 transitions. Word has length 151 [2025-01-09 04:36:42,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:42,435 INFO L471 AbstractCegarLoop]: Abstraction has 7069 states and 10007 transitions. [2025-01-09 04:36:42,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 7069 states and 10007 transitions. [2025-01-09 04:36:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 04:36:42,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:42,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:42,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:36:42,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:42,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1116979159, now seen corresponding path program 1 times [2025-01-09 04:36:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:42,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319031947] [2025-01-09 04:36:42,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:42,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 04:36:42,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 04:36:42,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:42,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:42,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:42,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319031947] [2025-01-09 04:36:42,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319031947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:42,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:42,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:42,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292934457] [2025-01-09 04:36:42,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:42,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:42,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:42,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:42,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:42,884 INFO L87 Difference]: Start difference. First operand 7069 states and 10007 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:43,020 INFO L93 Difference]: Finished difference Result 27281 states and 38473 transitions. [2025-01-09 04:36:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:43,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-01-09 04:36:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:43,061 INFO L225 Difference]: With dead ends: 27281 [2025-01-09 04:36:43,062 INFO L226 Difference]: Without dead ends: 20275 [2025-01-09 04:36:43,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:43,075 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 1033 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:43,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1940 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:43,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20275 states. [2025-01-09 04:36:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20275 to 13621. [2025-01-09 04:36:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13621 states, 13616 states have (on average 1.4007784958871916) internal successors, (19073), 13620 states have internal predecessors, (19073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13621 states to 13621 states and 19073 transitions. [2025-01-09 04:36:43,324 INFO L78 Accepts]: Start accepts. Automaton has 13621 states and 19073 transitions. Word has length 151 [2025-01-09 04:36:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:43,324 INFO L471 AbstractCegarLoop]: Abstraction has 13621 states and 19073 transitions. [2025-01-09 04:36:43,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 13621 states and 19073 transitions. [2025-01-09 04:36:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 04:36:43,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:43,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:43,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:36:43,336 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:43,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 917589273, now seen corresponding path program 1 times [2025-01-09 04:36:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:43,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969500283] [2025-01-09 04:36:43,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:43,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:43,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 04:36:43,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 04:36:43,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:43,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:43,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:43,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969500283] [2025-01-09 04:36:43,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969500283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:43,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:43,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:43,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15046600] [2025-01-09 04:36:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:43,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:43,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:43,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:43,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:43,439 INFO L87 Difference]: Start difference. First operand 13621 states and 19073 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:43,521 INFO L93 Difference]: Finished difference Result 27134 states and 37995 transitions. [2025-01-09 04:36:43,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:43,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-01-09 04:36:43,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:43,543 INFO L225 Difference]: With dead ends: 27134 [2025-01-09 04:36:43,544 INFO L226 Difference]: Without dead ends: 13629 [2025-01-09 04:36:43,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:43,559 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:43,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1092 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:43,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13629 states. [2025-01-09 04:36:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13629 to 13629. [2025-01-09 04:36:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13629 states, 13624 states have (on average 1.4005431591309454) internal successors, (19081), 13628 states have internal predecessors, (19081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13629 states to 13629 states and 19081 transitions. [2025-01-09 04:36:43,759 INFO L78 Accepts]: Start accepts. Automaton has 13629 states and 19081 transitions. Word has length 152 [2025-01-09 04:36:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:43,760 INFO L471 AbstractCegarLoop]: Abstraction has 13629 states and 19081 transitions. [2025-01-09 04:36:43,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 13629 states and 19081 transitions. [2025-01-09 04:36:43,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 04:36:43,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:43,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:43,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:36:43,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:43,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2048196385, now seen corresponding path program 1 times [2025-01-09 04:36:43,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:43,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387020762] [2025-01-09 04:36:43,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:43,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 04:36:43,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 04:36:43,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:43,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:43,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:43,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387020762] [2025-01-09 04:36:43,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387020762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:43,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:43,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:43,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015251815] [2025-01-09 04:36:43,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:43,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:43,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:43,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:43,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:43,878 INFO L87 Difference]: Start difference. First operand 13629 states and 19081 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:43,987 INFO L93 Difference]: Finished difference Result 39246 states and 54902 transitions. [2025-01-09 04:36:43,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:43,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-01-09 04:36:43,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:44,028 INFO L225 Difference]: With dead ends: 39246 [2025-01-09 04:36:44,028 INFO L226 Difference]: Without dead ends: 26427 [2025-01-09 04:36:44,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:44,049 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 468 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:44,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1535 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26427 states. [2025-01-09 04:36:44,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26427 to 26370. [2025-01-09 04:36:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26370 states, 26365 states have (on average 1.3827422719514508) internal successors, (36456), 26369 states have internal predecessors, (36456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26370 states to 26370 states and 36456 transitions. [2025-01-09 04:36:44,528 INFO L78 Accepts]: Start accepts. Automaton has 26370 states and 36456 transitions. Word has length 153 [2025-01-09 04:36:44,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:44,528 INFO L471 AbstractCegarLoop]: Abstraction has 26370 states and 36456 transitions. [2025-01-09 04:36:44,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 26370 states and 36456 transitions. [2025-01-09 04:36:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 04:36:44,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:44,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:44,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:36:44,554 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:44,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash 540544484, now seen corresponding path program 1 times [2025-01-09 04:36:44,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:44,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962290602] [2025-01-09 04:36:44,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:44,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:44,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 04:36:44,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 04:36:44,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:44,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:44,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962290602] [2025-01-09 04:36:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962290602] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:44,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:44,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808572476] [2025-01-09 04:36:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:44,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:44,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:44,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:44,882 INFO L87 Difference]: Start difference. First operand 26370 states and 36456 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:45,075 INFO L93 Difference]: Finished difference Result 45834 states and 63410 transitions. [2025-01-09 04:36:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:45,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-01-09 04:36:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:45,105 INFO L225 Difference]: With dead ends: 45834 [2025-01-09 04:36:45,105 INFO L226 Difference]: Without dead ends: 20202 [2025-01-09 04:36:45,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:45,121 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 15 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:45,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1699 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20202 states. [2025-01-09 04:36:45,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20202 to 20202. [2025-01-09 04:36:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20202 states, 20197 states have (on average 1.3784720503045007) internal successors, (27841), 20201 states have internal predecessors, (27841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20202 states to 20202 states and 27841 transitions. [2025-01-09 04:36:45,366 INFO L78 Accepts]: Start accepts. Automaton has 20202 states and 27841 transitions. Word has length 153 [2025-01-09 04:36:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:45,366 INFO L471 AbstractCegarLoop]: Abstraction has 20202 states and 27841 transitions. [2025-01-09 04:36:45,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20202 states and 27841 transitions. [2025-01-09 04:36:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 04:36:45,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:45,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:45,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:36:45,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:45,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash 269300877, now seen corresponding path program 1 times [2025-01-09 04:36:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:45,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159792428] [2025-01-09 04:36:45,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:45,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 04:36:45,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 04:36:45,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:45,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:45,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:45,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159792428] [2025-01-09 04:36:45,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159792428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:45,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:45,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:45,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501371655] [2025-01-09 04:36:45,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:45,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:45,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:45,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:45,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:45,669 INFO L87 Difference]: Start difference. First operand 20202 states and 27841 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:45,829 INFO L93 Difference]: Finished difference Result 43820 states and 60511 transitions. [2025-01-09 04:36:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:45,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2025-01-09 04:36:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:45,876 INFO L225 Difference]: With dead ends: 43820 [2025-01-09 04:36:45,876 INFO L226 Difference]: Without dead ends: 26651 [2025-01-09 04:36:45,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:45,896 INFO L435 NwaCegarLoop]: 1224 mSDtfsCounter, 920 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:45,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 2622 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26651 states. [2025-01-09 04:36:46,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26651 to 26394. [2025-01-09 04:36:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26394 states, 26389 states have (on average 1.373488953730721) internal successors, (36245), 26393 states have internal predecessors, (36245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26394 states to 26394 states and 36245 transitions. [2025-01-09 04:36:46,306 INFO L78 Accepts]: Start accepts. Automaton has 26394 states and 36245 transitions. Word has length 159 [2025-01-09 04:36:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:46,306 INFO L471 AbstractCegarLoop]: Abstraction has 26394 states and 36245 transitions. [2025-01-09 04:36:46,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 26394 states and 36245 transitions. [2025-01-09 04:36:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 04:36:46,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:46,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:46,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:36:46,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:46,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1314619300, now seen corresponding path program 1 times [2025-01-09 04:36:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:46,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406289935] [2025-01-09 04:36:46,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:46,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:46,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 04:36:46,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 04:36:46,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:46,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:46,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:46,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406289935] [2025-01-09 04:36:46,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406289935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:46,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:46,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44772798] [2025-01-09 04:36:46,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:46,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:46,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:46,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:46,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:46,386 INFO L87 Difference]: Start difference. First operand 26394 states and 36245 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:46,484 INFO L93 Difference]: Finished difference Result 49342 states and 67925 transitions. [2025-01-09 04:36:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-01-09 04:36:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:46,542 INFO L225 Difference]: With dead ends: 49342 [2025-01-09 04:36:46,543 INFO L226 Difference]: Without dead ends: 36160 [2025-01-09 04:36:46,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:46,563 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 516 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:46,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1472 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:46,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36160 states. [2025-01-09 04:36:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36160 to 26394. [2025-01-09 04:36:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26394 states, 26389 states have (on average 1.3733373754215772) internal successors, (36241), 26393 states have internal predecessors, (36241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26394 states to 26394 states and 36241 transitions. [2025-01-09 04:36:47,123 INFO L78 Accepts]: Start accepts. Automaton has 26394 states and 36241 transitions. Word has length 160 [2025-01-09 04:36:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:47,123 INFO L471 AbstractCegarLoop]: Abstraction has 26394 states and 36241 transitions. [2025-01-09 04:36:47,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 26394 states and 36241 transitions. [2025-01-09 04:36:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 04:36:47,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:47,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:47,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:36:47,141 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:47,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1351277290, now seen corresponding path program 1 times [2025-01-09 04:36:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:47,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69319611] [2025-01-09 04:36:47,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:47,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:47,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 04:36:47,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 04:36:47,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:47,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:47,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:47,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69319611] [2025-01-09 04:36:47,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69319611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:47,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:47,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:47,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554334446] [2025-01-09 04:36:47,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:47,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:47,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:47,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:47,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:47,574 INFO L87 Difference]: Start difference. First operand 26394 states and 36241 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:47,649 INFO L93 Difference]: Finished difference Result 35318 states and 48621 transitions. [2025-01-09 04:36:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:47,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-01-09 04:36:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:47,692 INFO L225 Difference]: With dead ends: 35318 [2025-01-09 04:36:47,693 INFO L226 Difference]: Without dead ends: 25219 [2025-01-09 04:36:47,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:47,708 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 9 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:47,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1688 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25219 states. [2025-01-09 04:36:48,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25219 to 25219. [2025-01-09 04:36:48,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25219 states, 25214 states have (on average 1.3749504243674149) internal successors, (34668), 25218 states have internal predecessors, (34668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25219 states to 25219 states and 34668 transitions. [2025-01-09 04:36:48,101 INFO L78 Accepts]: Start accepts. Automaton has 25219 states and 34668 transitions. Word has length 161 [2025-01-09 04:36:48,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:48,101 INFO L471 AbstractCegarLoop]: Abstraction has 25219 states and 34668 transitions. [2025-01-09 04:36:48,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 25219 states and 34668 transitions. [2025-01-09 04:36:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 04:36:48,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:48,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:48,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:36:48,115 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:48,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash 98531594, now seen corresponding path program 1 times [2025-01-09 04:36:48,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:48,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518534518] [2025-01-09 04:36:48,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:48,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:48,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 04:36:48,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 04:36:48,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:48,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:48,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:48,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518534518] [2025-01-09 04:36:48,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518534518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:48,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:48,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:48,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149902188] [2025-01-09 04:36:48,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:48,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:48,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:48,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:48,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:48,180 INFO L87 Difference]: Start difference. First operand 25219 states and 34668 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:48,501 INFO L93 Difference]: Finished difference Result 71354 states and 98591 transitions. [2025-01-09 04:36:48,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:48,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-01-09 04:36:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:48,587 INFO L225 Difference]: With dead ends: 71354 [2025-01-09 04:36:48,588 INFO L226 Difference]: Without dead ends: 49052 [2025-01-09 04:36:48,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:48,615 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 457 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:48,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 873 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:36:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49052 states. [2025-01-09 04:36:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49052 to 48986. [2025-01-09 04:36:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48986 states, 48981 states have (on average 1.3655703231865417) internal successors, (66887), 48985 states have internal predecessors, (66887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48986 states to 48986 states and 66887 transitions. [2025-01-09 04:36:49,420 INFO L78 Accepts]: Start accepts. Automaton has 48986 states and 66887 transitions. Word has length 165 [2025-01-09 04:36:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:49,421 INFO L471 AbstractCegarLoop]: Abstraction has 48986 states and 66887 transitions. [2025-01-09 04:36:49,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 48986 states and 66887 transitions. [2025-01-09 04:36:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 04:36:49,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:49,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:49,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:36:49,454 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:49,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:49,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1608136879, now seen corresponding path program 1 times [2025-01-09 04:36:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:49,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876764139] [2025-01-09 04:36:49,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:49,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:49,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 04:36:49,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 04:36:49,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:49,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:49,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876764139] [2025-01-09 04:36:49,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876764139] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:49,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:49,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:36:49,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012261678] [2025-01-09 04:36:49,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:49,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:36:49,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:49,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:36:49,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:36:49,998 INFO L87 Difference]: Start difference. First operand 48986 states and 66887 transitions. Second operand has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:50,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:50,505 INFO L93 Difference]: Finished difference Result 63867 states and 90121 transitions. [2025-01-09 04:36:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:50,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-01-09 04:36:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:50,571 INFO L225 Difference]: With dead ends: 63867 [2025-01-09 04:36:50,571 INFO L226 Difference]: Without dead ends: 44297 [2025-01-09 04:36:50,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:36:50,596 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 690 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 3191 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:50,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 3191 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:36:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44297 states. [2025-01-09 04:36:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44297 to 44295. [2025-01-09 04:36:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44295 states, 44290 states have (on average 1.3358997516369384) internal successors, (59167), 44294 states have internal predecessors, (59167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44295 states to 44295 states and 59167 transitions. [2025-01-09 04:36:51,135 INFO L78 Accepts]: Start accepts. Automaton has 44295 states and 59167 transitions. Word has length 165 [2025-01-09 04:36:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:51,136 INFO L471 AbstractCegarLoop]: Abstraction has 44295 states and 59167 transitions. [2025-01-09 04:36:51,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 44295 states and 59167 transitions. [2025-01-09 04:36:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 04:36:51,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:51,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:51,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:36:51,162 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:51,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:51,163 INFO L85 PathProgramCache]: Analyzing trace with hash -554564590, now seen corresponding path program 1 times [2025-01-09 04:36:51,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:51,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230826312] [2025-01-09 04:36:51,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:51,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:51,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 04:36:51,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 04:36:51,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:51,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:51,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:51,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230826312] [2025-01-09 04:36:51,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230826312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:51,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:51,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:51,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336870166] [2025-01-09 04:36:51,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:51,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:51,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:51,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:51,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:51,378 INFO L87 Difference]: Start difference. First operand 44295 states and 59167 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:51,738 INFO L93 Difference]: Finished difference Result 67119 states and 89842 transitions. [2025-01-09 04:36:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:51,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-01-09 04:36:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:51,769 INFO L225 Difference]: With dead ends: 67119 [2025-01-09 04:36:51,770 INFO L226 Difference]: Without dead ends: 28683 [2025-01-09 04:36:51,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:51,796 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 477 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:51,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1584 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:36:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28683 states. [2025-01-09 04:36:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28683 to 28590. [2025-01-09 04:36:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28590 states, 28585 states have (on average 1.3416477173342662) internal successors, (38351), 28589 states have internal predecessors, (38351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28590 states to 28590 states and 38351 transitions. [2025-01-09 04:36:52,278 INFO L78 Accepts]: Start accepts. Automaton has 28590 states and 38351 transitions. Word has length 165 [2025-01-09 04:36:52,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:52,278 INFO L471 AbstractCegarLoop]: Abstraction has 28590 states and 38351 transitions. [2025-01-09 04:36:52,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 28590 states and 38351 transitions. [2025-01-09 04:36:52,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 04:36:52,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:52,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:52,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:36:52,298 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:52,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:52,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1156742285, now seen corresponding path program 1 times [2025-01-09 04:36:52,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:52,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266791] [2025-01-09 04:36:52,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:52,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:52,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 04:36:52,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 04:36:52,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:52,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:52,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:52,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266791] [2025-01-09 04:36:52,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:52,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:52,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:52,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343748127] [2025-01-09 04:36:52,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:52,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:52,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:52,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:52,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:52,407 INFO L87 Difference]: Start difference. First operand 28590 states and 38351 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:52,755 INFO L93 Difference]: Finished difference Result 75408 states and 102327 transitions. [2025-01-09 04:36:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:52,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-01-09 04:36:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:52,819 INFO L225 Difference]: With dead ends: 75408 [2025-01-09 04:36:52,819 INFO L226 Difference]: Without dead ends: 53191 [2025-01-09 04:36:52,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:52,852 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 435 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:52,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 907 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:36:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53191 states. [2025-01-09 04:36:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53191 to 53137. [2025-01-09 04:36:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53137 states, 53132 states have (on average 1.3408868478506362) internal successors, (71244), 53136 states have internal predecessors, (71244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53137 states to 53137 states and 71244 transitions. [2025-01-09 04:36:53,814 INFO L78 Accepts]: Start accepts. Automaton has 53137 states and 71244 transitions. Word has length 167 [2025-01-09 04:36:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:53,814 INFO L471 AbstractCegarLoop]: Abstraction has 53137 states and 71244 transitions. [2025-01-09 04:36:53,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 53137 states and 71244 transitions. [2025-01-09 04:36:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 04:36:53,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:53,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:53,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:36:53,844 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:53,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1293957512, now seen corresponding path program 1 times [2025-01-09 04:36:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:53,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866976510] [2025-01-09 04:36:53,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:53,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:53,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 04:36:53,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 04:36:53,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:53,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:54,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:54,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866976510] [2025-01-09 04:36:54,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866976510] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:54,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:54,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:54,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865727458] [2025-01-09 04:36:54,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:54,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:54,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:54,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:54,025 INFO L87 Difference]: Start difference. First operand 53137 states and 71244 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:54,383 INFO L93 Difference]: Finished difference Result 112174 states and 150586 transitions. [2025-01-09 04:36:54,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:54,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-01-09 04:36:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:54,451 INFO L225 Difference]: With dead ends: 112174 [2025-01-09 04:36:54,451 INFO L226 Difference]: Without dead ends: 73484 [2025-01-09 04:36:54,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:54,480 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 1035 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:54,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1874 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73484 states. [2025-01-09 04:36:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73484 to 53329. [2025-01-09 04:36:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53329 states, 53324 states have (on average 1.3403720651113944) internal successors, (71474), 53328 states have internal predecessors, (71474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53329 states to 53329 states and 71474 transitions. [2025-01-09 04:36:55,460 INFO L78 Accepts]: Start accepts. Automaton has 53329 states and 71474 transitions. Word has length 167 [2025-01-09 04:36:55,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:55,460 INFO L471 AbstractCegarLoop]: Abstraction has 53329 states and 71474 transitions. [2025-01-09 04:36:55,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 53329 states and 71474 transitions. [2025-01-09 04:36:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:36:55,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:55,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:55,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:36:55,503 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:55,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:55,503 INFO L85 PathProgramCache]: Analyzing trace with hash -119597428, now seen corresponding path program 1 times [2025-01-09 04:36:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:55,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638206741] [2025-01-09 04:36:55,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:55,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:55,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:36:55,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:36:55,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:55,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:55,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:55,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638206741] [2025-01-09 04:36:55,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638206741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:55,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:55,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:55,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040951796] [2025-01-09 04:36:55,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:55,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:55,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:55,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:55,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:55,576 INFO L87 Difference]: Start difference. First operand 53329 states and 71474 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:55,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:55,994 INFO L93 Difference]: Finished difference Result 106066 states and 142259 transitions. [2025-01-09 04:36:55,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:55,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-01-09 04:36:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:56,045 INFO L225 Difference]: With dead ends: 106066 [2025-01-09 04:36:56,046 INFO L226 Difference]: Without dead ends: 53345 [2025-01-09 04:36:56,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:56,069 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:56,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1082 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53345 states. [2025-01-09 04:36:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53345 to 53345. [2025-01-09 04:36:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53345 states, 53340 states have (on average 1.3402699662542181) internal successors, (71490), 53344 states have internal predecessors, (71490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53345 states to 53345 states and 71490 transitions. [2025-01-09 04:36:56,779 INFO L78 Accepts]: Start accepts. Automaton has 53345 states and 71490 transitions. Word has length 168 [2025-01-09 04:36:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:56,779 INFO L471 AbstractCegarLoop]: Abstraction has 53345 states and 71490 transitions. [2025-01-09 04:36:56,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 53345 states and 71490 transitions. [2025-01-09 04:36:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 04:36:56,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:56,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:56,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:36:56,808 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:56,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:56,809 INFO L85 PathProgramCache]: Analyzing trace with hash 414006733, now seen corresponding path program 1 times [2025-01-09 04:36:56,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:56,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913651110] [2025-01-09 04:36:56,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:56,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:56,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 04:36:56,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 04:36:56,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:56,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:56,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:56,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913651110] [2025-01-09 04:36:56,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913651110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:56,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:56,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506172974] [2025-01-09 04:36:56,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:56,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:56,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:56,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:56,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:56,895 INFO L87 Difference]: Start difference. First operand 53345 states and 71490 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:57,165 INFO L93 Difference]: Finished difference Result 87414 states and 118476 transitions. [2025-01-09 04:36:57,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:57,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-01-09 04:36:57,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:57,203 INFO L225 Difference]: With dead ends: 87414 [2025-01-09 04:36:57,203 INFO L226 Difference]: Without dead ends: 37340 [2025-01-09 04:36:57,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:36:57,235 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 1453 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:57,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 495 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37340 states. [2025-01-09 04:36:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37340 to 28756. [2025-01-09 04:36:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28756 states, 28751 states have (on average 1.3238843866300303) internal successors, (38063), 28755 states have internal predecessors, (38063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28756 states to 28756 states and 38063 transitions. [2025-01-09 04:36:57,749 INFO L78 Accepts]: Start accepts. Automaton has 28756 states and 38063 transitions. Word has length 169 [2025-01-09 04:36:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:57,749 INFO L471 AbstractCegarLoop]: Abstraction has 28756 states and 38063 transitions. [2025-01-09 04:36:57,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 28756 states and 38063 transitions. [2025-01-09 04:36:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 04:36:57,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:57,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:57,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:36:57,763 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:57,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:57,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1444044968, now seen corresponding path program 1 times [2025-01-09 04:36:57,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:57,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166585678] [2025-01-09 04:36:57,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:57,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:57,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 04:36:57,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 04:36:57,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:57,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:57,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:57,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166585678] [2025-01-09 04:36:57,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166585678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:57,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:57,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:57,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863531123] [2025-01-09 04:36:57,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:57,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:57,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:57,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:57,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:57,933 INFO L87 Difference]: Start difference. First operand 28756 states and 38063 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:58,088 INFO L93 Difference]: Finished difference Result 52674 states and 71264 transitions. [2025-01-09 04:36:58,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:58,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-01-09 04:36:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:58,130 INFO L225 Difference]: With dead ends: 52674 [2025-01-09 04:36:58,130 INFO L226 Difference]: Without dead ends: 41243 [2025-01-09 04:36:58,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:58,151 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 852 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:58,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 936 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41243 states. [2025-01-09 04:36:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41243 to 41241. [2025-01-09 04:36:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41241 states, 41236 states have (on average 1.3044427199534387) internal successors, (53790), 41240 states have internal predecessors, (53790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41241 states to 41241 states and 53790 transitions. [2025-01-09 04:36:58,857 INFO L78 Accepts]: Start accepts. Automaton has 41241 states and 53790 transitions. Word has length 169 [2025-01-09 04:36:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:58,858 INFO L471 AbstractCegarLoop]: Abstraction has 41241 states and 53790 transitions. [2025-01-09 04:36:58,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 41241 states and 53790 transitions. [2025-01-09 04:36:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 04:36:58,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:58,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:58,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:36:58,890 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:58,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:58,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1157430736, now seen corresponding path program 1 times [2025-01-09 04:36:58,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:58,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525351919] [2025-01-09 04:36:58,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:58,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:58,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 04:36:58,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 04:36:58,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:58,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:36:59,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:59,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525351919] [2025-01-09 04:36:59,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525351919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:59,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:59,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:59,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14869272] [2025-01-09 04:36:59,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:59,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:59,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:59,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:59,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:59,138 INFO L87 Difference]: Start difference. First operand 41241 states and 53790 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:59,427 INFO L93 Difference]: Finished difference Result 71823 states and 93725 transitions. [2025-01-09 04:36:59,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:59,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-01-09 04:36:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:59,465 INFO L225 Difference]: With dead ends: 71823 [2025-01-09 04:36:59,466 INFO L226 Difference]: Without dead ends: 41966 [2025-01-09 04:36:59,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:59,481 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 472 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:59,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1856 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41966 states. [2025-01-09 04:36:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41966 to 41561. [2025-01-09 04:36:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41561 states, 41556 states have (on average 1.303181249398402) internal successors, (54155), 41560 states have internal predecessors, (54155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41561 states to 41561 states and 54155 transitions. [2025-01-09 04:36:59,935 INFO L78 Accepts]: Start accepts. Automaton has 41561 states and 54155 transitions. Word has length 169 [2025-01-09 04:36:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:59,935 INFO L471 AbstractCegarLoop]: Abstraction has 41561 states and 54155 transitions. [2025-01-09 04:36:59,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:36:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 41561 states and 54155 transitions. [2025-01-09 04:36:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 04:36:59,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:59,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:36:59,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:36:59,962 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:36:59,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1236291671, now seen corresponding path program 1 times [2025-01-09 04:36:59,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:59,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340475410] [2025-01-09 04:36:59,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:59,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 04:36:59,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 04:36:59,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:59,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:00,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:00,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:00,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340475410] [2025-01-09 04:37:00,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340475410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:00,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:00,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:37:00,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407268089] [2025-01-09 04:37:00,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:00,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:37:00,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:00,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:37:00,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:37:00,327 INFO L87 Difference]: Start difference. First operand 41561 states and 54155 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:00,441 INFO L93 Difference]: Finished difference Result 77231 states and 100650 transitions. [2025-01-09 04:37:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:37:00,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-01-09 04:37:00,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:00,475 INFO L225 Difference]: With dead ends: 77231 [2025-01-09 04:37:00,476 INFO L226 Difference]: Without dead ends: 35970 [2025-01-09 04:37:00,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:37:00,505 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 4 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:00,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1642 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:37:00,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35970 states. [2025-01-09 04:37:00,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35970 to 35970. [2025-01-09 04:37:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35970 states, 35965 states have (on average 1.302599749756708) internal successors, (46848), 35969 states have internal predecessors, (46848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35970 states to 35970 states and 46848 transitions. [2025-01-09 04:37:01,084 INFO L78 Accepts]: Start accepts. Automaton has 35970 states and 46848 transitions. Word has length 169 [2025-01-09 04:37:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:01,087 INFO L471 AbstractCegarLoop]: Abstraction has 35970 states and 46848 transitions. [2025-01-09 04:37:01,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 35970 states and 46848 transitions. [2025-01-09 04:37:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 04:37:01,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:01,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:01,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:37:01,118 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:01,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash 362923219, now seen corresponding path program 1 times [2025-01-09 04:37:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:01,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455951003] [2025-01-09 04:37:01,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:01,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 04:37:01,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 04:37:01,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:01,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:01,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:01,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455951003] [2025-01-09 04:37:01,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455951003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:01,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:01,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:37:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411201366] [2025-01-09 04:37:01,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:01,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:37:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:01,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:37:01,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:37:01,168 INFO L87 Difference]: Start difference. First operand 35970 states and 46848 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:01,277 INFO L93 Difference]: Finished difference Result 78163 states and 101815 transitions. [2025-01-09 04:37:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:37:01,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-01-09 04:37:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:01,330 INFO L225 Difference]: With dead ends: 78163 [2025-01-09 04:37:01,331 INFO L226 Difference]: Without dead ends: 52302 [2025-01-09 04:37:01,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:37:01,358 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 490 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:01,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1479 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:37:01,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52302 states. [2025-01-09 04:37:01,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52302 to 35973. [2025-01-09 04:37:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35973 states, 35968 states have (on average 1.3024076957295374) internal successors, (46845), 35972 states have internal predecessors, (46845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35973 states to 35973 states and 46845 transitions. [2025-01-09 04:37:02,041 INFO L78 Accepts]: Start accepts. Automaton has 35973 states and 46845 transitions. Word has length 170 [2025-01-09 04:37:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:02,041 INFO L471 AbstractCegarLoop]: Abstraction has 35973 states and 46845 transitions. [2025-01-09 04:37:02,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 35973 states and 46845 transitions. [2025-01-09 04:37:02,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:02,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:02,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:02,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:37:02,064 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:02,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash -855174734, now seen corresponding path program 1 times [2025-01-09 04:37:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:02,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809244165] [2025-01-09 04:37:02,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:02,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:02,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:02,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:02,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:03,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:03,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809244165] [2025-01-09 04:37:03,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809244165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:03,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:03,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 04:37:03,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603417070] [2025-01-09 04:37:03,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:03,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:37:03,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:03,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:37:03,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:37:03,999 INFO L87 Difference]: Start difference. First operand 35973 states and 46845 transitions. Second operand has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:08,096 INFO L93 Difference]: Finished difference Result 54565 states and 73501 transitions. [2025-01-09 04:37:08,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 04:37:08,096 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:08,153 INFO L225 Difference]: With dead ends: 54565 [2025-01-09 04:37:08,153 INFO L226 Difference]: Without dead ends: 50145 [2025-01-09 04:37:08,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=399, Invalid=1407, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 04:37:08,170 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 5993 mSDsluCounter, 13121 mSDsCounter, 0 mSdLazyCounter, 4699 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5993 SdHoareTripleChecker+Valid, 14071 SdHoareTripleChecker+Invalid, 4773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:08,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5993 Valid, 14071 Invalid, 4773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 4699 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 04:37:08,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50145 states. [2025-01-09 04:37:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50145 to 37339. [2025-01-09 04:37:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37339 states, 37334 states have (on average 1.2981196764343494) internal successors, (48464), 37338 states have internal predecessors, (48464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37339 states to 37339 states and 48464 transitions. [2025-01-09 04:37:08,697 INFO L78 Accepts]: Start accepts. Automaton has 37339 states and 48464 transitions. Word has length 171 [2025-01-09 04:37:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:08,698 INFO L471 AbstractCegarLoop]: Abstraction has 37339 states and 48464 transitions. [2025-01-09 04:37:08,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 37339 states and 48464 transitions. [2025-01-09 04:37:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:08,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:08,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:08,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:37:08,721 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:08,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash -176781235, now seen corresponding path program 1 times [2025-01-09 04:37:08,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:08,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688611532] [2025-01-09 04:37:08,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:08,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:08,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:08,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:08,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:08,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:08,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:08,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688611532] [2025-01-09 04:37:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688611532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:08,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:37:08,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796288945] [2025-01-09 04:37:08,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:08,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:37:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:08,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:37:08,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:37:08,960 INFO L87 Difference]: Start difference. First operand 37339 states and 48464 transitions. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:09,182 INFO L93 Difference]: Finished difference Result 60997 states and 80239 transitions. [2025-01-09 04:37:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:37:09,182 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:09,208 INFO L225 Difference]: With dead ends: 60997 [2025-01-09 04:37:09,208 INFO L226 Difference]: Without dead ends: 25914 [2025-01-09 04:37:09,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:37:09,232 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 1427 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:09,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 728 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:37:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25914 states. [2025-01-09 04:37:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25914 to 20355. [2025-01-09 04:37:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20355 states, 20350 states have (on average 1.282014742014742) internal successors, (26089), 20354 states have internal predecessors, (26089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20355 states to 20355 states and 26089 transitions. [2025-01-09 04:37:09,452 INFO L78 Accepts]: Start accepts. Automaton has 20355 states and 26089 transitions. Word has length 171 [2025-01-09 04:37:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:09,452 INFO L471 AbstractCegarLoop]: Abstraction has 20355 states and 26089 transitions. [2025-01-09 04:37:09,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 20355 states and 26089 transitions. [2025-01-09 04:37:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:09,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:09,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:09,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:37:09,465 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:09,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1795637352, now seen corresponding path program 1 times [2025-01-09 04:37:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:09,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882134517] [2025-01-09 04:37:09,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:09,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:09,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:09,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:09,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:09,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:10,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:10,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882134517] [2025-01-09 04:37:10,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882134517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:10,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:10,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-01-09 04:37:10,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377705616] [2025-01-09 04:37:10,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:10,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 04:37:10,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:10,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 04:37:10,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:37:10,918 INFO L87 Difference]: Start difference. First operand 20355 states and 26089 transitions. Second operand has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:15,572 INFO L93 Difference]: Finished difference Result 32688 states and 43444 transitions. [2025-01-09 04:37:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 04:37:15,572 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:15,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:15,606 INFO L225 Difference]: With dead ends: 32688 [2025-01-09 04:37:15,606 INFO L226 Difference]: Without dead ends: 31376 [2025-01-09 04:37:15,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=496, Invalid=1760, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 04:37:15,619 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 4700 mSDsluCounter, 13735 mSDsCounter, 0 mSdLazyCounter, 4878 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4700 SdHoareTripleChecker+Valid, 14781 SdHoareTripleChecker+Invalid, 4958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:15,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4700 Valid, 14781 Invalid, 4958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4878 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 04:37:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31376 states. [2025-01-09 04:37:15,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31376 to 22200. [2025-01-09 04:37:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22200 states, 22195 states have (on average 1.2748366749267852) internal successors, (28295), 22199 states have internal predecessors, (28295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22200 states to 22200 states and 28295 transitions. [2025-01-09 04:37:15,999 INFO L78 Accepts]: Start accepts. Automaton has 22200 states and 28295 transitions. Word has length 171 [2025-01-09 04:37:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:15,999 INFO L471 AbstractCegarLoop]: Abstraction has 22200 states and 28295 transitions. [2025-01-09 04:37:16,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 22200 states and 28295 transitions. [2025-01-09 04:37:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:16,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:16,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:16,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:37:16,017 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:16,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:16,018 INFO L85 PathProgramCache]: Analyzing trace with hash 367317059, now seen corresponding path program 1 times [2025-01-09 04:37:16,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:16,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060594691] [2025-01-09 04:37:16,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:16,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:16,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:16,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:16,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:16,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:16,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060594691] [2025-01-09 04:37:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060594691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:16,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:16,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:37:16,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736942544] [2025-01-09 04:37:16,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:16,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:37:16,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:16,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:37:16,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:37:16,164 INFO L87 Difference]: Start difference. First operand 22200 states and 28295 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:16,411 INFO L93 Difference]: Finished difference Result 52519 states and 68017 transitions. [2025-01-09 04:37:16,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:37:16,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:16,452 INFO L225 Difference]: With dead ends: 52519 [2025-01-09 04:37:16,452 INFO L226 Difference]: Without dead ends: 38204 [2025-01-09 04:37:16,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:37:16,472 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 343 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:16,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1003 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:37:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38204 states. [2025-01-09 04:37:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38204 to 37686. [2025-01-09 04:37:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37686 states, 37681 states have (on average 1.2770892492237467) internal successors, (48122), 37685 states have internal predecessors, (48122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37686 states to 37686 states and 48122 transitions. [2025-01-09 04:37:17,032 INFO L78 Accepts]: Start accepts. Automaton has 37686 states and 48122 transitions. Word has length 171 [2025-01-09 04:37:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:17,032 INFO L471 AbstractCegarLoop]: Abstraction has 37686 states and 48122 transitions. [2025-01-09 04:37:17,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 37686 states and 48122 transitions. [2025-01-09 04:37:17,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:17,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:17,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:17,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:37:17,061 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:17,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1127609204, now seen corresponding path program 1 times [2025-01-09 04:37:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:17,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600097819] [2025-01-09 04:37:17,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:17,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:17,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:17,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:17,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:18,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600097819] [2025-01-09 04:37:18,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600097819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:18,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:18,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-01-09 04:37:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143154217] [2025-01-09 04:37:18,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:18,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 04:37:18,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:18,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 04:37:18,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:37:18,587 INFO L87 Difference]: Start difference. First operand 37686 states and 48122 transitions. Second operand has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:23,167 INFO L93 Difference]: Finished difference Result 67970 states and 91703 transitions. [2025-01-09 04:37:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 04:37:23,168 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:23,241 INFO L225 Difference]: With dead ends: 67970 [2025-01-09 04:37:23,241 INFO L226 Difference]: Without dead ends: 63161 [2025-01-09 04:37:23,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=355, Invalid=1127, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 04:37:23,265 INFO L435 NwaCegarLoop]: 1155 mSDtfsCounter, 6106 mSDsluCounter, 13742 mSDsCounter, 0 mSdLazyCounter, 4814 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6106 SdHoareTripleChecker+Valid, 14897 SdHoareTripleChecker+Invalid, 4831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:23,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6106 Valid, 14897 Invalid, 4831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4814 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 04:37:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63161 states. [2025-01-09 04:37:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63161 to 38418. [2025-01-09 04:37:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38418 states, 38413 states have (on average 1.2749850311092599) internal successors, (48976), 38417 states have internal predecessors, (48976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38418 states to 38418 states and 48976 transitions. [2025-01-09 04:37:24,044 INFO L78 Accepts]: Start accepts. Automaton has 38418 states and 48976 transitions. Word has length 171 [2025-01-09 04:37:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:24,044 INFO L471 AbstractCegarLoop]: Abstraction has 38418 states and 48976 transitions. [2025-01-09 04:37:24,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 38418 states and 48976 transitions. [2025-01-09 04:37:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:24,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:24,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:24,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:37:24,073 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:24,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:24,073 INFO L85 PathProgramCache]: Analyzing trace with hash 416227804, now seen corresponding path program 1 times [2025-01-09 04:37:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:24,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454230204] [2025-01-09 04:37:24,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:24,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:24,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:24,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:24,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:24,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454230204] [2025-01-09 04:37:24,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454230204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:24,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:24,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 04:37:24,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290146854] [2025-01-09 04:37:24,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:24,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 04:37:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:24,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 04:37:24,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:37:24,766 INFO L87 Difference]: Start difference. First operand 38418 states and 48976 transitions. Second operand has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:26,325 INFO L93 Difference]: Finished difference Result 105045 states and 140855 transitions. [2025-01-09 04:37:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 04:37:26,326 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:26,430 INFO L225 Difference]: With dead ends: 105045 [2025-01-09 04:37:26,430 INFO L226 Difference]: Without dead ends: 96768 [2025-01-09 04:37:26,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=445, Invalid=1277, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 04:37:26,466 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 5761 mSDsluCounter, 8949 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5761 SdHoareTripleChecker+Valid, 10033 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:26,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5761 Valid, 10033 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:37:26,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96768 states. [2025-01-09 04:37:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96768 to 45872. [2025-01-09 04:37:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45872 states, 45867 states have (on average 1.2551071576514705) internal successors, (57568), 45871 states have internal predecessors, (57568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45872 states to 45872 states and 57568 transitions. [2025-01-09 04:37:27,407 INFO L78 Accepts]: Start accepts. Automaton has 45872 states and 57568 transitions. Word has length 171 [2025-01-09 04:37:27,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:27,407 INFO L471 AbstractCegarLoop]: Abstraction has 45872 states and 57568 transitions. [2025-01-09 04:37:27,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 45872 states and 57568 transitions. [2025-01-09 04:37:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:27,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:27,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:27,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:37:27,445 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:27,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:27,446 INFO L85 PathProgramCache]: Analyzing trace with hash 899792804, now seen corresponding path program 1 times [2025-01-09 04:37:27,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:27,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95347631] [2025-01-09 04:37:27,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:27,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:27,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:27,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:27,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:28,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:28,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95347631] [2025-01-09 04:37:28,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95347631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:28,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:28,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-01-09 04:37:28,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834532537] [2025-01-09 04:37:28,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:28,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 04:37:28,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:28,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 04:37:28,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:37:28,842 INFO L87 Difference]: Start difference. First operand 45872 states and 57568 transitions. Second operand has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:36,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:36,264 INFO L93 Difference]: Finished difference Result 111375 states and 151608 transitions. [2025-01-09 04:37:36,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-01-09 04:37:36,265 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:36,385 INFO L225 Difference]: With dead ends: 111375 [2025-01-09 04:37:36,385 INFO L226 Difference]: Without dead ends: 106718 [2025-01-09 04:37:36,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1063, Invalid=4193, Unknown=0, NotChecked=0, Total=5256 [2025-01-09 04:37:36,411 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 5914 mSDsluCounter, 14286 mSDsCounter, 0 mSdLazyCounter, 4865 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5914 SdHoareTripleChecker+Valid, 15403 SdHoareTripleChecker+Invalid, 5061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 4865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:36,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5914 Valid, 15403 Invalid, 5061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 4865 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 04:37:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106718 states. [2025-01-09 04:37:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106718 to 48158. [2025-01-09 04:37:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48158 states, 48153 states have (on average 1.2510539322575955) internal successors, (60242), 48157 states have internal predecessors, (60242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48158 states to 48158 states and 60242 transitions. [2025-01-09 04:37:37,558 INFO L78 Accepts]: Start accepts. Automaton has 48158 states and 60242 transitions. Word has length 171 [2025-01-09 04:37:37,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:37,559 INFO L471 AbstractCegarLoop]: Abstraction has 48158 states and 60242 transitions. [2025-01-09 04:37:37,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.7727272727272725) internal successors, (171), 22 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 48158 states and 60242 transitions. [2025-01-09 04:37:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:37,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:37,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:37,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:37:37,591 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:37,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:37,592 INFO L85 PathProgramCache]: Analyzing trace with hash -528527489, now seen corresponding path program 1 times [2025-01-09 04:37:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:37,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854879527] [2025-01-09 04:37:37,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:37,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:37,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:37,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:37,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:37,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:37,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854879527] [2025-01-09 04:37:37,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854879527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:37,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:37:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429477330] [2025-01-09 04:37:37,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:37,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:37:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:37,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:37:37,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:37:37,812 INFO L87 Difference]: Start difference. First operand 48158 states and 60242 transitions. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:38,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:38,054 INFO L93 Difference]: Finished difference Result 74687 states and 94708 transitions. [2025-01-09 04:37:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:37:38,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:38,088 INFO L225 Difference]: With dead ends: 74687 [2025-01-09 04:37:38,088 INFO L226 Difference]: Without dead ends: 33790 [2025-01-09 04:37:38,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:37:38,114 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 2250 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2250 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:38,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2250 Valid, 683 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:37:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33790 states. [2025-01-09 04:37:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33790 to 29380. [2025-01-09 04:37:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29380 states, 29375 states have (on average 1.229991489361702) internal successors, (36131), 29379 states have internal predecessors, (36131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29380 states to 29380 states and 36131 transitions. [2025-01-09 04:37:38,429 INFO L78 Accepts]: Start accepts. Automaton has 29380 states and 36131 transitions. Word has length 171 [2025-01-09 04:37:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:38,429 INFO L471 AbstractCegarLoop]: Abstraction has 29380 states and 36131 transitions. [2025-01-09 04:37:38,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 29380 states and 36131 transitions. [2025-01-09 04:37:38,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:38,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:38,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:38,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:37:38,448 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:38,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:38,448 INFO L85 PathProgramCache]: Analyzing trace with hash -538738303, now seen corresponding path program 1 times [2025-01-09 04:37:38,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:38,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633798362] [2025-01-09 04:37:38,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:38,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:38,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:38,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:38,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:38,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:38,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:38,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633798362] [2025-01-09 04:37:38,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633798362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:38,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:38,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 04:37:38,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136507372] [2025-01-09 04:37:38,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:38,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:37:38,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:38,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:37:38,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:37:38,974 INFO L87 Difference]: Start difference. First operand 29380 states and 36131 transitions. Second operand has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:39,828 INFO L93 Difference]: Finished difference Result 48199 states and 60276 transitions. [2025-01-09 04:37:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:37:39,828 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:39,868 INFO L225 Difference]: With dead ends: 48199 [2025-01-09 04:37:39,868 INFO L226 Difference]: Without dead ends: 44746 [2025-01-09 04:37:39,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:37:39,883 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 2578 mSDsluCounter, 5658 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2578 SdHoareTripleChecker+Valid, 6402 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:39,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2578 Valid, 6402 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:37:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44746 states. [2025-01-09 04:37:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44746 to 35492. [2025-01-09 04:37:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35492 states, 35487 states have (on average 1.2192070335615859) internal successors, (43266), 35491 states have internal predecessors, (43266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35492 states to 35492 states and 43266 transitions. [2025-01-09 04:37:40,273 INFO L78 Accepts]: Start accepts. Automaton has 35492 states and 43266 transitions. Word has length 171 [2025-01-09 04:37:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:40,274 INFO L471 AbstractCegarLoop]: Abstraction has 35492 states and 43266 transitions. [2025-01-09 04:37:40,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.153846153846153) internal successors, (171), 13 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 35492 states and 43266 transitions. [2025-01-09 04:37:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:40,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:40,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:40,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:37:40,299 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:40,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash -888234575, now seen corresponding path program 1 times [2025-01-09 04:37:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:40,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470450077] [2025-01-09 04:37:40,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:40,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:40,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:40,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:40,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:40,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:42,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:42,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:42,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470450077] [2025-01-09 04:37:42,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470450077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:42,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:42,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-01-09 04:37:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301160115] [2025-01-09 04:37:42,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:42,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 04:37:42,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:42,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 04:37:42,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:37:42,021 INFO L87 Difference]: Start difference. First operand 35492 states and 43266 transitions. Second operand has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:48,001 INFO L93 Difference]: Finished difference Result 79002 states and 104841 transitions. [2025-01-09 04:37:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-01-09 04:37:48,002 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:48,084 INFO L225 Difference]: With dead ends: 79002 [2025-01-09 04:37:48,084 INFO L226 Difference]: Without dead ends: 76599 [2025-01-09 04:37:48,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=720, Invalid=3312, Unknown=0, NotChecked=0, Total=4032 [2025-01-09 04:37:48,115 INFO L435 NwaCegarLoop]: 1372 mSDtfsCounter, 5253 mSDsluCounter, 18604 mSDsCounter, 0 mSdLazyCounter, 6144 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5253 SdHoareTripleChecker+Valid, 19976 SdHoareTripleChecker+Invalid, 6242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 6144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:48,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5253 Valid, 19976 Invalid, 6242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 6144 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-09 04:37:48,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76599 states. [2025-01-09 04:37:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76599 to 38819. [2025-01-09 04:37:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38819 states, 38814 states have (on average 1.214948214561756) internal successors, (47157), 38818 states have internal predecessors, (47157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:48,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38819 states to 38819 states and 47157 transitions. [2025-01-09 04:37:48,898 INFO L78 Accepts]: Start accepts. Automaton has 38819 states and 47157 transitions. Word has length 171 [2025-01-09 04:37:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:48,899 INFO L471 AbstractCegarLoop]: Abstraction has 38819 states and 47157 transitions. [2025-01-09 04:37:48,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 38819 states and 47157 transitions. [2025-01-09 04:37:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:48,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:48,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:48,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:37:48,927 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:48,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash 870629111, now seen corresponding path program 1 times [2025-01-09 04:37:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:48,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852557062] [2025-01-09 04:37:48,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:48,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:48,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:48,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:48,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:48,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:49,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852557062] [2025-01-09 04:37:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852557062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:49,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:49,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 04:37:49,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224945373] [2025-01-09 04:37:49,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:49,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 04:37:49,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:49,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 04:37:49,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:37:49,482 INFO L87 Difference]: Start difference. First operand 38819 states and 47157 transitions. Second operand has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:50,966 INFO L93 Difference]: Finished difference Result 58888 states and 72762 transitions. [2025-01-09 04:37:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 04:37:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:51,021 INFO L225 Difference]: With dead ends: 58888 [2025-01-09 04:37:51,022 INFO L226 Difference]: Without dead ends: 55215 [2025-01-09 04:37:51,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=1199, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 04:37:51,043 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 2977 mSDsluCounter, 8723 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2977 SdHoareTripleChecker+Valid, 9766 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:51,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2977 Valid, 9766 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 04:37:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55215 states. [2025-01-09 04:37:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55215 to 48154. [2025-01-09 04:37:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48154 states, 48149 states have (on average 1.2047809923362893) internal successors, (58009), 48153 states have internal predecessors, (58009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48154 states to 48154 states and 58009 transitions. [2025-01-09 04:37:51,633 INFO L78 Accepts]: Start accepts. Automaton has 48154 states and 58009 transitions. Word has length 171 [2025-01-09 04:37:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:51,633 INFO L471 AbstractCegarLoop]: Abstraction has 48154 states and 58009 transitions. [2025-01-09 04:37:51,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:51,633 INFO L276 IsEmpty]: Start isEmpty. Operand 48154 states and 58009 transitions. [2025-01-09 04:37:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:51,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:51,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:51,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:37:51,669 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:51,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:51,670 INFO L85 PathProgramCache]: Analyzing trace with hash -871130332, now seen corresponding path program 1 times [2025-01-09 04:37:51,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:51,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542834899] [2025-01-09 04:37:51,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:51,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:51,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:51,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:51,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:51,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:52,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:52,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542834899] [2025-01-09 04:37:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542834899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:52,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:52,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 04:37:52,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125963103] [2025-01-09 04:37:52,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:52,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 04:37:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:52,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 04:37:52,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:37:52,140 INFO L87 Difference]: Start difference. First operand 48154 states and 58009 transitions. Second operand has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:53,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:37:53,990 INFO L93 Difference]: Finished difference Result 98451 states and 123256 transitions. [2025-01-09 04:37:53,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 04:37:53,991 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2025-01-09 04:37:53,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:37:54,093 INFO L225 Difference]: With dead ends: 98451 [2025-01-09 04:37:54,093 INFO L226 Difference]: Without dead ends: 94998 [2025-01-09 04:37:54,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=445, Invalid=1277, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 04:37:54,123 INFO L435 NwaCegarLoop]: 1223 mSDtfsCounter, 3879 mSDsluCounter, 10732 mSDsCounter, 0 mSdLazyCounter, 2247 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3879 SdHoareTripleChecker+Valid, 11955 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:37:54,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3879 Valid, 11955 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2247 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:37:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94998 states. [2025-01-09 04:37:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94998 to 55704. [2025-01-09 04:37:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55704 states, 55699 states have (on average 1.1987468356702993) internal successors, (66769), 55703 states have internal predecessors, (66769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55704 states to 55704 states and 66769 transitions. [2025-01-09 04:37:55,042 INFO L78 Accepts]: Start accepts. Automaton has 55704 states and 66769 transitions. Word has length 171 [2025-01-09 04:37:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:37:55,042 INFO L471 AbstractCegarLoop]: Abstraction has 55704 states and 66769 transitions. [2025-01-09 04:37:55,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.6875) internal successors, (171), 16 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:37:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 55704 states and 66769 transitions. [2025-01-09 04:37:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 04:37:55,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:37:55,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:37:55,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:37:55,091 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 04:37:55,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:37:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1221057580, now seen corresponding path program 1 times [2025-01-09 04:37:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:37:55,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437318923] [2025-01-09 04:37:55,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:37:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:37:55,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 04:37:55,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 04:37:55,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:37:55,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:37:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:37:56,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:37:56,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437318923] [2025-01-09 04:37:56,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437318923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:37:56,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:37:56,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-01-09 04:37:56,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377576] [2025-01-09 04:37:56,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:37:56,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:37:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:37:56,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:37:56,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:37:56,513 INFO L87 Difference]: Start difference. First operand 55704 states and 66769 transitions. Second operand has 21 states, 21 states have (on average 8.142857142857142) internal successors, (171), 21 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)