./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.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/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.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 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:41:56,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:41:56,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:41:56,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:41:56,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:41:56,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:41:56,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:41:56,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:41:56,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:41:56,599 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:41:56,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:41:56,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:41:56,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:41:56,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:41:56,601 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:41:56,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:41:56,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:41:56,602 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:41:56,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:41:56,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:41:56,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:41:56,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:41:56,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:41:56,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:41:56,602 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:41:56,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:41:56,603 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:41:56,603 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:41:56,603 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:41:56,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:41:56,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:41:56,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:41:56,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:41:56,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:41:56,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:41:56,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:41:56,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:41:56,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:41:56,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:41:56,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:41:56,604 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:41:56,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:41:56,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:41:56,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:41:56,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:41:56,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:41:56,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:41:56,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:41:56,604 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 -> 6d20f8abdac11d3a14265079d0abbd72a3c88bf6607f5bf46f98ccd96bfda721 [2025-01-09 05:41:56,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:41:56,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:41:56,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:41:56,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:41:56,921 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:41:56,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2025-01-09 05:41:58,263 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9af3701e6/f030c711d142429ab5db18ec74f144bf/FLAG2e41e42b1 [2025-01-09 05:41:58,886 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:41:58,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2025-01-09 05:41:58,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9af3701e6/f030c711d142429ab5db18ec74f144bf/FLAG2e41e42b1 [2025-01-09 05:41:58,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9af3701e6/f030c711d142429ab5db18ec74f144bf [2025-01-09 05:41:58,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:41:58,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:41:58,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:41:58,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:41:58,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:41:58,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:41:58" (1/1) ... [2025-01-09 05:41:58,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bcbc386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:41:58, skipping insertion in model container [2025-01-09 05:41:58,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:41:58" (1/1) ... [2025-01-09 05:41:59,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:41:59,338 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/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2025-01-09 05:41:59,369 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/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2025-01-09 05:41:59,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:41:59,898 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:41:59,930 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/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[6354,6367] [2025-01-09 05:41:59,936 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/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c[8229,8242] [2025-01-09 05:42:00,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:42:00,298 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:42:00,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00 WrapperNode [2025-01-09 05:42:00,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:42:00,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:42:00,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:42:00,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:42:00,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:00,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:00,758 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4977 [2025-01-09 05:42:00,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:42:00,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:42:00,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:42:00,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:42:00,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:00,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:00,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:01,004 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 05:42:01,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:01,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:01,122 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:01,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:01,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:01,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:01,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:01,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:42:01,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:42:01,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:42:01,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:42:01,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (1/1) ... [2025-01-09 05:42:01,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:42:01,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:01,320 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 05:42:01,323 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 05:42:01,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:42:01,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:42:01,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:42:01,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:42:01,444 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:42:01,446 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:42:05,948 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2025-01-09 05:42:05,948 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:42:05,992 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:42:05,993 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:42:05,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:42:05 BoogieIcfgContainer [2025-01-09 05:42:05,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:42:05,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:42:05,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:42:06,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:42:06,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:41:58" (1/3) ... [2025-01-09 05:42:06,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c823ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:42:06, skipping insertion in model container [2025-01-09 05:42:06,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:42:00" (2/3) ... [2025-01-09 05:42:06,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c823ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:42:06, skipping insertion in model container [2025-01-09 05:42:06,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:42:05" (3/3) ... [2025-01-09 05:42:06,007 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c [2025-01-09 05:42:06,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:42:06,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label00.c that has 1 procedures, 871 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:42:06,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:42:06,126 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;@4c28ba76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:42:06,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:42:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 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 05:42:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 05:42:06,142 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:06,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:06,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:06,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1377582480, now seen corresponding path program 1 times [2025-01-09 05:42:06,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:06,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871552923] [2025-01-09 05:42:06,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:06,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:06,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 05:42:06,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 05:42:06,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:06,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:06,409 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 05:42:06,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:06,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871552923] [2025-01-09 05:42:06,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871552923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:06,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:06,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:42:06,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074043075] [2025-01-09 05:42:06,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:06,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:42:06,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:06,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:42:06,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:42:06,441 INFO L87 Difference]: Start difference. First operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 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 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 05:42:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:09,781 INFO L93 Difference]: Finished difference Result 2475 states and 4769 transitions. [2025-01-09 05:42:09,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:42:09,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-01-09 05:42:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:09,811 INFO L225 Difference]: With dead ends: 2475 [2025-01-09 05:42:09,811 INFO L226 Difference]: Without dead ends: 1557 [2025-01-09 05:42:09,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:42:09,826 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 969 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:09,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 245 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 05:42:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-01-09 05:42:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2025-01-09 05:42:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1555 states have (on average 1.8411575562700964) internal successors, (2863), 1556 states have internal predecessors, (2863), 0 states have call successors, (0), 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 05:42:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2863 transitions. [2025-01-09 05:42:09,951 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2863 transitions. Word has length 16 [2025-01-09 05:42:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:09,952 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2863 transitions. [2025-01-09 05:42:09,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 05:42:09,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2863 transitions. [2025-01-09 05:42:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 05:42:09,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:09,955 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] [2025-01-09 05:42:09,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:42:09,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:09,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:09,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1783576021, now seen corresponding path program 1 times [2025-01-09 05:42:09,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:09,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520276134] [2025-01-09 05:42:09,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:09,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:09,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 05:42:10,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 05:42:10,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:10,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:10,165 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 05:42:10,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:10,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520276134] [2025-01-09 05:42:10,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520276134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:10,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:10,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:42:10,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085783604] [2025-01-09 05:42:10,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:10,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:42:10,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:10,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:42:10,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:42:10,170 INFO L87 Difference]: Start difference. First operand 1557 states and 2863 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 05:42:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:10,238 INFO L93 Difference]: Finished difference Result 1621 states and 2961 transitions. [2025-01-09 05:42:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:42:10,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-01-09 05:42:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:10,246 INFO L225 Difference]: With dead ends: 1621 [2025-01-09 05:42:10,246 INFO L226 Difference]: Without dead ends: 1587 [2025-01-09 05:42:10,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:42:10,248 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 46 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:10,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 6058 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:10,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2025-01-09 05:42:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1557. [2025-01-09 05:42:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1555 states have (on average 1.8308681672025724) internal successors, (2847), 1556 states have internal predecessors, (2847), 0 states have call successors, (0), 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 05:42:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2847 transitions. [2025-01-09 05:42:10,300 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2847 transitions. Word has length 20 [2025-01-09 05:42:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:10,301 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2847 transitions. [2025-01-09 05:42:10,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 05:42:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2847 transitions. [2025-01-09 05:42:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 05:42:10,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:10,303 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] [2025-01-09 05:42:10,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:42:10,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:10,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1388544739, now seen corresponding path program 1 times [2025-01-09 05:42:10,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:10,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588518411] [2025-01-09 05:42:10,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:10,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 05:42:10,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 05:42:10,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:10,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:10,465 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 05:42:10,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:10,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588518411] [2025-01-09 05:42:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588518411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:10,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:10,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:42:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363801763] [2025-01-09 05:42:10,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:10,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:42:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:10,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:42:10,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:42:10,469 INFO L87 Difference]: Start difference. First operand 1557 states and 2847 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 05:42:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:10,579 INFO L93 Difference]: Finished difference Result 1737 states and 3129 transitions. [2025-01-09 05:42:10,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:42:10,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-01-09 05:42:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:10,588 INFO L225 Difference]: With dead ends: 1737 [2025-01-09 05:42:10,588 INFO L226 Difference]: Without dead ends: 1707 [2025-01-09 05:42:10,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:42:10,590 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:10,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 1865 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:42:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-01-09 05:42:10,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1585. [2025-01-09 05:42:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1583 states have (on average 1.8262792166771953) internal successors, (2891), 1584 states have internal predecessors, (2891), 0 states have call successors, (0), 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 05:42:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2891 transitions. [2025-01-09 05:42:10,629 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2891 transitions. Word has length 35 [2025-01-09 05:42:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:10,629 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2891 transitions. [2025-01-09 05:42:10,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 05:42:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2891 transitions. [2025-01-09 05:42:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 05:42:10,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:10,633 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] [2025-01-09 05:42:10,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:42:10,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:10,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:10,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1535930931, now seen corresponding path program 1 times [2025-01-09 05:42:10,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:10,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614926546] [2025-01-09 05:42:10,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:10,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:10,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 05:42:10,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 05:42:10,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:10,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:10,717 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 05:42:10,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:10,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614926546] [2025-01-09 05:42:10,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614926546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:10,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:10,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:42:10,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477893368] [2025-01-09 05:42:10,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:10,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:42:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:10,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:42:10,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:42:10,719 INFO L87 Difference]: Start difference. First operand 1585 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 05:42:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:10,753 INFO L93 Difference]: Finished difference Result 1690 states and 3054 transitions. [2025-01-09 05:42:10,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:42:10,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-01-09 05:42:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:10,760 INFO L225 Difference]: With dead ends: 1690 [2025-01-09 05:42:10,760 INFO L226 Difference]: Without dead ends: 1632 [2025-01-09 05:42:10,761 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 05:42:10,762 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:10,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:10,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-01-09 05:42:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2025-01-09 05:42:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.8175675675675675) internal successors, (2959), 1629 states have internal predecessors, (2959), 0 states have call successors, (0), 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 05:42:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2959 transitions. [2025-01-09 05:42:10,797 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2959 transitions. Word has length 37 [2025-01-09 05:42:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:10,798 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2959 transitions. [2025-01-09 05:42:10,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 05:42:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2959 transitions. [2025-01-09 05:42:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 05:42:10,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:10,799 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] [2025-01-09 05:42:10,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:42:10,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:10,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1602424443, now seen corresponding path program 1 times [2025-01-09 05:42:10,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:10,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172685462] [2025-01-09 05:42:10,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:10,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:10,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 05:42:10,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 05:42:10,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:10,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:11,047 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 05:42:11,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:11,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172685462] [2025-01-09 05:42:11,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172685462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:11,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:11,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:42:11,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675679438] [2025-01-09 05:42:11,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:11,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:42:11,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:11,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:42:11,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:42:11,050 INFO L87 Difference]: Start difference. First operand 1630 states and 2959 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 05:42:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:11,133 INFO L93 Difference]: Finished difference Result 1735 states and 3119 transitions. [2025-01-09 05:42:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:42:11,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-01-09 05:42:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:11,141 INFO L225 Difference]: With dead ends: 1735 [2025-01-09 05:42:11,142 INFO L226 Difference]: Without dead ends: 1632 [2025-01-09 05:42:11,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:42:11,144 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 1475 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:11,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1632 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-01-09 05:42:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1630. [2025-01-09 05:42:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1628 states have (on average 1.8163390663390664) internal successors, (2957), 1629 states have internal predecessors, (2957), 0 states have call successors, (0), 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 05:42:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2957 transitions. [2025-01-09 05:42:11,182 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2957 transitions. Word has length 37 [2025-01-09 05:42:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:11,184 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2957 transitions. [2025-01-09 05:42:11,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 05:42:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2957 transitions. [2025-01-09 05:42:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 05:42:11,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:11,185 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] [2025-01-09 05:42:11,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:42:11,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:11,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:11,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2015794251, now seen corresponding path program 1 times [2025-01-09 05:42:11,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:11,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505331744] [2025-01-09 05:42:11,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:11,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 05:42:11,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 05:42:11,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:11,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:11,384 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 05:42:11,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:11,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505331744] [2025-01-09 05:42:11,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505331744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:11,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:11,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:42:11,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707738062] [2025-01-09 05:42:11,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:11,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:42:11,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:11,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:42:11,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:42:11,386 INFO L87 Difference]: Start difference. First operand 1630 states and 2957 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 05:42:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:11,432 INFO L93 Difference]: Finished difference Result 1638 states and 2966 transitions. [2025-01-09 05:42:11,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:42:11,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-01-09 05:42:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:11,440 INFO L225 Difference]: With dead ends: 1638 [2025-01-09 05:42:11,440 INFO L226 Difference]: Without dead ends: 1636 [2025-01-09 05:42:11,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:42:11,442 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 4506 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6011 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:11,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6011 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2025-01-09 05:42:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2025-01-09 05:42:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 1.8127294981640147) internal successors, (2962), 1635 states have internal predecessors, (2962), 0 states have call successors, (0), 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 05:42:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2962 transitions. [2025-01-09 05:42:11,483 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2962 transitions. Word has length 38 [2025-01-09 05:42:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:11,483 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2962 transitions. [2025-01-09 05:42:11,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 05:42:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2962 transitions. [2025-01-09 05:42:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 05:42:11,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:11,485 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] [2025-01-09 05:42:11,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:42:11,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:11,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash -59322789, now seen corresponding path program 1 times [2025-01-09 05:42:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:11,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950226097] [2025-01-09 05:42:11,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:11,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 05:42:11,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 05:42:11,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:11,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:11,540 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 05:42:11,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:11,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950226097] [2025-01-09 05:42:11,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950226097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:11,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:11,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:42:11,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131201542] [2025-01-09 05:42:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:11,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:42:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:11,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:42:11,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:42:11,542 INFO L87 Difference]: Start difference. First operand 1636 states and 2962 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 05:42:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:11,571 INFO L93 Difference]: Finished difference Result 1758 states and 3143 transitions. [2025-01-09 05:42:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:42:11,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-01-09 05:42:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:11,577 INFO L225 Difference]: With dead ends: 1758 [2025-01-09 05:42:11,578 INFO L226 Difference]: Without dead ends: 1694 [2025-01-09 05:42:11,578 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 05:42:11,579 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1476 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:11,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2025-01-09 05:42:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1692. [2025-01-09 05:42:11,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 1.8005917159763314) internal successors, (3043), 1691 states have internal predecessors, (3043), 0 states have call successors, (0), 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 05:42:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 3043 transitions. [2025-01-09 05:42:11,615 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 3043 transitions. Word has length 39 [2025-01-09 05:42:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:11,617 INFO L471 AbstractCegarLoop]: Abstraction has 1692 states and 3043 transitions. [2025-01-09 05:42:11,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 05:42:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 3043 transitions. [2025-01-09 05:42:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 05:42:11,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:11,618 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] [2025-01-09 05:42:11,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:42:11,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:11,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:11,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2020175707, now seen corresponding path program 1 times [2025-01-09 05:42:11,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:11,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948769909] [2025-01-09 05:42:11,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:11,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:11,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 05:42:11,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 05:42:11,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:11,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:11,662 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 05:42:11,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:11,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948769909] [2025-01-09 05:42:11,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948769909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:11,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:11,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:42:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831278610] [2025-01-09 05:42:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:11,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:42:11,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:11,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:42:11,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:42:11,664 INFO L87 Difference]: Start difference. First operand 1692 states and 3043 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 05:42:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:11,693 INFO L93 Difference]: Finished difference Result 1994 states and 3483 transitions. [2025-01-09 05:42:11,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:42:11,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-01-09 05:42:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:11,701 INFO L225 Difference]: With dead ends: 1994 [2025-01-09 05:42:11,701 INFO L226 Difference]: Without dead ends: 1831 [2025-01-09 05:42:11,702 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 05:42:11,702 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:11,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-01-09 05:42:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2025-01-09 05:42:11,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1827 states have (on average 1.7706622879036673) internal successors, (3235), 1828 states have internal predecessors, (3235), 0 states have call successors, (0), 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 05:42:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 3235 transitions. [2025-01-09 05:42:11,739 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 3235 transitions. Word has length 39 [2025-01-09 05:42:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:11,739 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 3235 transitions. [2025-01-09 05:42:11,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 05:42:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 3235 transitions. [2025-01-09 05:42:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 05:42:11,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:11,740 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] [2025-01-09 05:42:11,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:42:11,740 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:11,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash -493858725, now seen corresponding path program 1 times [2025-01-09 05:42:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795096391] [2025-01-09 05:42:11,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:11,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:11,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 05:42:11,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 05:42:11,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:11,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:11,785 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 05:42:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795096391] [2025-01-09 05:42:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795096391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:11,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:42:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905827378] [2025-01-09 05:42:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:11,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:42:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:11,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:42:11,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:42:11,787 INFO L87 Difference]: Start difference. First operand 1829 states and 3235 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 05:42:11,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:11,823 INFO L93 Difference]: Finished difference Result 2381 states and 4017 transitions. [2025-01-09 05:42:11,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:42:11,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-01-09 05:42:11,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:11,831 INFO L225 Difference]: With dead ends: 2381 [2025-01-09 05:42:11,831 INFO L226 Difference]: Without dead ends: 2081 [2025-01-09 05:42:11,832 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 05:42:11,833 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1472 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:11,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:11,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2025-01-09 05:42:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 2079. [2025-01-09 05:42:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2077 states have (on average 1.719306692344728) internal successors, (3571), 2078 states have internal predecessors, (3571), 0 states have call successors, (0), 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 05:42:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3571 transitions. [2025-01-09 05:42:11,877 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3571 transitions. Word has length 39 [2025-01-09 05:42:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:11,877 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 3571 transitions. [2025-01-09 05:42:11,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 05:42:11,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3571 transitions. [2025-01-09 05:42:11,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:42:11,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:11,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:11,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:42:11,879 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:11,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1902435240, now seen corresponding path program 1 times [2025-01-09 05:42:11,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:11,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994682891] [2025-01-09 05:42:11,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:11,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:42:11,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:42:11,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:11,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:42:12,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:12,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994682891] [2025-01-09 05:42:12,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994682891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:12,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:12,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:42:12,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041024258] [2025-01-09 05:42:12,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:12,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:42:12,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:12,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:42:12,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:42:12,024 INFO L87 Difference]: Start difference. First operand 2079 states and 3571 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:12,124 INFO L93 Difference]: Finished difference Result 3711 states and 5847 transitions. [2025-01-09 05:42:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:42:12,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 05:42:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:12,137 INFO L225 Difference]: With dead ends: 3711 [2025-01-09 05:42:12,138 INFO L226 Difference]: Without dead ends: 3309 [2025-01-09 05:42:12,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:42:12,140 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3039 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:12,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3160 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2025-01-09 05:42:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 2555. [2025-01-09 05:42:12,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2553 states have (on average 1.6556991774383079) internal successors, (4227), 2554 states have internal predecessors, (4227), 0 states have call successors, (0), 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 05:42:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4227 transitions. [2025-01-09 05:42:12,287 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4227 transitions. Word has length 54 [2025-01-09 05:42:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:12,287 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 4227 transitions. [2025-01-09 05:42:12,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4227 transitions. [2025-01-09 05:42:12,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:42:12,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:12,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:12,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:42:12,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:12,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:12,290 INFO L85 PathProgramCache]: Analyzing trace with hash -313033560, now seen corresponding path program 1 times [2025-01-09 05:42:12,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:12,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089564614] [2025-01-09 05:42:12,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:12,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:12,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:42:12,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:42:12,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:12,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:42:12,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:12,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089564614] [2025-01-09 05:42:12,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089564614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:12,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:12,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:42:12,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330856282] [2025-01-09 05:42:12,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:12,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:42:12,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:12,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:42:12,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:42:12,534 INFO L87 Difference]: Start difference. First operand 2555 states and 4227 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:12,715 INFO L93 Difference]: Finished difference Result 4259 states and 6607 transitions. [2025-01-09 05:42:12,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:42:12,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 05:42:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:12,735 INFO L225 Difference]: With dead ends: 4259 [2025-01-09 05:42:12,739 INFO L226 Difference]: Without dead ends: 3709 [2025-01-09 05:42:12,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:42:12,741 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 3039 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3157 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:12,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3157 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:42:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2025-01-09 05:42:12,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3303. [2025-01-09 05:42:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3303 states, 3301 states have (on average 1.5919418358073312) internal successors, (5255), 3302 states have internal predecessors, (5255), 0 states have call successors, (0), 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 05:42:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 5255 transitions. [2025-01-09 05:42:12,829 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 5255 transitions. Word has length 54 [2025-01-09 05:42:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:12,829 INFO L471 AbstractCegarLoop]: Abstraction has 3303 states and 5255 transitions. [2025-01-09 05:42:12,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 5255 transitions. [2025-01-09 05:42:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 05:42:12,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:12,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:12,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:42:12,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:12,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1467899304, now seen corresponding path program 1 times [2025-01-09 05:42:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:12,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190545974] [2025-01-09 05:42:12,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:12,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 05:42:12,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 05:42:12,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:12,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:42:12,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:12,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190545974] [2025-01-09 05:42:12,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190545974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:12,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:12,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:42:12,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29404669] [2025-01-09 05:42:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:12,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:42:12,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:12,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:42:12,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:42:12,939 INFO L87 Difference]: Start difference. First operand 3303 states and 5255 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:13,058 INFO L93 Difference]: Finished difference Result 4807 states and 7363 transitions. [2025-01-09 05:42:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:42:13,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 05:42:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:13,073 INFO L225 Difference]: With dead ends: 4807 [2025-01-09 05:42:13,076 INFO L226 Difference]: Without dead ends: 4257 [2025-01-09 05:42:13,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:42:13,079 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3047 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:13,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3153 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2025-01-09 05:42:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 3851. [2025-01-09 05:42:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.561704338789296) internal successors, (6011), 3850 states have internal predecessors, (6011), 0 states have call successors, (0), 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 05:42:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 6011 transitions. [2025-01-09 05:42:13,187 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 6011 transitions. Word has length 54 [2025-01-09 05:42:13,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:13,187 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 6011 transitions. [2025-01-09 05:42:13,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 6011 transitions. [2025-01-09 05:42:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 05:42:13,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:13,188 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:13,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:42:13,189 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:13,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:13,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1162895185, now seen corresponding path program 1 times [2025-01-09 05:42:13,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:13,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993296796] [2025-01-09 05:42:13,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:13,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:13,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 05:42:13,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 05:42:13,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:13,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:13,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:13,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993296796] [2025-01-09 05:42:13,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993296796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:13,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:13,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:42:13,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510805455] [2025-01-09 05:42:13,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:13,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:42:13,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:13,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:42:13,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:42:13,309 INFO L87 Difference]: Start difference. First operand 3851 states and 6011 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:13,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:13,371 INFO L93 Difference]: Finished difference Result 6175 states and 9221 transitions. [2025-01-09 05:42:13,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:42:13,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-09 05:42:13,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:13,380 INFO L225 Difference]: With dead ends: 6175 [2025-01-09 05:42:13,380 INFO L226 Difference]: Without dead ends: 3853 [2025-01-09 05:42:13,383 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 05:42:13,384 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 29 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3022 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 05:42:13,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2025-01-09 05:42:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3851. [2025-01-09 05:42:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3849 states have (on average 1.54871395167576) internal successors, (5961), 3850 states have internal predecessors, (5961), 0 states have call successors, (0), 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 05:42:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 5961 transitions. [2025-01-09 05:42:13,478 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 5961 transitions. Word has length 55 [2025-01-09 05:42:13,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:13,478 INFO L471 AbstractCegarLoop]: Abstraction has 3851 states and 5961 transitions. [2025-01-09 05:42:13,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:13,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 5961 transitions. [2025-01-09 05:42:13,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 05:42:13,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:13,481 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:13,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:42:13,482 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:13,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:13,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1526748416, now seen corresponding path program 1 times [2025-01-09 05:42:13,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:13,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397979014] [2025-01-09 05:42:13,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:13,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:13,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 05:42:13,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 05:42:13,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:13,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:13,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397979014] [2025-01-09 05:42:13,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397979014] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:13,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:13,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:42:13,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672740579] [2025-01-09 05:42:13,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:13,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:42:13,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:13,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:42:13,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:42:13,564 INFO L87 Difference]: Start difference. First operand 3851 states and 5961 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:13,603 INFO L93 Difference]: Finished difference Result 4770 states and 7221 transitions. [2025-01-09 05:42:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:42:13,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-01-09 05:42:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:13,609 INFO L225 Difference]: With dead ends: 4770 [2025-01-09 05:42:13,609 INFO L226 Difference]: Without dead ends: 2448 [2025-01-09 05:42:13,611 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 05:42:13,612 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 23 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3019 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 05:42:13,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2025-01-09 05:42:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2440. [2025-01-09 05:42:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.6554552912223133) internal successors, (4036), 2439 states have internal predecessors, (4036), 0 states have call successors, (0), 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 05:42:13,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 4036 transitions. [2025-01-09 05:42:13,663 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 4036 transitions. Word has length 56 [2025-01-09 05:42:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:13,663 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 4036 transitions. [2025-01-09 05:42:13,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 4036 transitions. [2025-01-09 05:42:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 05:42:13,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:13,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:13,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:42:13,665 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:13,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:13,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1693676737, now seen corresponding path program 1 times [2025-01-09 05:42:13,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:13,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23390225] [2025-01-09 05:42:13,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:13,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:13,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 05:42:13,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 05:42:13,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:13,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:13,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:13,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23390225] [2025-01-09 05:42:13,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23390225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:42:13,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:42:13,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:42:13,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383369206] [2025-01-09 05:42:13,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:42:13,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:42:13,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:13,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:42:13,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:42:13,750 INFO L87 Difference]: Start difference. First operand 2440 states and 4036 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:13,777 INFO L93 Difference]: Finished difference Result 2894 states and 4650 transitions. [2025-01-09 05:42:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:42:13,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 05:42:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:13,782 INFO L225 Difference]: With dead ends: 2894 [2025-01-09 05:42:13,782 INFO L226 Difference]: Without dead ends: 1992 [2025-01-09 05:42:13,784 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 05:42:13,785 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 25 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2998 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 05:42:13,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2998 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2025-01-09 05:42:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1990. [2025-01-09 05:42:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1988 states have (on average 1.7178068410462777) internal successors, (3415), 1989 states have internal predecessors, (3415), 0 states have call successors, (0), 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 05:42:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3415 transitions. [2025-01-09 05:42:13,820 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3415 transitions. Word has length 57 [2025-01-09 05:42:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:13,820 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 3415 transitions. [2025-01-09 05:42:13,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:42:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3415 transitions. [2025-01-09 05:42:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 05:42:13,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:13,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:13,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:42:13,824 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:13,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:13,824 INFO L85 PathProgramCache]: Analyzing trace with hash 443483987, now seen corresponding path program 1 times [2025-01-09 05:42:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852811118] [2025-01-09 05:42:13,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:13,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:13,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 05:42:13,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 05:42:13,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:13,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:42:13,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852811118] [2025-01-09 05:42:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852811118] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:42:13,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527737934] [2025-01-09 05:42:13,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:13,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:13,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:13,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:42:13,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:42:14,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 05:42:14,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 05:42:14,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:14,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:14,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 05:42:14,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:42:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:42:14,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:42:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:42:14,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527737934] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:42:14,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:42:14,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 10 [2025-01-09 05:42:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507092549] [2025-01-09 05:42:14,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:42:14,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 05:42:14,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:14,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 05:42:14,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:42:14,540 INFO L87 Difference]: Start difference. First operand 1990 states and 3415 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 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 05:42:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:14,642 INFO L93 Difference]: Finished difference Result 3052 states and 4809 transitions. [2025-01-09 05:42:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:42:14,643 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-01-09 05:42:14,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:14,648 INFO L225 Difference]: With dead ends: 3052 [2025-01-09 05:42:14,648 INFO L226 Difference]: Without dead ends: 2600 [2025-01-09 05:42:14,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 05:42:14,650 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 4426 mSDsluCounter, 4569 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4426 SdHoareTripleChecker+Valid, 6085 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:14,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4426 Valid, 6085 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:42:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2025-01-09 05:42:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2545. [2025-01-09 05:42:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2543 states have (on average 1.610696028313016) internal successors, (4096), 2544 states have internal predecessors, (4096), 0 states have call successors, (0), 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 05:42:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4096 transitions. [2025-01-09 05:42:14,703 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4096 transitions. Word has length 59 [2025-01-09 05:42:14,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:14,704 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4096 transitions. [2025-01-09 05:42:14,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 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 05:42:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4096 transitions. [2025-01-09 05:42:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 05:42:14,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:14,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:14,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:42:14,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 05:42:14,907 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:14,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2095001564, now seen corresponding path program 1 times [2025-01-09 05:42:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:14,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149125197] [2025-01-09 05:42:14,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:14,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:14,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:42:14,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:42:14,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:14,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:15,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:15,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149125197] [2025-01-09 05:42:15,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149125197] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:42:15,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872302879] [2025-01-09 05:42:15,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:15,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:15,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:15,605 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:42:15,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 05:42:15,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:42:15,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:42:15,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:15,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:15,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:42:15,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:42:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:16,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:42:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:16,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872302879] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:42:16,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:42:16,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 05:42:16,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035421125] [2025-01-09 05:42:16,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:42:16,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 05:42:16,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:16,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 05:42:16,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2025-01-09 05:42:16,800 INFO L87 Difference]: Start difference. First operand 2545 states and 4096 transitions. Second operand has 25 states, 25 states have (on average 5.92) internal successors, (148), 24 states have internal predecessors, (148), 0 states have call successors, (0), 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 05:42:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:18,881 INFO L93 Difference]: Finished difference Result 7578 states and 10534 transitions. [2025-01-09 05:42:18,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-01-09 05:42:18,881 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.92) internal successors, (148), 24 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-09 05:42:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:18,895 INFO L225 Difference]: With dead ends: 7578 [2025-01-09 05:42:18,895 INFO L226 Difference]: Without dead ends: 6592 [2025-01-09 05:42:18,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=791, Invalid=3115, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 05:42:18,902 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 23673 mSDsluCounter, 6434 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23673 SdHoareTripleChecker+Valid, 7934 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:18,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23673 Valid, 7934 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:42:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2025-01-09 05:42:19,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 5254. [2025-01-09 05:42:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5254 states, 5252 states have (on average 1.416031987814166) internal successors, (7437), 5253 states have internal predecessors, (7437), 0 states have call successors, (0), 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 05:42:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 7437 transitions. [2025-01-09 05:42:19,114 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 7437 transitions. Word has length 60 [2025-01-09 05:42:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:19,114 INFO L471 AbstractCegarLoop]: Abstraction has 5254 states and 7437 transitions. [2025-01-09 05:42:19,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.92) internal successors, (148), 24 states have internal predecessors, (148), 0 states have call successors, (0), 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 05:42:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 7437 transitions. [2025-01-09 05:42:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 05:42:19,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:19,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:19,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 05:42:19,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 05:42:19,320 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:19,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1302032206, now seen corresponding path program 1 times [2025-01-09 05:42:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:19,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457716738] [2025-01-09 05:42:19,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:19,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:42:19,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:42:19,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:19,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:19,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:19,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457716738] [2025-01-09 05:42:19,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457716738] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:42:19,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162573145] [2025-01-09 05:42:19,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:19,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:19,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:19,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:42:19,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:42:19,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:42:19,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:42:19,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:19,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:19,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 05:42:19,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:42:20,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:20,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:42:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162573145] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:42:21,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:42:21,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-01-09 05:42:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722406548] [2025-01-09 05:42:21,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:42:21,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 05:42:21,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:21,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 05:42:21,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2025-01-09 05:42:21,394 INFO L87 Difference]: Start difference. First operand 5254 states and 7437 transitions. Second operand has 32 states, 32 states have (on average 5.0) internal successors, (160), 32 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 05:42:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:24,016 INFO L93 Difference]: Finished difference Result 14647 states and 19251 transitions. [2025-01-09 05:42:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 05:42:24,016 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.0) internal successors, (160), 32 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 60 [2025-01-09 05:42:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:24,042 INFO L225 Difference]: With dead ends: 14647 [2025-01-09 05:42:24,042 INFO L226 Difference]: Without dead ends: 11347 [2025-01-09 05:42:24,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=939, Invalid=4173, Unknown=0, NotChecked=0, Total=5112 [2025-01-09 05:42:24,050 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 22858 mSDsluCounter, 10664 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22858 SdHoareTripleChecker+Valid, 12157 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:24,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22858 Valid, 12157 Invalid, 771 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:42:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11347 states. [2025-01-09 05:42:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11347 to 5816. [2025-01-09 05:42:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5816 states, 5814 states have (on average 1.387512899896801) internal successors, (8067), 5815 states have internal predecessors, (8067), 0 states have call successors, (0), 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 05:42:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5816 states to 5816 states and 8067 transitions. [2025-01-09 05:42:24,312 INFO L78 Accepts]: Start accepts. Automaton has 5816 states and 8067 transitions. Word has length 60 [2025-01-09 05:42:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:24,312 INFO L471 AbstractCegarLoop]: Abstraction has 5816 states and 8067 transitions. [2025-01-09 05:42:24,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.0) internal successors, (160), 32 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 05:42:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 5816 states and 8067 transitions. [2025-01-09 05:42:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 05:42:24,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:24,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:24,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:42:24,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:24,518 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:24,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash 939461905, now seen corresponding path program 1 times [2025-01-09 05:42:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:24,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455640884] [2025-01-09 05:42:24,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:24,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 05:42:24,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 05:42:24,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:24,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:26,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455640884] [2025-01-09 05:42:26,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455640884] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:42:26,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803806917] [2025-01-09 05:42:26,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:26,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:26,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:26,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:42:26,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:42:26,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 05:42:26,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 05:42:26,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:26,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:26,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 05:42:26,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:42:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:28,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:42:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:30,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803806917] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:42:30,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:42:30,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 18] total 54 [2025-01-09 05:42:30,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756509274] [2025-01-09 05:42:30,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:42:30,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 05:42:30,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:30,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 05:42:30,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2561, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 05:42:30,606 INFO L87 Difference]: Start difference. First operand 5816 states and 8067 transitions. Second operand has 54 states, 54 states have (on average 3.074074074074074) internal successors, (166), 54 states have internal predecessors, (166), 0 states have call successors, (0), 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 05:42:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:42:52,963 INFO L93 Difference]: Finished difference Result 14846 states and 19216 transitions. [2025-01-09 05:42:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-01-09 05:42:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 3.074074074074074) internal successors, (166), 54 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 05:42:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:42:53,024 INFO L225 Difference]: With dead ends: 14846 [2025-01-09 05:42:53,024 INFO L226 Difference]: Without dead ends: 11795 [2025-01-09 05:42:53,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7266 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=4484, Invalid=20638, Unknown=0, NotChecked=0, Total=25122 [2025-01-09 05:42:53,048 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 27702 mSDsluCounter, 19221 mSDsCounter, 0 mSdLazyCounter, 2657 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27702 SdHoareTripleChecker+Valid, 20744 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:42:53,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27702 Valid, 20744 Invalid, 2767 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [110 Valid, 2657 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 05:42:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11795 states. [2025-01-09 05:42:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11795 to 7619. [2025-01-09 05:42:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7619 states, 7617 states have (on average 1.3471182880399106) internal successors, (10261), 7618 states have internal predecessors, (10261), 0 states have call successors, (0), 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 05:42:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7619 states to 7619 states and 10261 transitions. [2025-01-09 05:42:53,463 INFO L78 Accepts]: Start accepts. Automaton has 7619 states and 10261 transitions. Word has length 61 [2025-01-09 05:42:53,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:42:53,463 INFO L471 AbstractCegarLoop]: Abstraction has 7619 states and 10261 transitions. [2025-01-09 05:42:53,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 3.074074074074074) internal successors, (166), 54 states have internal predecessors, (166), 0 states have call successors, (0), 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 05:42:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 7619 states and 10261 transitions. [2025-01-09 05:42:53,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 05:42:53,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:42:53,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:42:53,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 05:42:53,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:53,665 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:42:53,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:42:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash 710174987, now seen corresponding path program 1 times [2025-01-09 05:42:53,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:42:53,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441674041] [2025-01-09 05:42:53,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:53,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:42:53,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 05:42:53,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 05:42:53,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:53,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:55,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:42:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441674041] [2025-01-09 05:42:55,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441674041] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:42:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924760294] [2025-01-09 05:42:55,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:42:55,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:42:55,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:42:55,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:42:55,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:42:55,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 05:42:55,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 05:42:55,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:42:55,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:42:55,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 05:42:55,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:42:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:57,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:42:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:42:59,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924760294] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:42:59,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:42:59,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 21] total 59 [2025-01-09 05:42:59,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899052121] [2025-01-09 05:42:59,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:42:59,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-01-09 05:42:59,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:42:59,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-01-09 05:42:59,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=3051, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 05:42:59,941 INFO L87 Difference]: Start difference. First operand 7619 states and 10261 transitions. Second operand has 59 states, 59 states have (on average 2.7966101694915255) internal successors, (165), 59 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)