./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label02.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.6.ufo.BOUNDED-12.pals+Problem12_label02.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 1453ce65a083ed4648e89d203499c9b326168da5d5976c2f3d65b9d62166ef3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:53:56,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:53:56,415 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:53:56,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:53:56,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:53:56,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:53:56,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:53:56,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:53:56,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:53:56,462 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:53:56,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:53:56,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:53:56,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:53:56,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:53:56,463 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:53:56,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:53:56,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:53:56,463 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:53:56,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:53:56,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:53:56,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:53:56,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:53:56,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:53:56,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:53:56,464 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:53:56,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:53:56,464 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:53:56,464 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:53:56,464 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:53:56,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:53:56,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:53:56,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:53:56,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:53:56,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:53:56,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:53:56,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:53:56,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:53:56,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:53:56,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:53:56,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:53:56,466 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:53:56,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:53:56,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:53:56,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:53:56,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:53:56,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:53:56,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:53:56,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:53:56,467 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 -> 1453ce65a083ed4648e89d203499c9b326168da5d5976c2f3d65b9d62166ef3b [2025-01-09 05:53:56,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:53:56,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:53:56,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:53:56,771 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:53:56,772 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:53:56,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label02.c [2025-01-09 05:53:58,065 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b4368e13/24b3699c35614b34b928e704dceea375/FLAG207072849 [2025-01-09 05:53:58,663 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:53:58,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label02.c [2025-01-09 05:53:58,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b4368e13/24b3699c35614b34b928e704dceea375/FLAG207072849 [2025-01-09 05:53:58,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b4368e13/24b3699c35614b34b928e704dceea375 [2025-01-09 05:53:58,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:53:58,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:53:58,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:53:58,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:53:58,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:53:58,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:53:58" (1/1) ... [2025-01-09 05:53:58,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bab302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:58, skipping insertion in model container [2025-01-09 05:53:58,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:53:58" (1/1) ... [2025-01-09 05:53:58,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:53:59,235 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.6.ufo.BOUNDED-12.pals+Problem12_label02.c[15482,15495] [2025-01-09 05:53:59,316 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.6.ufo.BOUNDED-12.pals+Problem12_label02.c[22772,22785] [2025-01-09 05:53:59,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:53:59,867 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:53:59,894 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.6.ufo.BOUNDED-12.pals+Problem12_label02.c[15482,15495] [2025-01-09 05:53:59,904 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.6.ufo.BOUNDED-12.pals+Problem12_label02.c[22772,22785] [2025-01-09 05:54:00,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:54:00,268 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:54:00,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00 WrapperNode [2025-01-09 05:54:00,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:54:00,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:54:00,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:54:00,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:54:00,277 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:54:00" (1/1) ... [2025-01-09 05:54:00,334 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:54:00" (1/1) ... [2025-01-09 05:54:00,761 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5153 [2025-01-09 05:54:00,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:54:00,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:54:00,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:54:00,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:54:00,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (1/1) ... [2025-01-09 05:54:00,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (1/1) ... [2025-01-09 05:54:00,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (1/1) ... [2025-01-09 05:54:00,989 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:54:00,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (1/1) ... [2025-01-09 05:54:00,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (1/1) ... [2025-01-09 05:54:01,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (1/1) ... [2025-01-09 05:54:01,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (1/1) ... [2025-01-09 05:54:01,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (1/1) ... [2025-01-09 05:54:01,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (1/1) ... [2025-01-09 05:54:01,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (1/1) ... [2025-01-09 05:54:01,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:54:01,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:54:01,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:54:01,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:54:01,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (1/1) ... [2025-01-09 05:54:01,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:54:01,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:01,452 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:54:01,459 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:54:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:54:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:54:01,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:54:01,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:54:01,610 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:54:01,611 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:54:06,434 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-01-09 05:54:06,435 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:54:06,474 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:54:06,475 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:54:06,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:54:06 BoogieIcfgContainer [2025-01-09 05:54:06,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:54:06,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:54:06,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:54:06,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:54:06,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:53:58" (1/3) ... [2025-01-09 05:54:06,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f2c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:54:06, skipping insertion in model container [2025-01-09 05:54:06,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:00" (2/3) ... [2025-01-09 05:54:06,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f2c7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:54:06, skipping insertion in model container [2025-01-09 05:54:06,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:54:06" (3/3) ... [2025-01-09 05:54:06,486 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label02.c [2025-01-09 05:54:06,500 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:54:06,505 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label02.c that has 1 procedures, 913 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:54:06,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:54:06,608 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;@50d32bea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:54:06,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:54:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 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:54:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:54:06,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:06,626 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] [2025-01-09 05:54:06,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:06,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash 778313314, now seen corresponding path program 1 times [2025-01-09 05:54:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:06,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875206125] [2025-01-09 05:54:06,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:06,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:54:06,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:54:06,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:06,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:06,974 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:54:06,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:06,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875206125] [2025-01-09 05:54:06,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875206125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:06,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:06,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:54:06,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633369368] [2025-01-09 05:54:06,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:06,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:54:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:06,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:54:07,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:54:07,004 INFO L87 Difference]: Start difference. First operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 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 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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:54:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:07,097 INFO L93 Difference]: Finished difference Result 1780 states and 3376 transitions. [2025-01-09 05:54:07,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:54:07,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-09 05:54:07,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:07,124 INFO L225 Difference]: With dead ends: 1780 [2025-01-09 05:54:07,125 INFO L226 Difference]: Without dead ends: 848 [2025-01-09 05:54:07,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:54:07,135 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:07,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-01-09 05:54:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-01-09 05:54:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 846 states have (on average 1.8936170212765957) internal successors, (1602), 847 states have internal predecessors, (1602), 0 states have call successors, (0), 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:54:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1602 transitions. [2025-01-09 05:54:07,233 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1602 transitions. Word has length 26 [2025-01-09 05:54:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:07,233 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1602 transitions. [2025-01-09 05:54:07,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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:54:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1602 transitions. [2025-01-09 05:54:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:54:07,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:07,237 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] [2025-01-09 05:54:07,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:54:07,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:07,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:07,239 INFO L85 PathProgramCache]: Analyzing trace with hash -39335136, now seen corresponding path program 1 times [2025-01-09 05:54:07,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:07,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802749432] [2025-01-09 05:54:07,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:07,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:07,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:54:07,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:54:07,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:07,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:07,499 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:54:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:07,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802749432] [2025-01-09 05:54:07,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802749432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:07,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:07,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:54:07,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979333067] [2025-01-09 05:54:07,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:07,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:54:07,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:07,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:54:07,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:54:07,504 INFO L87 Difference]: Start difference. First operand 848 states and 1602 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:54:07,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:07,648 INFO L93 Difference]: Finished difference Result 900 states and 1683 transitions. [2025-01-09 05:54:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:54:07,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-09 05:54:07,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:07,653 INFO L225 Difference]: With dead ends: 900 [2025-01-09 05:54:07,654 INFO L226 Difference]: Without dead ends: 848 [2025-01-09 05:54:07,654 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:54:07,655 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6355 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:07,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6355 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2025-01-09 05:54:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2025-01-09 05:54:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 846 states have (on average 1.846335697399527) internal successors, (1562), 847 states have internal predecessors, (1562), 0 states have call successors, (0), 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:54:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1562 transitions. [2025-01-09 05:54:07,689 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1562 transitions. Word has length 26 [2025-01-09 05:54:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:07,689 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1562 transitions. [2025-01-09 05:54:07,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:54:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1562 transitions. [2025-01-09 05:54:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 05:54:07,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:07,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:07,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:54:07,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:07,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2009982803, now seen corresponding path program 1 times [2025-01-09 05:54:07,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:07,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88850823] [2025-01-09 05:54:07,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:07,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:07,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 05:54:07,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 05:54:07,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:07,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:07,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:07,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88850823] [2025-01-09 05:54:07,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88850823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:07,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:07,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:07,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114674500] [2025-01-09 05:54:07,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:07,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:54:07,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:07,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:54:07,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:54:07,976 INFO L87 Difference]: Start difference. First operand 848 states and 1562 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:14,296 INFO L93 Difference]: Finished difference Result 3103 states and 5871 transitions. [2025-01-09 05:54:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:54:14,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 05:54:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:14,310 INFO L225 Difference]: With dead ends: 3103 [2025-01-09 05:54:14,310 INFO L226 Difference]: Without dead ends: 2350 [2025-01-09 05:54:14,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:54:14,313 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 2433 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2433 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:14,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2433 Valid, 816 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-01-09 05:54:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2025-01-09 05:54:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2025-01-09 05:54:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2348 states have (on average 1.565587734241908) internal successors, (3676), 2349 states have internal predecessors, (3676), 0 states have call successors, (0), 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:54:14,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3676 transitions. [2025-01-09 05:54:14,381 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3676 transitions. Word has length 63 [2025-01-09 05:54:14,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:14,381 INFO L471 AbstractCegarLoop]: Abstraction has 2350 states and 3676 transitions. [2025-01-09 05:54:14,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3676 transitions. [2025-01-09 05:54:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:54:14,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:14,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:14,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:54:14,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:14,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1783115668, now seen corresponding path program 1 times [2025-01-09 05:54:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409031581] [2025-01-09 05:54:14,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:14,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:14,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:54:14,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:54:14,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:14,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:14,641 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:54:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:14,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409031581] [2025-01-09 05:54:14,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409031581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:14,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:14,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928575532] [2025-01-09 05:54:14,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:14,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:14,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:14,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:14,644 INFO L87 Difference]: Start difference. First operand 2350 states and 3676 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:14,975 INFO L93 Difference]: Finished difference Result 2926 states and 4600 transitions. [2025-01-09 05:54:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:54:14,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:54:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:14,989 INFO L225 Difference]: With dead ends: 2926 [2025-01-09 05:54:14,989 INFO L226 Difference]: Without dead ends: 2878 [2025-01-09 05:54:14,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-01-09 05:54:14,992 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 9697 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9697 SdHoareTripleChecker+Valid, 3935 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:14,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9697 Valid, 3935 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2025-01-09 05:54:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2396. [2025-01-09 05:54:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2394 states have (on average 1.5664160401002507) internal successors, (3750), 2395 states have internal predecessors, (3750), 0 states have call successors, (0), 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:54:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3750 transitions. [2025-01-09 05:54:15,056 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3750 transitions. Word has length 65 [2025-01-09 05:54:15,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:15,057 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3750 transitions. [2025-01-09 05:54:15,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3750 transitions. [2025-01-09 05:54:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:54:15,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:15,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:15,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:54:15,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:15,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:15,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1297900228, now seen corresponding path program 1 times [2025-01-09 05:54:15,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:15,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143334266] [2025-01-09 05:54:15,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:15,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:15,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:54:15,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:54:15,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:15,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:15,189 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:54:15,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:15,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143334266] [2025-01-09 05:54:15,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143334266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:15,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:15,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:15,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621714684] [2025-01-09 05:54:15,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:15,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:15,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:15,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:15,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:15,192 INFO L87 Difference]: Start difference. First operand 2396 states and 3750 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:15,228 INFO L93 Difference]: Finished difference Result 2573 states and 4033 transitions. [2025-01-09 05:54:15,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:15,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:54:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:15,239 INFO L225 Difference]: With dead ends: 2573 [2025-01-09 05:54:15,239 INFO L226 Difference]: Without dead ends: 2479 [2025-01-09 05:54:15,241 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:54:15,242 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1632 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:54:15,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1632 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2025-01-09 05:54:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2477. [2025-01-09 05:54:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.566868686868687) internal successors, (3878), 2476 states have internal predecessors, (3878), 0 states have call successors, (0), 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:54:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3878 transitions. [2025-01-09 05:54:15,309 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3878 transitions. Word has length 67 [2025-01-09 05:54:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:15,310 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3878 transitions. [2025-01-09 05:54:15,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3878 transitions. [2025-01-09 05:54:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:54:15,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:15,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:15,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:54:15,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:15,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1231406716, now seen corresponding path program 1 times [2025-01-09 05:54:15,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:15,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75801463] [2025-01-09 05:54:15,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:15,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:54:15,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:54:15,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:15,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:15,745 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:54:15,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:15,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75801463] [2025-01-09 05:54:15,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75801463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:15,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:15,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:15,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941438602] [2025-01-09 05:54:15,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:15,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:15,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:15,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:15,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:15,747 INFO L87 Difference]: Start difference. First operand 2477 states and 3878 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:15,983 INFO L93 Difference]: Finished difference Result 2654 states and 4158 transitions. [2025-01-09 05:54:15,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:15,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:54:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:15,996 INFO L225 Difference]: With dead ends: 2654 [2025-01-09 05:54:15,996 INFO L226 Difference]: Without dead ends: 2479 [2025-01-09 05:54:16,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 05:54:16,000 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 6008 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6008 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:16,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6008 Valid, 1928 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2025-01-09 05:54:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2477. [2025-01-09 05:54:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.5660606060606062) internal successors, (3876), 2476 states have internal predecessors, (3876), 0 states have call successors, (0), 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:54:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3876 transitions. [2025-01-09 05:54:16,063 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3876 transitions. Word has length 67 [2025-01-09 05:54:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:16,063 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3876 transitions. [2025-01-09 05:54:16,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3876 transitions. [2025-01-09 05:54:16,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:54:16,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:16,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:16,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:54:16,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:16,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash 66374464, now seen corresponding path program 1 times [2025-01-09 05:54:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683022107] [2025-01-09 05:54:16,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:16,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:54:16,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:54:16,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:16,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:16,322 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:54:16,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:16,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683022107] [2025-01-09 05:54:16,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683022107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:16,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:16,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:54:16,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871402464] [2025-01-09 05:54:16,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:16,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:54:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:16,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:54:16,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:54:16,324 INFO L87 Difference]: Start difference. First operand 2477 states and 3876 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:16,363 INFO L93 Difference]: Finished difference Result 2485 states and 3885 transitions. [2025-01-09 05:54:16,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:54:16,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 05:54:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:16,374 INFO L225 Difference]: With dead ends: 2485 [2025-01-09 05:54:16,374 INFO L226 Difference]: Without dead ends: 2483 [2025-01-09 05:54:16,376 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:54:16,376 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 0 mSDsluCounter, 4668 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6227 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:54:16,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6227 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2025-01-09 05:54:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 2483. [2025-01-09 05:54:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.5642885933091495) internal successors, (3881), 2482 states have internal predecessors, (3881), 0 states have call successors, (0), 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:54:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3881 transitions. [2025-01-09 05:54:16,437 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3881 transitions. Word has length 68 [2025-01-09 05:54:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:16,437 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3881 transitions. [2025-01-09 05:54:16,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3881 transitions. [2025-01-09 05:54:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:16,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:16,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:16,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:54:16,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:16,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:16,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2026826780, now seen corresponding path program 1 times [2025-01-09 05:54:16,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:16,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926372760] [2025-01-09 05:54:16,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:16,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:16,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:16,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:16,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:16,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:16,534 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:54:16,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:16,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926372760] [2025-01-09 05:54:16,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926372760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:16,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:16,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:16,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208854911] [2025-01-09 05:54:16,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:16,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:16,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:16,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:16,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:16,536 INFO L87 Difference]: Start difference. First operand 2483 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:16,601 INFO L93 Difference]: Finished difference Result 2677 states and 4182 transitions. [2025-01-09 05:54:16,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:16,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:54:16,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:16,612 INFO L225 Difference]: With dead ends: 2677 [2025-01-09 05:54:16,612 INFO L226 Difference]: Without dead ends: 2577 [2025-01-09 05:54:16,613 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:54:16,614 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1506 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1702 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:54:16,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2025-01-09 05:54:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2575. [2025-01-09 05:54:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2575 states, 2573 states have (on average 1.5631558492032647) internal successors, (4022), 2574 states have internal predecessors, (4022), 0 states have call successors, (0), 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:54:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 4022 transitions. [2025-01-09 05:54:16,678 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 4022 transitions. Word has length 69 [2025-01-09 05:54:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:16,679 INFO L471 AbstractCegarLoop]: Abstraction has 2575 states and 4022 transitions. [2025-01-09 05:54:16,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 4022 transitions. [2025-01-09 05:54:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:16,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:16,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:16,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:54:16,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:16,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1863912220, now seen corresponding path program 1 times [2025-01-09 05:54:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:16,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271146717] [2025-01-09 05:54:16,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:16,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:16,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:16,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:16,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:16,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:16,743 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:54:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271146717] [2025-01-09 05:54:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271146717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771411201] [2025-01-09 05:54:16,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:16,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:16,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:16,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:16,745 INFO L87 Difference]: Start difference. First operand 2575 states and 4022 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:16,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:16,776 INFO L93 Difference]: Finished difference Result 3093 states and 4822 transitions. [2025-01-09 05:54:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:54:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:16,788 INFO L225 Difference]: With dead ends: 3093 [2025-01-09 05:54:16,788 INFO L226 Difference]: Without dead ends: 2822 [2025-01-09 05:54:16,790 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:54:16,791 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 1504 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1708 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:54:16,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2025-01-09 05:54:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2820. [2025-01-09 05:54:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2818 states have (on average 1.5592618878637332) internal successors, (4394), 2819 states have internal predecessors, (4394), 0 states have call successors, (0), 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:54:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 4394 transitions. [2025-01-09 05:54:16,852 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 4394 transitions. Word has length 69 [2025-01-09 05:54:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:16,852 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 4394 transitions. [2025-01-09 05:54:16,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 4394 transitions. [2025-01-09 05:54:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:16,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:16,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:16,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:54:16,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:16,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:16,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1600055836, now seen corresponding path program 1 times [2025-01-09 05:54:16,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:16,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155499765] [2025-01-09 05:54:16,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:16,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:16,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:16,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:16,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:16,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:16,910 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:54:16,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:16,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155499765] [2025-01-09 05:54:16,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155499765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:16,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:16,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:16,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142972137] [2025-01-09 05:54:16,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:16,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:16,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:16,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:16,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:16,912 INFO L87 Difference]: Start difference. First operand 2820 states and 4394 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:16,951 INFO L93 Difference]: Finished difference Result 3804 states and 5896 transitions. [2025-01-09 05:54:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:16,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:54:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:16,965 INFO L225 Difference]: With dead ends: 3804 [2025-01-09 05:54:16,965 INFO L226 Difference]: Without dead ends: 3288 [2025-01-09 05:54:16,968 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:54:16,969 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1502 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1710 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:54:16,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1710 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2025-01-09 05:54:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3286. [2025-01-09 05:54:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3286 states, 3284 states have (on average 1.5499390986601704) internal successors, (5090), 3285 states have internal predecessors, (5090), 0 states have call successors, (0), 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:54:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 5090 transitions. [2025-01-09 05:54:17,046 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 5090 transitions. Word has length 69 [2025-01-09 05:54:17,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:17,046 INFO L471 AbstractCegarLoop]: Abstraction has 3286 states and 5090 transitions. [2025-01-09 05:54:17,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 5090 transitions. [2025-01-09 05:54:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:17,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:17,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:54:17,047 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:17,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash -361793820, now seen corresponding path program 1 times [2025-01-09 05:54:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:17,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953293187] [2025-01-09 05:54:17,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:17,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:17,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:17,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:17,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:17,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:17,106 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:54:17,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:17,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953293187] [2025-01-09 05:54:17,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953293187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:17,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:17,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:17,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773658044] [2025-01-09 05:54:17,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:17,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:17,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:17,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:17,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:17,108 INFO L87 Difference]: Start difference. First operand 3286 states and 5090 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:17,161 INFO L93 Difference]: Finished difference Result 5154 states and 7900 transitions. [2025-01-09 05:54:17,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:17,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:54:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:17,189 INFO L225 Difference]: With dead ends: 5154 [2025-01-09 05:54:17,189 INFO L226 Difference]: Without dead ends: 4172 [2025-01-09 05:54:17,193 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:54:17,193 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1500 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1712 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:54:17,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1712 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2025-01-09 05:54:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 4170. [2025-01-09 05:54:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4170 states, 4168 states have (on average 1.5321497120921306) internal successors, (6386), 4169 states have internal predecessors, (6386), 0 states have call successors, (0), 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:54:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 6386 transitions. [2025-01-09 05:54:17,292 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 6386 transitions. Word has length 69 [2025-01-09 05:54:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:17,293 INFO L471 AbstractCegarLoop]: Abstraction has 4170 states and 6386 transitions. [2025-01-09 05:54:17,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6386 transitions. [2025-01-09 05:54:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:17,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:17,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:17,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:54:17,295 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:17,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:17,295 INFO L85 PathProgramCache]: Analyzing trace with hash -796329756, now seen corresponding path program 1 times [2025-01-09 05:54:17,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:17,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537786344] [2025-01-09 05:54:17,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:17,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:17,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:17,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:17,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:17,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:17,421 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:54:17,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:17,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537786344] [2025-01-09 05:54:17,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537786344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:17,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:17,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:17,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899078981] [2025-01-09 05:54:17,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:17,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:17,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:17,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:17,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:17,423 INFO L87 Difference]: Start difference. First operand 4170 states and 6386 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:17,582 INFO L93 Difference]: Finished difference Result 7710 states and 11620 transitions. [2025-01-09 05:54:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:17,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:54:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:17,616 INFO L225 Difference]: With dead ends: 7710 [2025-01-09 05:54:17,616 INFO L226 Difference]: Without dead ends: 5844 [2025-01-09 05:54:17,622 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:54:17,623 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 1496 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1708 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:54:17,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5844 states. [2025-01-09 05:54:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5844 to 5842. [2025-01-09 05:54:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5842 states, 5840 states have (on average 1.5044520547945206) internal successors, (8786), 5841 states have internal predecessors, (8786), 0 states have call successors, (0), 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:54:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5842 states to 5842 states and 8786 transitions. [2025-01-09 05:54:17,889 INFO L78 Accepts]: Start accepts. Automaton has 5842 states and 8786 transitions. Word has length 69 [2025-01-09 05:54:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:17,889 INFO L471 AbstractCegarLoop]: Abstraction has 5842 states and 8786 transitions. [2025-01-09 05:54:17,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 5842 states and 8786 transitions. [2025-01-09 05:54:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:54:17,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:17,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:17,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:54:17,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:17,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:17,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1717704676, now seen corresponding path program 1 times [2025-01-09 05:54:17,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:17,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053864430] [2025-01-09 05:54:17,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:17,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:17,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:54:17,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:54:17,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:17,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:17,953 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:54:17,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:17,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053864430] [2025-01-09 05:54:17,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053864430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:17,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:17,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903007685] [2025-01-09 05:54:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:17,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:17,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:17,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:17,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:17,956 INFO L87 Difference]: Start difference. First operand 5842 states and 8786 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:18,078 INFO L93 Difference]: Finished difference Result 12534 states and 18484 transitions. [2025-01-09 05:54:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:18,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:54:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:18,099 INFO L225 Difference]: With dead ends: 12534 [2025-01-09 05:54:18,100 INFO L226 Difference]: Without dead ends: 8996 [2025-01-09 05:54:18,107 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:54:18,108 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1498 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1714 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:54:18,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1714 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8996 states. [2025-01-09 05:54:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8996 to 8994. [2025-01-09 05:54:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8994 states, 8992 states have (on average 1.468193950177936) internal successors, (13202), 8993 states have internal predecessors, (13202), 0 states have call successors, (0), 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:54:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8994 states to 8994 states and 13202 transitions. [2025-01-09 05:54:18,423 INFO L78 Accepts]: Start accepts. Automaton has 8994 states and 13202 transitions. Word has length 69 [2025-01-09 05:54:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:18,423 INFO L471 AbstractCegarLoop]: Abstraction has 8994 states and 13202 transitions. [2025-01-09 05:54:18,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 8994 states and 13202 transitions. [2025-01-09 05:54:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:54:18,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:18,427 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:18,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:54:18,428 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:18,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1175898238, now seen corresponding path program 1 times [2025-01-09 05:54:18,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:18,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251080006] [2025-01-09 05:54:18,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:18,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:54:18,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:54:18,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:18,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:18,614 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:54:18,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:18,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251080006] [2025-01-09 05:54:18,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251080006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:18,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:18,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:18,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349664151] [2025-01-09 05:54:18,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:18,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:18,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:18,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:18,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:18,616 INFO L87 Difference]: Start difference. First operand 8994 states and 13202 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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:54:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:19,766 INFO L93 Difference]: Finished difference Result 48592 states and 69977 transitions. [2025-01-09 05:54:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:19,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:54:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:19,955 INFO L225 Difference]: With dead ends: 48592 [2025-01-09 05:54:19,955 INFO L226 Difference]: Without dead ends: 43854 [2025-01-09 05:54:19,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:54:19,976 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 8085 mSDsluCounter, 2465 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8085 SdHoareTripleChecker+Valid, 4101 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:19,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8085 Valid, 4101 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43854 states. [2025-01-09 05:54:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43854 to 14722. [2025-01-09 05:54:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14722 states, 14720 states have (on average 1.4490489130434783) internal successors, (21330), 14721 states have internal predecessors, (21330), 0 states have call successors, (0), 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:54:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14722 states to 14722 states and 21330 transitions. [2025-01-09 05:54:20,682 INFO L78 Accepts]: Start accepts. Automaton has 14722 states and 21330 transitions. Word has length 90 [2025-01-09 05:54:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:20,682 INFO L471 AbstractCegarLoop]: Abstraction has 14722 states and 21330 transitions. [2025-01-09 05:54:20,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 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:54:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 14722 states and 21330 transitions. [2025-01-09 05:54:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:54:20,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:20,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:20,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:54:20,689 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:20,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:20,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1012983678, now seen corresponding path program 1 times [2025-01-09 05:54:20,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:20,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088337547] [2025-01-09 05:54:20,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:20,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:20,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:54:20,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:54:20,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:20,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:54:20,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:20,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088337547] [2025-01-09 05:54:20,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088337547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:20,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:20,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:20,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503284859] [2025-01-09 05:54:20,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:20,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:20,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:20,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:20,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:20,903 INFO L87 Difference]: Start difference. First operand 14722 states and 21330 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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:54:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:22,387 INFO L93 Difference]: Finished difference Result 55280 states and 79513 transitions. [2025-01-09 05:54:22,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:22,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:54:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:22,518 INFO L225 Difference]: With dead ends: 55280 [2025-01-09 05:54:22,518 INFO L226 Difference]: Without dead ends: 48590 [2025-01-09 05:54:22,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:54:22,545 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8087 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8087 SdHoareTripleChecker+Valid, 4064 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:22,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8087 Valid, 4064 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48590 states. [2025-01-09 05:54:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48590 to 23778. [2025-01-09 05:54:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23778 states, 23776 states have (on average 1.4368270524899058) internal successors, (34162), 23777 states have internal predecessors, (34162), 0 states have call successors, (0), 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:54:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23778 states to 23778 states and 34162 transitions. [2025-01-09 05:54:23,419 INFO L78 Accepts]: Start accepts. Automaton has 23778 states and 34162 transitions. Word has length 90 [2025-01-09 05:54:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:23,419 INFO L471 AbstractCegarLoop]: Abstraction has 23778 states and 34162 transitions. [2025-01-09 05:54:23,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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:54:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 23778 states and 34162 transitions. [2025-01-09 05:54:23,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:54:23,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:23,425 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:23,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:54:23,425 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:23,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:23,426 INFO L85 PathProgramCache]: Analyzing trace with hash -749127294, now seen corresponding path program 1 times [2025-01-09 05:54:23,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:23,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198648518] [2025-01-09 05:54:23,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:23,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:23,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:54:23,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:54:23,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:23,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:54:23,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:23,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198648518] [2025-01-09 05:54:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198648518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:23,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:23,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364370362] [2025-01-09 05:54:23,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:23,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:23,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:23,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:23,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:23,644 INFO L87 Difference]: Start difference. First operand 23778 states and 34162 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:25,262 INFO L93 Difference]: Finished difference Result 61968 states and 89017 transitions. [2025-01-09 05:54:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:25,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:54:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:25,355 INFO L225 Difference]: With dead ends: 61968 [2025-01-09 05:54:25,355 INFO L226 Difference]: Without dead ends: 55278 [2025-01-09 05:54:25,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:54:25,380 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8107 mSDsluCounter, 2403 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8107 SdHoareTripleChecker+Valid, 4036 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:25,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8107 Valid, 4036 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:54:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55278 states. [2025-01-09 05:54:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55278 to 30466. [2025-01-09 05:54:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30466 states, 30464 states have (on average 1.4333639705882353) internal successors, (43666), 30465 states have internal predecessors, (43666), 0 states have call successors, (0), 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:54:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30466 states to 30466 states and 43666 transitions. [2025-01-09 05:54:26,777 INFO L78 Accepts]: Start accepts. Automaton has 30466 states and 43666 transitions. Word has length 90 [2025-01-09 05:54:26,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:26,778 INFO L471 AbstractCegarLoop]: Abstraction has 30466 states and 43666 transitions. [2025-01-09 05:54:26,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30466 states and 43666 transitions. [2025-01-09 05:54:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:54:26,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:26,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:26,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:54:26,784 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:26,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:26,786 INFO L85 PathProgramCache]: Analyzing trace with hash 489134722, now seen corresponding path program 1 times [2025-01-09 05:54:26,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:26,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488077582] [2025-01-09 05:54:26,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:26,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:26,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:54:26,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:54:26,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:26,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:54:26,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:26,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488077582] [2025-01-09 05:54:26,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488077582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:26,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:26,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:26,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663969414] [2025-01-09 05:54:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:26,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:26,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:26,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:26,977 INFO L87 Difference]: Start difference. First operand 30466 states and 43666 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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:54:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:28,537 INFO L93 Difference]: Finished difference Result 68656 states and 98521 transitions. [2025-01-09 05:54:28,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:28,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:54:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:28,765 INFO L225 Difference]: With dead ends: 68656 [2025-01-09 05:54:28,766 INFO L226 Difference]: Without dead ends: 61966 [2025-01-09 05:54:28,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:54:28,785 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8199 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8199 SdHoareTripleChecker+Valid, 3982 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:28,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8199 Valid, 3982 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61966 states. [2025-01-09 05:54:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61966 to 37154. [2025-01-09 05:54:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37154 states, 37152 states have (on average 1.4311477174849268) internal successors, (53170), 37153 states have internal predecessors, (53170), 0 states have call successors, (0), 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:54:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37154 states to 37154 states and 53170 transitions. [2025-01-09 05:54:29,880 INFO L78 Accepts]: Start accepts. Automaton has 37154 states and 53170 transitions. Word has length 90 [2025-01-09 05:54:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:29,882 INFO L471 AbstractCegarLoop]: Abstraction has 37154 states and 53170 transitions. [2025-01-09 05:54:29,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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:54:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 37154 states and 53170 transitions. [2025-01-09 05:54:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:54:29,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:29,888 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:29,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:54:29,889 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:29,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:29,889 INFO L85 PathProgramCache]: Analyzing trace with hash 54598786, now seen corresponding path program 1 times [2025-01-09 05:54:29,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:29,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031009283] [2025-01-09 05:54:29,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:29,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:29,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:54:29,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:54:29,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:29,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 05:54:30,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:30,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031009283] [2025-01-09 05:54:30,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031009283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:30,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:30,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:30,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702982915] [2025-01-09 05:54:30,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:30,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:30,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:30,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:30,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:30,067 INFO L87 Difference]: Start difference. First operand 37154 states and 53170 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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:54:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:31,768 INFO L93 Difference]: Finished difference Result 75344 states and 108025 transitions. [2025-01-09 05:54:31,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:31,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:54:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:31,851 INFO L225 Difference]: With dead ends: 75344 [2025-01-09 05:54:31,851 INFO L226 Difference]: Without dead ends: 68654 [2025-01-09 05:54:31,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:54:31,867 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8137 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8137 SdHoareTripleChecker+Valid, 4043 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:31,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8137 Valid, 4043 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68654 states. [2025-01-09 05:54:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68654 to 43842. [2025-01-09 05:54:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43842 states, 43840 states have (on average 1.4296076642335767) internal successors, (62674), 43841 states have internal predecessors, (62674), 0 states have call successors, (0), 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:54:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43842 states to 43842 states and 62674 transitions. [2025-01-09 05:54:33,028 INFO L78 Accepts]: Start accepts. Automaton has 43842 states and 62674 transitions. Word has length 90 [2025-01-09 05:54:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:33,028 INFO L471 AbstractCegarLoop]: Abstraction has 43842 states and 62674 transitions. [2025-01-09 05:54:33,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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:54:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 43842 states and 62674 transitions. [2025-01-09 05:54:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:54:33,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:33,033 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:33,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:54:33,034 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:33,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:33,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1726334078, now seen corresponding path program 1 times [2025-01-09 05:54:33,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:33,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218607368] [2025-01-09 05:54:33,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:33,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:54:33,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:54:33,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:33,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:54:33,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:33,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218607368] [2025-01-09 05:54:33,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218607368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:33,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:33,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:33,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963769333] [2025-01-09 05:54:33,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:33,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:33,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:33,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:33,187 INFO L87 Difference]: Start difference. First operand 43842 states and 62674 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:35,109 INFO L93 Difference]: Finished difference Result 82032 states and 117529 transitions. [2025-01-09 05:54:35,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:35,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:54:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:35,206 INFO L225 Difference]: With dead ends: 82032 [2025-01-09 05:54:35,206 INFO L226 Difference]: Without dead ends: 75342 [2025-01-09 05:54:35,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:54:35,226 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8040 mSDsluCounter, 2516 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8040 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:35,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8040 Valid, 4146 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75342 states. [2025-01-09 05:54:36,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75342 to 50530. [2025-01-09 05:54:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50530 states, 50528 states have (on average 1.428475300823306) internal successors, (72178), 50529 states have internal predecessors, (72178), 0 states have call successors, (0), 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:54:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50530 states to 50530 states and 72178 transitions. [2025-01-09 05:54:36,854 INFO L78 Accepts]: Start accepts. Automaton has 50530 states and 72178 transitions. Word has length 90 [2025-01-09 05:54:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:36,854 INFO L471 AbstractCegarLoop]: Abstraction has 50530 states and 72178 transitions. [2025-01-09 05:54:36,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 50530 states and 72178 transitions. [2025-01-09 05:54:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 05:54:36,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:36,861 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:36,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:54:36,861 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:36,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash 446172403, now seen corresponding path program 1 times [2025-01-09 05:54:36,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:36,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530356693] [2025-01-09 05:54:36,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:36,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:36,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:54:36,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:54:36,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:36,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:37,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:37,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530356693] [2025-01-09 05:54:37,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530356693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:37,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:37,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:37,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999064398] [2025-01-09 05:54:37,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:37,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:37,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:37,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:37,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:37,156 INFO L87 Difference]: Start difference. First operand 50530 states and 72178 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:38,298 INFO L93 Difference]: Finished difference Result 98758 states and 140756 transitions. [2025-01-09 05:54:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:38,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 05:54:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:38,358 INFO L225 Difference]: With dead ends: 98758 [2025-01-09 05:54:38,359 INFO L226 Difference]: Without dead ends: 50532 [2025-01-09 05:54:38,387 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:54:38,388 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 53 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3154 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:54:38,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50532 states. [2025-01-09 05:54:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50532 to 50530. [2025-01-09 05:54:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50530 states, 50528 states have (on average 1.414859088030399) internal successors, (71490), 50529 states have internal predecessors, (71490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50530 states to 50530 states and 71490 transitions. [2025-01-09 05:54:39,859 INFO L78 Accepts]: Start accepts. Automaton has 50530 states and 71490 transitions. Word has length 91 [2025-01-09 05:54:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:39,859 INFO L471 AbstractCegarLoop]: Abstraction has 50530 states and 71490 transitions. [2025-01-09 05:54:39,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 50530 states and 71490 transitions. [2025-01-09 05:54:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:54:39,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:39,863 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:39,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:54:39,865 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:39,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash 131060762, now seen corresponding path program 1 times [2025-01-09 05:54:39,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:39,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632917914] [2025-01-09 05:54:39,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:39,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:39,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:54:39,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:54:39,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:39,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:39,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:39,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632917914] [2025-01-09 05:54:39,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632917914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:39,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:39,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:39,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429621318] [2025-01-09 05:54:39,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:39,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:39,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:39,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:39,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:39,973 INFO L87 Difference]: Start difference. First operand 50530 states and 71490 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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:54:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:40,654 INFO L93 Difference]: Finished difference Result 68315 states and 96714 transitions. [2025-01-09 05:54:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:40,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 05:54:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:40,689 INFO L225 Difference]: With dead ends: 68315 [2025-01-09 05:54:40,689 INFO L226 Difference]: Without dead ends: 20089 [2025-01-09 05:54:40,712 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:54:40,713 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 47 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3151 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:54:40,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3151 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20089 states. [2025-01-09 05:54:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20089 to 20081. [2025-01-09 05:54:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20081 states, 20079 states have (on average 1.423228248418746) internal successors, (28577), 20080 states have internal predecessors, (28577), 0 states have call successors, (0), 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:54:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20081 states to 20081 states and 28577 transitions. [2025-01-09 05:54:41,313 INFO L78 Accepts]: Start accepts. Automaton has 20081 states and 28577 transitions. Word has length 92 [2025-01-09 05:54:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:41,314 INFO L471 AbstractCegarLoop]: Abstraction has 20081 states and 28577 transitions. [2025-01-09 05:54:41,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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:54:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20081 states and 28577 transitions. [2025-01-09 05:54:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 05:54:41,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:41,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:41,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:54:41,316 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:41,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:41,317 INFO L85 PathProgramCache]: Analyzing trace with hash 172821189, now seen corresponding path program 1 times [2025-01-09 05:54:41,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:41,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700658606] [2025-01-09 05:54:41,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:41,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:41,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 05:54:41,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 05:54:41,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:41,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:41,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:41,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700658606] [2025-01-09 05:54:41,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700658606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:41,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:41,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:41,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451727581] [2025-01-09 05:54:41,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:41,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:41,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:41,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:41,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:41,434 INFO L87 Difference]: Start difference. First operand 20081 states and 28577 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:41,803 INFO L93 Difference]: Finished difference Result 28965 states and 41059 transitions. [2025-01-09 05:54:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:41,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 05:54:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:41,823 INFO L225 Difference]: With dead ends: 28965 [2025-01-09 05:54:41,823 INFO L226 Difference]: Without dead ends: 11203 [2025-01-09 05:54:41,837 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:54:41,839 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 49 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3130 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:54:41,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3130 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:41,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11203 states. [2025-01-09 05:54:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11203 to 11201. [2025-01-09 05:54:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11201 states, 11199 states have (on average 1.426645236181802) internal successors, (15977), 11200 states have internal predecessors, (15977), 0 states have call successors, (0), 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:54:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11201 states to 11201 states and 15977 transitions. [2025-01-09 05:54:42,044 INFO L78 Accepts]: Start accepts. Automaton has 11201 states and 15977 transitions. Word has length 93 [2025-01-09 05:54:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:42,045 INFO L471 AbstractCegarLoop]: Abstraction has 11201 states and 15977 transitions. [2025-01-09 05:54:42,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:42,045 INFO L276 IsEmpty]: Start isEmpty. Operand 11201 states and 15977 transitions. [2025-01-09 05:54:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 05:54:42,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:42,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:42,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 05:54:42,046 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:42,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash -150071529, now seen corresponding path program 1 times [2025-01-09 05:54:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182357340] [2025-01-09 05:54:42,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:42,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 05:54:42,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 05:54:42,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:42,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:42,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:42,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182357340] [2025-01-09 05:54:42,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182357340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:42,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:42,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:42,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996170692] [2025-01-09 05:54:42,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:42,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:42,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:42,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:42,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:42,124 INFO L87 Difference]: Start difference. First operand 11201 states and 15977 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:42,252 INFO L93 Difference]: Finished difference Result 15645 states and 22159 transitions. [2025-01-09 05:54:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:42,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 05:54:42,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:42,265 INFO L225 Difference]: With dead ends: 15645 [2025-01-09 05:54:42,265 INFO L226 Difference]: Without dead ends: 6763 [2025-01-09 05:54:42,274 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:54:42,275 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 46 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3115 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:54:42,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3115 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:42,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-01-09 05:54:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6761. [2025-01-09 05:54:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6759 states have (on average 1.4405977215564432) internal successors, (9737), 6760 states have internal predecessors, (9737), 0 states have call successors, (0), 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:54:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9737 transitions. [2025-01-09 05:54:42,439 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9737 transitions. Word has length 95 [2025-01-09 05:54:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:42,439 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9737 transitions. [2025-01-09 05:54:42,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9737 transitions. [2025-01-09 05:54:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 05:54:42,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:42,441 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:42,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 05:54:42,441 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:42,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:42,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1004818921, now seen corresponding path program 1 times [2025-01-09 05:54:42,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:42,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876402251] [2025-01-09 05:54:42,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:42,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 05:54:42,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 05:54:42,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:42,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:42,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:42,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876402251] [2025-01-09 05:54:42,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876402251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:42,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:42,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:42,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234427901] [2025-01-09 05:54:42,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:42,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:42,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:42,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:42,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:42,550 INFO L87 Difference]: Start difference. First operand 6761 states and 9737 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:42,642 INFO L93 Difference]: Finished difference Result 8985 states and 12799 transitions. [2025-01-09 05:54:42,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:42,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 05:54:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:42,648 INFO L225 Difference]: With dead ends: 8985 [2025-01-09 05:54:42,648 INFO L226 Difference]: Without dead ends: 4543 [2025-01-09 05:54:42,652 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:54:42,652 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 43 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3100 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:54:42,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3100 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2025-01-09 05:54:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 4541. [2025-01-09 05:54:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4541 states, 4539 states have (on average 1.4644194756554307) internal successors, (6647), 4540 states have internal predecessors, (6647), 0 states have call successors, (0), 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:54:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 6647 transitions. [2025-01-09 05:54:42,762 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 6647 transitions. Word has length 97 [2025-01-09 05:54:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:42,763 INFO L471 AbstractCegarLoop]: Abstraction has 4541 states and 6647 transitions. [2025-01-09 05:54:42,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 6647 transitions. [2025-01-09 05:54:42,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:54:42,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:42,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:42,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 05:54:42,764 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:42,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:42,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1807801147, now seen corresponding path program 1 times [2025-01-09 05:54:42,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:42,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230579973] [2025-01-09 05:54:42,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:42,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:42,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:54:42,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:54:42,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:42,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:42,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:42,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230579973] [2025-01-09 05:54:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230579973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:42,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590932831] [2025-01-09 05:54:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:42,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:42,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:42,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:42,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:42,878 INFO L87 Difference]: Start difference. First operand 4541 states and 6647 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:42,953 INFO L93 Difference]: Finished difference Result 5655 states and 8164 transitions. [2025-01-09 05:54:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:42,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-01-09 05:54:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:42,962 INFO L225 Difference]: With dead ends: 5655 [2025-01-09 05:54:42,962 INFO L226 Difference]: Without dead ends: 3433 [2025-01-09 05:54:42,965 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:54:42,966 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 40 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3085 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:54:42,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3085 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3433 states. [2025-01-09 05:54:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3433 to 3431. [2025-01-09 05:54:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3431 states, 3429 states have (on average 1.4922717993584136) internal successors, (5117), 3430 states have internal predecessors, (5117), 0 states have call successors, (0), 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:54:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 3431 states and 5117 transitions. [2025-01-09 05:54:43,055 INFO L78 Accepts]: Start accepts. Automaton has 3431 states and 5117 transitions. Word has length 99 [2025-01-09 05:54:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:43,055 INFO L471 AbstractCegarLoop]: Abstraction has 3431 states and 5117 transitions. [2025-01-09 05:54:43,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3431 states and 5117 transitions. [2025-01-09 05:54:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 05:54:43,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:43,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:43,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 05:54:43,058 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:43,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:43,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1552100595, now seen corresponding path program 1 times [2025-01-09 05:54:43,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:43,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053153489] [2025-01-09 05:54:43,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:43,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:54:43,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:54:43,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:43,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:44,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:44,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053153489] [2025-01-09 05:54:44,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053153489] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:44,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992393499] [2025-01-09 05:54:44,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:44,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:44,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:44,005 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:54:44,007 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:54:44,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:54:44,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:54:44,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:44,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:44,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:54:44,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:44,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:54:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:46,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992393499] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:54:46,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:54:46,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 05:54:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456455751] [2025-01-09 05:54:46,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:54:46,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 05:54:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:46,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 05:54:46,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-01-09 05:54:46,117 INFO L87 Difference]: Start difference. First operand 3431 states and 5117 transitions. Second operand has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 27 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:48,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:48,839 INFO L93 Difference]: Finished difference Result 7911 states and 11257 transitions. [2025-01-09 05:54:48,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 05:54:48,839 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 27 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-01-09 05:54:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:48,851 INFO L225 Difference]: With dead ends: 7911 [2025-01-09 05:54:48,851 INFO L226 Difference]: Without dead ends: 6799 [2025-01-09 05:54:48,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=847, Invalid=3443, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 05:54:48,857 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 25010 mSDsluCounter, 6633 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25010 SdHoareTripleChecker+Valid, 8144 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:48,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25010 Valid, 8144 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:54:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6799 states. [2025-01-09 05:54:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6799 to 6701. [2025-01-09 05:54:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6701 states, 6699 states have (on average 1.4221525600835945) internal successors, (9527), 6700 states have internal predecessors, (9527), 0 states have call successors, (0), 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:54:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6701 states to 6701 states and 9527 transitions. [2025-01-09 05:54:49,088 INFO L78 Accepts]: Start accepts. Automaton has 6701 states and 9527 transitions. Word has length 101 [2025-01-09 05:54:49,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:49,088 INFO L471 AbstractCegarLoop]: Abstraction has 6701 states and 9527 transitions. [2025-01-09 05:54:49,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.892857142857142) internal successors, (277), 27 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 6701 states and 9527 transitions. [2025-01-09 05:54:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 05:54:49,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:49,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:49,101 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:54:49,291 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,SelfDestructingSolverStorable25 [2025-01-09 05:54:49,292 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:49,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1049559474, now seen corresponding path program 1 times [2025-01-09 05:54:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:49,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593748480] [2025-01-09 05:54:49,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:49,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:54:49,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:54:49,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:49,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:49,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:49,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593748480] [2025-01-09 05:54:49,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593748480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:49,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538036742] [2025-01-09 05:54:49,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:49,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:49,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:49,976 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:54:49,977 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:54:50,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:54:50,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:54:50,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:50,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:50,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:54:50,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:50,462 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:50,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:54:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:51,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538036742] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:54:51,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:54:51,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-01-09 05:54:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758413114] [2025-01-09 05:54:51,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:54:51,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 05:54:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:51,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 05:54:51,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-01-09 05:54:51,110 INFO L87 Difference]: Start difference. First operand 6701 states and 9527 transitions. Second operand has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 27 states have internal predecessors, (254), 0 states have call successors, (0), 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:54:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:53,342 INFO L93 Difference]: Finished difference Result 20781 states and 28492 transitions. [2025-01-09 05:54:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 05:54:53,343 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 27 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-01-09 05:54:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:53,360 INFO L225 Difference]: With dead ends: 20781 [2025-01-09 05:54:53,360 INFO L226 Difference]: Without dead ends: 16399 [2025-01-09 05:54:53,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=813, Invalid=3093, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 05:54:53,369 INFO L435 NwaCegarLoop]: 1532 mSDtfsCounter, 26739 mSDsluCounter, 6704 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26739 SdHoareTripleChecker+Valid, 8236 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:53,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26739 Valid, 8236 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:54:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16399 states. [2025-01-09 05:54:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16399 to 16166. [2025-01-09 05:54:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16166 states, 16164 states have (on average 1.363338282603316) internal successors, (22037), 16165 states have internal predecessors, (22037), 0 states have call successors, (0), 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:54:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16166 states to 16166 states and 22037 transitions. [2025-01-09 05:54:53,791 INFO L78 Accepts]: Start accepts. Automaton has 16166 states and 22037 transitions. Word has length 102 [2025-01-09 05:54:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:53,791 INFO L471 AbstractCegarLoop]: Abstraction has 16166 states and 22037 transitions. [2025-01-09 05:54:53,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 27 states have internal predecessors, (254), 0 states have call successors, (0), 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:54:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand 16166 states and 22037 transitions. [2025-01-09 05:54:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 05:54:53,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:53,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:53,799 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:54:53,993 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,SelfDestructingSolverStorable26 [2025-01-09 05:54:53,993 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:53,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:53,994 INFO L85 PathProgramCache]: Analyzing trace with hash -323826721, now seen corresponding path program 1 times [2025-01-09 05:54:53,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:53,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555915585] [2025-01-09 05:54:53,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:53,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:54,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 05:54:54,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 05:54:54,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:54,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:54,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:54,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555915585] [2025-01-09 05:54:54,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555915585] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:54,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785960848] [2025-01-09 05:54:54,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:54,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:54,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:54,355 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:54:54,358 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:54:54,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 05:54:54,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 05:54:54,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:54,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:54,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:54:54,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:54,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:54:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:55,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785960848] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:54:55,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:54:55,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-01-09 05:54:55,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644825259] [2025-01-09 05:54:55,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:54:55,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 05:54:55,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:55,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 05:54:55,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2025-01-09 05:54:55,621 INFO L87 Difference]: Start difference. First operand 16166 states and 22037 transitions. Second operand has 26 states, 26 states have (on average 10.961538461538462) internal successors, (285), 25 states have internal predecessors, (285), 0 states have call successors, (0), 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:54:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:57,786 INFO L93 Difference]: Finished difference Result 68260 states and 91419 transitions. [2025-01-09 05:54:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 05:54:57,787 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.961538461538462) internal successors, (285), 25 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 05:54:57,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:57,841 INFO L225 Difference]: With dead ends: 68260 [2025-01-09 05:54:57,841 INFO L226 Difference]: Without dead ends: 54413 [2025-01-09 05:54:57,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=712, Invalid=2480, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 05:54:57,859 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 20738 mSDsluCounter, 5438 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20738 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:57,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20738 Valid, 6992 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:54:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54413 states. [2025-01-09 05:54:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54413 to 46781. [2025-01-09 05:54:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46781 states, 46779 states have (on average 1.3192244383163385) internal successors, (61712), 46780 states have internal predecessors, (61712), 0 states have call successors, (0), 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:54:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46781 states to 46781 states and 61712 transitions. [2025-01-09 05:54:59,090 INFO L78 Accepts]: Start accepts. Automaton has 46781 states and 61712 transitions. Word has length 103 [2025-01-09 05:54:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:59,090 INFO L471 AbstractCegarLoop]: Abstraction has 46781 states and 61712 transitions. [2025-01-09 05:54:59,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.961538461538462) internal successors, (285), 25 states have internal predecessors, (285), 0 states have call successors, (0), 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:54:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 46781 states and 61712 transitions. [2025-01-09 05:54:59,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:54:59,093 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:59,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:59,100 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:54:59,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:59,294 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:59,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash -942036193, now seen corresponding path program 1 times [2025-01-09 05:54:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:59,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829467505] [2025-01-09 05:54:59,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:59,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:59,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:54:59,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:54:59,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:59,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:59,631 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:59,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:59,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829467505] [2025-01-09 05:54:59,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829467505] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:59,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32655135] [2025-01-09 05:54:59,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:59,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:59,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:59,634 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:54:59,635 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:54:59,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:54:59,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:54:59,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:59,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:59,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:54:59,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:00,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:00,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32655135] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:00,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:00,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 05:55:00,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783638433] [2025-01-09 05:55:00,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:00,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 05:55:00,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:00,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 05:55:00,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-01-09 05:55:00,859 INFO L87 Difference]: Start difference. First operand 46781 states and 61712 transitions. Second operand has 21 states, 21 states have (on average 10.523809523809524) internal successors, (221), 20 states have internal predecessors, (221), 0 states have call successors, (0), 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:55:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:02,823 INFO L93 Difference]: Finished difference Result 128177 states and 168035 transitions. [2025-01-09 05:55:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 05:55:02,824 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.523809523809524) internal successors, (221), 20 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-01-09 05:55:02,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:02,916 INFO L225 Difference]: With dead ends: 128177 [2025-01-09 05:55:02,916 INFO L226 Difference]: Without dead ends: 83715 [2025-01-09 05:55:02,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:55:02,950 INFO L435 NwaCegarLoop]: 1527 mSDtfsCounter, 14115 mSDsluCounter, 3339 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14115 SdHoareTripleChecker+Valid, 4866 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:02,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14115 Valid, 4866 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:55:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83715 states.