./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.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.7.ufo.UNBOUNDED.pals+Problem12_label07.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 fdba2ae989c969b8ea983da7229bdc32604e4ef890fc1d03498078fc576fe644 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:58:33,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:58:33,229 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:58:33,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:58:33,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:58:33,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:58:33,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:58:33,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:58:33,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:58:33,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:58:33,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:58:33,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:58:33,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:58:33,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:58:33,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:58:33,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:58:33,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:58:33,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:58:33,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:58:33,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:58:33,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:58:33,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:58:33,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:58:33,270 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 -> fdba2ae989c969b8ea983da7229bdc32604e4ef890fc1d03498078fc576fe644 [2025-01-09 05:58:33,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:58:33,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:58:33,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:58:33,510 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:58:33,510 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:58:33,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-01-09 05:58:34,718 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50af1c155/f75f4006302e4335841fb1534c5ef0c4/FLAG37ee76a8b [2025-01-09 05:58:35,258 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:58:35,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-01-09 05:58:35,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50af1c155/f75f4006302e4335841fb1534c5ef0c4/FLAG37ee76a8b [2025-01-09 05:58:35,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50af1c155/f75f4006302e4335841fb1534c5ef0c4 [2025-01-09 05:58:35,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:58:35,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:58:35,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:58:35,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:58:35,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:58:35,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:58:35" (1/1) ... [2025-01-09 05:58:35,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@539f3e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:35, skipping insertion in model container [2025-01-09 05:58:35,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:58:35" (1/1) ... [2025-01-09 05:58:35,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:58:35,733 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.7.ufo.UNBOUNDED.pals+Problem12_label07.c[20454,20467] [2025-01-09 05:58:35,764 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.7.ufo.UNBOUNDED.pals+Problem12_label07.c[21296,21309] [2025-01-09 05:58:36,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:58:36,174 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:58:36,204 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.7.ufo.UNBOUNDED.pals+Problem12_label07.c[20454,20467] [2025-01-09 05:58:36,206 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.7.ufo.UNBOUNDED.pals+Problem12_label07.c[21296,21309] [2025-01-09 05:58:36,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:58:36,460 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:58:36,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36 WrapperNode [2025-01-09 05:58:36,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:58:36,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:58:36,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:58:36,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:58:36,467 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:58:36" (1/1) ... [2025-01-09 05:58:36,517 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:58:36" (1/1) ... [2025-01-09 05:58:36,756 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5213 [2025-01-09 05:58:36,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:58:36,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:58:36,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:58:36,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:58:36,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (1/1) ... [2025-01-09 05:58:36,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (1/1) ... [2025-01-09 05:58:36,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (1/1) ... [2025-01-09 05:58:36,956 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:58:36,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (1/1) ... [2025-01-09 05:58:36,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (1/1) ... [2025-01-09 05:58:37,070 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (1/1) ... [2025-01-09 05:58:37,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (1/1) ... [2025-01-09 05:58:37,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (1/1) ... [2025-01-09 05:58:37,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (1/1) ... [2025-01-09 05:58:37,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (1/1) ... [2025-01-09 05:58:37,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:58:37,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:58:37,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:58:37,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:58:37,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (1/1) ... [2025-01-09 05:58:37,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:58:37,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:58:37,230 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:58:37,239 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:58:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:58:37,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:58:37,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:58:37,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:58:37,358 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:58:37,360 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:58:40,848 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-01-09 05:58:40,849 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:58:40,881 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:58:40,882 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:58:40,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:58:40 BoogieIcfgContainer [2025-01-09 05:58:40,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:58:40,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:58:40,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:58:40,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:58:40,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:58:35" (1/3) ... [2025-01-09 05:58:40,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5159db73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:58:40, skipping insertion in model container [2025-01-09 05:58:40,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:58:36" (2/3) ... [2025-01-09 05:58:40,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5159db73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:58:40, skipping insertion in model container [2025-01-09 05:58:40,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:58:40" (3/3) ... [2025-01-09 05:58:40,893 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-01-09 05:58:40,902 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:58:40,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label07.c that has 1 procedures, 931 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:58:40,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:58:40,962 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;@7deedc12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:58:40,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:58:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 931 states, 928 states have (on average 1.9019396551724137) internal successors, (1765), 930 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have 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:58:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 05:58:40,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:40,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:40,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:40,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:40,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1964176880, now seen corresponding path program 1 times [2025-01-09 05:58:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:40,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857404952] [2025-01-09 05:58:40,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:40,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:41,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 05:58:41,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 05:58:41,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:41,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:41,124 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:58:41,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:41,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857404952] [2025-01-09 05:58:41,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857404952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:41,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:41,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:58:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761301507] [2025-01-09 05:58:41,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:41,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:41,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:41,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:41,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:41,144 INFO L87 Difference]: Start difference. First operand has 931 states, 928 states have (on average 1.9019396551724137) internal successors, (1765), 930 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:58:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:45,326 INFO L93 Difference]: Finished difference Result 2560 states and 4922 transitions. [2025-01-09 05:58:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:45,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-01-09 05:58:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:45,342 INFO L225 Difference]: With dead ends: 2560 [2025-01-09 05:58:45,342 INFO L226 Difference]: Without dead ends: 1617 [2025-01-09 05:58:45,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:45,349 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1024 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:45,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 679 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 05:58:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-01-09 05:58:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-01-09 05:58:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1615 states have (on average 1.648297213622291) internal successors, (2662), 1616 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states have 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:58:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2662 transitions. [2025-01-09 05:58:45,425 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2662 transitions. Word has length 7 [2025-01-09 05:58:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:45,426 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2662 transitions. [2025-01-09 05:58:45,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have 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:58:45,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2662 transitions. [2025-01-09 05:58:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 05:58:45,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:45,431 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] [2025-01-09 05:58:45,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:58:45,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:45,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:45,432 INFO L85 PathProgramCache]: Analyzing trace with hash 154701306, now seen corresponding path program 1 times [2025-01-09 05:58:45,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:45,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761057168] [2025-01-09 05:58:45,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:45,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:45,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 05:58:45,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 05:58:45,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:45,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:45,795 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:58:45,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761057168] [2025-01-09 05:58:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761057168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:45,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:45,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:58:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387267096] [2025-01-09 05:58:45,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:45,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:58:45,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:45,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:58:45,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:58:45,802 INFO L87 Difference]: Start difference. First operand 1617 states and 2662 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:58:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:45,920 INFO L93 Difference]: Finished difference Result 1677 states and 2756 transitions. [2025-01-09 05:58:45,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:58:45,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-01-09 05:58:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:45,930 INFO L225 Difference]: With dead ends: 1677 [2025-01-09 05:58:45,933 INFO L226 Difference]: Without dead ends: 1617 [2025-01-09 05:58:45,935 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:58:45,939 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 0 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6477 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:45,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6477 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-01-09 05:58:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-01-09 05:58:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1615 states have (on average 1.6173374613003095) internal successors, (2612), 1616 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have 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:58:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2612 transitions. [2025-01-09 05:58:46,008 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2612 transitions. Word has length 28 [2025-01-09 05:58:46,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:46,008 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2612 transitions. [2025-01-09 05:58:46,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have 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:58:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2612 transitions. [2025-01-09 05:58:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:58:46,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:46,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:46,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:58:46,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:46,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1145196135, now seen corresponding path program 1 times [2025-01-09 05:58:46,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:46,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455496079] [2025-01-09 05:58:46,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:46,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:46,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:58:46,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:58:46,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:46,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:46,423 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:58:46,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:46,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455496079] [2025-01-09 05:58:46,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455496079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:46,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:46,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874196092] [2025-01-09 05:58:46,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:46,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:46,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:46,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:46,426 INFO L87 Difference]: Start difference. First operand 1617 states and 2612 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:46,741 INFO L93 Difference]: Finished difference Result 2401 states and 3872 transitions. [2025-01-09 05:58:46,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 05:58:46,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 05:58:46,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:46,750 INFO L225 Difference]: With dead ends: 2401 [2025-01-09 05:58:46,750 INFO L226 Difference]: Without dead ends: 2345 [2025-01-09 05:58:46,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-01-09 05:58:46,754 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 11615 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11615 SdHoareTripleChecker+Valid, 4178 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:46,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11615 Valid, 4178 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2025-01-09 05:58:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1671. [2025-01-09 05:58:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1669 states have (on average 1.6171360095865788) internal successors, (2699), 1670 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have 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:58:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2699 transitions. [2025-01-09 05:58:46,795 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2699 transitions. Word has length 77 [2025-01-09 05:58:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:46,796 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2699 transitions. [2025-01-09 05:58:46,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2699 transitions. [2025-01-09 05:58:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:58:46,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:46,799 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:46,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:58:46,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:46,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:46,800 INFO L85 PathProgramCache]: Analyzing trace with hash -907886728, now seen corresponding path program 1 times [2025-01-09 05:58:46,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:46,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171828179] [2025-01-09 05:58:46,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:46,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:46,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:58:46,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:58:46,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:46,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:58:47,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:47,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171828179] [2025-01-09 05:58:47,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171828179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:47,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:47,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475783290] [2025-01-09 05:58:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:47,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:47,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:47,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:47,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:47,012 INFO L87 Difference]: Start difference. First operand 1671 states and 2699 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:50,369 INFO L93 Difference]: Finished difference Result 4677 states and 7626 transitions. [2025-01-09 05:58:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:50,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 05:58:50,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:50,397 INFO L225 Difference]: With dead ends: 4677 [2025-01-09 05:58:50,401 INFO L226 Difference]: Without dead ends: 3173 [2025-01-09 05:58:50,406 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:58:50,411 INFO L435 NwaCegarLoop]: 1295 mSDtfsCounter, 762 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:50,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1449 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-09 05:58:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3173 states. [2025-01-09 05:58:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3173 to 3173. [2025-01-09 05:58:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3173 states, 3171 states have (on average 1.5310627562283192) internal successors, (4855), 3172 states have internal predecessors, (4855), 0 states have call successors, (0), 0 states have 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:58:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 4855 transitions. [2025-01-09 05:58:50,498 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 4855 transitions. Word has length 78 [2025-01-09 05:58:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:50,499 INFO L471 AbstractCegarLoop]: Abstraction has 3173 states and 4855 transitions. [2025-01-09 05:58:50,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 4855 transitions. [2025-01-09 05:58:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:58:50,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:50,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:50,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:58:50,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:50,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:50,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1857417929, now seen corresponding path program 1 times [2025-01-09 05:58:50,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:50,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64950613] [2025-01-09 05:58:50,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:50,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:50,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:58:50,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:58:50,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:50,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:50,727 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:58:50,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:50,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64950613] [2025-01-09 05:58:50,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64950613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:50,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:50,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557237356] [2025-01-09 05:58:50,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:50,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:50,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:50,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:50,732 INFO L87 Difference]: Start difference. First operand 3173 states and 4855 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:58:50,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:50,798 INFO L93 Difference]: Finished difference Result 3382 states and 5190 transitions. [2025-01-09 05:58:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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 79 [2025-01-09 05:58:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:50,819 INFO L225 Difference]: With dead ends: 3382 [2025-01-09 05:58:50,821 INFO L226 Difference]: Without dead ends: 3272 [2025-01-09 05:58:50,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:50,827 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1500 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:50,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1664 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2025-01-09 05:58:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 3268. [2025-01-09 05:58:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3268 states, 3266 states have (on average 1.5324556031843233) internal successors, (5005), 3267 states have internal predecessors, (5005), 0 states have call successors, (0), 0 states have 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:58:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 5005 transitions. [2025-01-09 05:58:50,943 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 5005 transitions. Word has length 79 [2025-01-09 05:58:50,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:50,943 INFO L471 AbstractCegarLoop]: Abstraction has 3268 states and 5005 transitions. [2025-01-09 05:58:50,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 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:58:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 5005 transitions. [2025-01-09 05:58:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 05:58:50,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:50,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:50,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:58:50,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:50,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1923911441, now seen corresponding path program 1 times [2025-01-09 05:58:50,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:50,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43928576] [2025-01-09 05:58:50,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:50,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 05:58:50,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 05:58:50,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:50,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:51,481 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:58:51,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:51,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43928576] [2025-01-09 05:58:51,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43928576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:51,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:58:51,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203707567] [2025-01-09 05:58:51,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:51,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:58:51,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:51,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:58:51,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:58:51,487 INFO L87 Difference]: Start difference. First operand 3268 states and 5005 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:58:51,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:51,760 INFO L93 Difference]: Finished difference Result 3475 states and 5333 transitions. [2025-01-09 05:58:51,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:58:51,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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 79 [2025-01-09 05:58:51,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:51,772 INFO L225 Difference]: With dead ends: 3475 [2025-01-09 05:58:51,773 INFO L226 Difference]: Without dead ends: 3270 [2025-01-09 05:58:51,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 05:58:51,777 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 1562 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:51,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 2192 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:58:51,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2025-01-09 05:58:51,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3268. [2025-01-09 05:58:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3268 states, 3266 states have (on average 1.531843233312921) internal successors, (5003), 3267 states have internal predecessors, (5003), 0 states have call successors, (0), 0 states have 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:58:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 5003 transitions. [2025-01-09 05:58:51,823 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 5003 transitions. Word has length 79 [2025-01-09 05:58:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:51,824 INFO L471 AbstractCegarLoop]: Abstraction has 3268 states and 5003 transitions. [2025-01-09 05:58:51,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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:58:51,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 5003 transitions. [2025-01-09 05:58:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 05:58:51,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:51,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:51,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:58:51,826 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:51,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:51,827 INFO L85 PathProgramCache]: Analyzing trace with hash -903010384, now seen corresponding path program 1 times [2025-01-09 05:58:51,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:51,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955633982] [2025-01-09 05:58:51,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:51,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:51,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 05:58:51,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 05:58:51,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:51,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:52,068 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:58:52,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:52,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955633982] [2025-01-09 05:58:52,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955633982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:52,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:52,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:58:52,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768447271] [2025-01-09 05:58:52,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:52,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:58:52,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:52,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:58:52,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:58:52,070 INFO L87 Difference]: Start difference. First operand 3268 states and 5003 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:58:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:52,122 INFO L93 Difference]: Finished difference Result 3276 states and 5012 transitions. [2025-01-09 05:58:52,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:58:52,123 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-01-09 05:58:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:52,132 INFO L225 Difference]: With dead ends: 3276 [2025-01-09 05:58:52,132 INFO L226 Difference]: Without dead ends: 3274 [2025-01-09 05:58:52,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:58:52,135 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 0 mSDsluCounter, 9461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11040 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:52,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11040 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:52,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2025-01-09 05:58:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 3274. [2025-01-09 05:58:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3274 states, 3272 states have (on average 1.5305623471882641) internal successors, (5008), 3273 states have internal predecessors, (5008), 0 states have call successors, (0), 0 states have 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:58:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 5008 transitions. [2025-01-09 05:58:52,187 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 5008 transitions. Word has length 80 [2025-01-09 05:58:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:52,188 INFO L471 AbstractCegarLoop]: Abstraction has 3274 states and 5008 transitions. [2025-01-09 05:58:52,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:58:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 5008 transitions. [2025-01-09 05:58:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:52,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:52,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:52,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:58:52,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:52,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2012985903, now seen corresponding path program 1 times [2025-01-09 05:58:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:52,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231956035] [2025-01-09 05:58:52,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:52,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:52,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:52,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:52,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:52,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:52,249 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:58:52,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231956035] [2025-01-09 05:58:52,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231956035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:52,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:52,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:52,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898707162] [2025-01-09 05:58:52,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:52,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:52,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:52,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:52,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:52,251 INFO L87 Difference]: Start difference. First operand 3274 states and 5008 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:52,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:52,276 INFO L93 Difference]: Finished difference Result 3680 states and 5640 transitions. [2025-01-09 05:58:52,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:52,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:52,286 INFO L225 Difference]: With dead ends: 3680 [2025-01-09 05:58:52,287 INFO L226 Difference]: Without dead ends: 3469 [2025-01-09 05:58:52,288 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:58:52,288 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1517 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1747 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:58:52,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2025-01-09 05:58:52,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3467. [2025-01-09 05:58:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3467 states, 3465 states have (on average 1.531024531024531) internal successors, (5305), 3466 states have internal predecessors, (5305), 0 states have call successors, (0), 0 states have 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:58:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3467 states to 3467 states and 5305 transitions. [2025-01-09 05:58:52,352 INFO L78 Accepts]: Start accepts. Automaton has 3467 states and 5305 transitions. Word has length 81 [2025-01-09 05:58:52,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:52,353 INFO L471 AbstractCegarLoop]: Abstraction has 3467 states and 5305 transitions. [2025-01-09 05:58:52,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:52,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 5305 transitions. [2025-01-09 05:58:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:52,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:52,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:52,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:58:52,357 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:52,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:52,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1586214959, now seen corresponding path program 1 times [2025-01-09 05:58:52,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:52,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777865519] [2025-01-09 05:58:52,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:52,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:52,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:52,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:52,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:52,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:52,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:58:52,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:52,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777865519] [2025-01-09 05:58:52,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777865519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:52,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:52,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:52,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101173059] [2025-01-09 05:58:52,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:52,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:52,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:52,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:52,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:52,423 INFO L87 Difference]: Start difference. First operand 3467 states and 5305 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:52,454 INFO L93 Difference]: Finished difference Result 4243 states and 6503 transitions. [2025-01-09 05:58:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:52,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:52,471 INFO L225 Difference]: With dead ends: 4243 [2025-01-09 05:58:52,474 INFO L226 Difference]: Without dead ends: 3839 [2025-01-09 05:58:52,477 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:58:52,477 INFO L435 NwaCegarLoop]: 1640 mSDtfsCounter, 1513 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1743 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:58:52,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1743 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:52,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2025-01-09 05:58:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3837. [2025-01-09 05:58:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3837 states, 3835 states have (on average 1.5298565840938723) internal successors, (5867), 3836 states have internal predecessors, (5867), 0 states have call successors, (0), 0 states have 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:58:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 5867 transitions. [2025-01-09 05:58:52,547 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 5867 transitions. Word has length 81 [2025-01-09 05:58:52,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:52,547 INFO L471 AbstractCegarLoop]: Abstraction has 3837 states and 5867 transitions. [2025-01-09 05:58:52,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 5867 transitions. [2025-01-09 05:58:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:52,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:52,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:52,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:58:52,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:52,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash -347952943, now seen corresponding path program 1 times [2025-01-09 05:58:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:52,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16717413] [2025-01-09 05:58:52,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:52,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:52,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:52,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:52,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:52,606 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:58:52,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16717413] [2025-01-09 05:58:52,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16717413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:52,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:52,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700183581] [2025-01-09 05:58:52,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:52,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:52,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:52,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:52,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:52,608 INFO L87 Difference]: Start difference. First operand 3837 states and 5867 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:52,665 INFO L93 Difference]: Finished difference Result 5321 states and 8133 transitions. [2025-01-09 05:58:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:52,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:52,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:52,680 INFO L225 Difference]: With dead ends: 5321 [2025-01-09 05:58:52,680 INFO L226 Difference]: Without dead ends: 4547 [2025-01-09 05:58:52,682 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:58:52,683 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 1511 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1745 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:58:52,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1745 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4547 states. [2025-01-09 05:58:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4547 to 4545. [2025-01-09 05:58:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4545 states, 4543 states have (on average 1.5247633722209994) internal successors, (6927), 4544 states have internal predecessors, (6927), 0 states have call successors, (0), 0 states have 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:58:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4545 states to 4545 states and 6927 transitions. [2025-01-09 05:58:52,764 INFO L78 Accepts]: Start accepts. Automaton has 4545 states and 6927 transitions. Word has length 81 [2025-01-09 05:58:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:52,764 INFO L471 AbstractCegarLoop]: Abstraction has 4545 states and 6927 transitions. [2025-01-09 05:58:52,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4545 states and 6927 transitions. [2025-01-09 05:58:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:52,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:52,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:52,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:58:52,765 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:52,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1731545553, now seen corresponding path program 1 times [2025-01-09 05:58:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989922973] [2025-01-09 05:58:52,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:52,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:52,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:52,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:52,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:52,817 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:58:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989922973] [2025-01-09 05:58:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989922973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:52,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806229878] [2025-01-09 05:58:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:52,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:52,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:52,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:52,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:52,819 INFO L87 Difference]: Start difference. First operand 4545 states and 6927 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:52,866 INFO L93 Difference]: Finished difference Result 7381 states and 11201 transitions. [2025-01-09 05:58:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:52,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:52,876 INFO L225 Difference]: With dead ends: 7381 [2025-01-09 05:58:52,876 INFO L226 Difference]: Without dead ends: 5899 [2025-01-09 05:58:52,879 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:58:52,880 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 1509 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1747 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:58:52,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2025-01-09 05:58:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 5897. [2025-01-09 05:58:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5897 states, 5895 states have (on average 1.5129770992366411) internal successors, (8919), 5896 states have internal predecessors, (8919), 0 states have call successors, (0), 0 states have 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:58:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 8919 transitions. [2025-01-09 05:58:52,967 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 8919 transitions. Word has length 81 [2025-01-09 05:58:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:52,968 INFO L471 AbstractCegarLoop]: Abstraction has 5897 states and 8919 transitions. [2025-01-09 05:58:52,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 8919 transitions. [2025-01-09 05:58:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:52,969 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:52,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:52,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:58:52,970 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:52,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash -782488879, now seen corresponding path program 1 times [2025-01-09 05:58:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:52,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132871490] [2025-01-09 05:58:52,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:52,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:52,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:52,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:52,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:52,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:53,016 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:58:53,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132871490] [2025-01-09 05:58:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132871490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:53,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:53,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:53,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49163392] [2025-01-09 05:58:53,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:53,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:53,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:53,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:53,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:53,018 INFO L87 Difference]: Start difference. First operand 5897 states and 8919 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:53,075 INFO L93 Difference]: Finished difference Result 11309 states and 16953 transitions. [2025-01-09 05:58:53,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:53,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:53,092 INFO L225 Difference]: With dead ends: 11309 [2025-01-09 05:58:53,092 INFO L226 Difference]: Without dead ends: 8475 [2025-01-09 05:58:53,097 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:58:53,098 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 1507 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1749 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:58:53,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8475 states. [2025-01-09 05:58:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8475 to 8473. [2025-01-09 05:58:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8473 states, 8471 states have (on average 1.4929760358871444) internal successors, (12647), 8472 states have internal predecessors, (12647), 0 states have call successors, (0), 0 states have 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:58:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8473 states to 8473 states and 12647 transitions. [2025-01-09 05:58:53,229 INFO L78 Accepts]: Start accepts. Automaton has 8473 states and 12647 transitions. Word has length 81 [2025-01-09 05:58:53,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:53,230 INFO L471 AbstractCegarLoop]: Abstraction has 8473 states and 12647 transitions. [2025-01-09 05:58:53,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 8473 states and 12647 transitions. [2025-01-09 05:58:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:53,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:53,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:53,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:58:53,232 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:53,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:53,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1850071343, now seen corresponding path program 1 times [2025-01-09 05:58:53,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:53,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80208538] [2025-01-09 05:58:53,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:53,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:53,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:53,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:53,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:53,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:53,285 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:58:53,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:53,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80208538] [2025-01-09 05:58:53,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80208538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:53,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:53,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:53,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640252903] [2025-01-09 05:58:53,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:53,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:53,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:53,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:53,287 INFO L87 Difference]: Start difference. First operand 8473 states and 12647 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:53,393 INFO L93 Difference]: Finished difference Result 18781 states and 27689 transitions. [2025-01-09 05:58:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:53,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:53,418 INFO L225 Difference]: With dead ends: 18781 [2025-01-09 05:58:53,419 INFO L226 Difference]: Without dead ends: 13371 [2025-01-09 05:58:53,429 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:58:53,430 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1515 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1749 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:58:53,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13371 states. [2025-01-09 05:58:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13371 to 13369. [2025-01-09 05:58:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13369 states, 13367 states have (on average 1.4656242986459191) internal successors, (19591), 13368 states have internal predecessors, (19591), 0 states have call successors, (0), 0 states have 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:58:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13369 states to 13369 states and 19591 transitions. [2025-01-09 05:58:53,759 INFO L78 Accepts]: Start accepts. Automaton has 13369 states and 19591 transitions. Word has length 81 [2025-01-09 05:58:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:53,760 INFO L471 AbstractCegarLoop]: Abstraction has 13369 states and 19591 transitions. [2025-01-09 05:58:53,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:58:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 13369 states and 19591 transitions. [2025-01-09 05:58:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 05:58:53,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:53,761 INFO L218 NwaCegarLoop]: trace histogram [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:58:53,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:58:53,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:53,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:53,762 INFO L85 PathProgramCache]: Analyzing trace with hash -688719309, now seen corresponding path program 1 times [2025-01-09 05:58:53,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:53,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389555456] [2025-01-09 05:58:53,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:53,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 05:58:53,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 05:58:53,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:53,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:58:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389555456] [2025-01-09 05:58:53,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389555456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:53,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:53,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:58:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794294165] [2025-01-09 05:58:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:53,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:53,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:53,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:53,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:53,825 INFO L87 Difference]: Start difference. First operand 13369 states and 19591 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 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:58:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:56,451 INFO L93 Difference]: Finished difference Result 17877 states and 26674 transitions. [2025-01-09 05:58:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:56,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 05:58:56,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:56,481 INFO L225 Difference]: With dead ends: 17877 [2025-01-09 05:58:56,482 INFO L226 Difference]: Without dead ends: 14871 [2025-01-09 05:58:56,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:56,493 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 870 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 962 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 3267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 962 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:56,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 301 Invalid, 3267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [962 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 05:58:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14871 states. [2025-01-09 05:58:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14871 to 14871. [2025-01-09 05:58:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14871 states, 14869 states have (on average 1.4775035308359674) internal successors, (21969), 14870 states have internal predecessors, (21969), 0 states have call successors, (0), 0 states have 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:58:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14871 states to 14871 states and 21969 transitions. [2025-01-09 05:58:56,796 INFO L78 Accepts]: Start accepts. Automaton has 14871 states and 21969 transitions. Word has length 81 [2025-01-09 05:58:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:56,796 INFO L471 AbstractCegarLoop]: Abstraction has 14871 states and 21969 transitions. [2025-01-09 05:58:56,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 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:58:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 14871 states and 21969 transitions. [2025-01-09 05:58:56,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 05:58:56,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:56,797 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 05:58:56,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:58:56,797 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:56,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -907628114, now seen corresponding path program 1 times [2025-01-09 05:58:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:56,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311016460] [2025-01-09 05:58:56,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:56,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 05:58:56,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 05:58:56,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:56,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:58:56,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:56,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311016460] [2025-01-09 05:58:56,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311016460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:56,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:56,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:58:56,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843600605] [2025-01-09 05:58:56,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:56,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:56,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:56,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:56,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:56,853 INFO L87 Difference]: Start difference. First operand 14871 states and 21969 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:59,328 INFO L93 Difference]: Finished difference Result 23885 states and 35964 transitions. [2025-01-09 05:58:59,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:59,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 05:58:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:59,365 INFO L225 Difference]: With dead ends: 23885 [2025-01-09 05:58:59,365 INFO L226 Difference]: Without dead ends: 19377 [2025-01-09 05:58:59,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:59,378 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 919 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:58:59,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 593 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 05:58:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19377 states. [2025-01-09 05:58:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19377 to 19377. [2025-01-09 05:58:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19377 states, 19375 states have (on average 1.4172903225806452) internal successors, (27460), 19376 states have internal predecessors, (27460), 0 states have call successors, (0), 0 states have 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:58:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19377 states to 19377 states and 27460 transitions. [2025-01-09 05:58:59,744 INFO L78 Accepts]: Start accepts. Automaton has 19377 states and 27460 transitions. Word has length 82 [2025-01-09 05:58:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:58:59,744 INFO L471 AbstractCegarLoop]: Abstraction has 19377 states and 27460 transitions. [2025-01-09 05:58:59,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:58:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 19377 states and 27460 transitions. [2025-01-09 05:58:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 05:58:59,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:58:59,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:58:59,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:58:59,745 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:58:59,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:58:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash -569599380, now seen corresponding path program 1 times [2025-01-09 05:58:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:58:59,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049211002] [2025-01-09 05:58:59,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:58:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:58:59,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 05:58:59,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 05:58:59,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:58:59,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:58:59,795 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:58:59,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:58:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049211002] [2025-01-09 05:58:59,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049211002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:58:59,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:58:59,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:58:59,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117696078] [2025-01-09 05:58:59,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:58:59,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:58:59,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:58:59,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:58:59,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:58:59,797 INFO L87 Difference]: Start difference. First operand 19377 states and 27460 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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:58:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:58:59,939 INFO L93 Difference]: Finished difference Result 30136 states and 43210 transitions. [2025-01-09 05:58:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:58:59,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 83 [2025-01-09 05:58:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:58:59,967 INFO L225 Difference]: With dead ends: 30136 [2025-01-09 05:58:59,968 INFO L226 Difference]: Without dead ends: 24373 [2025-01-09 05:58:59,978 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:58:59,980 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 1516 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1748 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:58:59,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:58:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24373 states. [2025-01-09 05:59:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24373 to 24371. [2025-01-09 05:59:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24371 states, 24369 states have (on average 1.4184414625138495) internal successors, (34566), 24370 states have internal predecessors, (34566), 0 states have call successors, (0), 0 states have 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:59:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24371 states to 24371 states and 34566 transitions. [2025-01-09 05:59:00,300 INFO L78 Accepts]: Start accepts. Automaton has 24371 states and 34566 transitions. Word has length 83 [2025-01-09 05:59:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:00,300 INFO L471 AbstractCegarLoop]: Abstraction has 24371 states and 34566 transitions. [2025-01-09 05:59:00,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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:59:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 24371 states and 34566 transitions. [2025-01-09 05:59:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 05:59:00,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:00,301 INFO L218 NwaCegarLoop]: trace histogram [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:59:00,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:59:00,302 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:00,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2133014785, now seen corresponding path program 1 times [2025-01-09 05:59:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427545497] [2025-01-09 05:59:00,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:00,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 05:59:00,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 05:59:00,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:00,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:59:00,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:00,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427545497] [2025-01-09 05:59:00,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427545497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:00,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:00,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:59:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910950851] [2025-01-09 05:59:00,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:00,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:59:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:00,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:59:00,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:59:00,460 INFO L87 Difference]: Start difference. First operand 24371 states and 34566 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:04,482 INFO L93 Difference]: Finished difference Result 43899 states and 61405 transitions. [2025-01-09 05:59:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:59:04,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2025-01-09 05:59:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:04,649 INFO L225 Difference]: With dead ends: 43899 [2025-01-09 05:59:04,650 INFO L226 Difference]: Without dead ends: 34885 [2025-01-09 05:59:04,662 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:59:04,662 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 2444 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4621 mSolverCounterSat, 830 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2444 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 5451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 830 IncrementalHoareTripleChecker+Valid, 4621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:04,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2444 Valid, 811 Invalid, 5451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [830 Valid, 4621 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-09 05:59:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34885 states. [2025-01-09 05:59:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34885 to 32632. [2025-01-09 05:59:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32632 states, 32630 states have (on average 1.3345694146490958) internal successors, (43547), 32631 states have internal predecessors, (43547), 0 states have call successors, (0), 0 states have 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:59:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32632 states to 32632 states and 43547 transitions. [2025-01-09 05:59:05,251 INFO L78 Accepts]: Start accepts. Automaton has 32632 states and 43547 transitions. Word has length 88 [2025-01-09 05:59:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:05,252 INFO L471 AbstractCegarLoop]: Abstraction has 32632 states and 43547 transitions. [2025-01-09 05:59:05,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:59:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 32632 states and 43547 transitions. [2025-01-09 05:59:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:59:05,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:05,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:05,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:59:05,257 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:05,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:05,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1692723536, now seen corresponding path program 1 times [2025-01-09 05:59:05,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:05,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646019809] [2025-01-09 05:59:05,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:05,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:05,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:59:05,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:59:05,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:05,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:59:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646019809] [2025-01-09 05:59:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646019809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:05,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:05,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:59:05,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600504826] [2025-01-09 05:59:05,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:05,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:59:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:05,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:59:05,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:59:05,479 INFO L87 Difference]: Start difference. First operand 32632 states and 43547 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:59:06,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:06,998 INFO L93 Difference]: Finished difference Result 142856 states and 202019 transitions. [2025-01-09 05:59:06,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:59:06,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 05:59:06,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:07,197 INFO L225 Difference]: With dead ends: 142856 [2025-01-09 05:59:07,197 INFO L226 Difference]: Without dead ends: 127558 [2025-01-09 05:59:07,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:59:07,238 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 9901 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9901 SdHoareTripleChecker+Valid, 4350 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:07,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9901 Valid, 4350 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:59:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127558 states. [2025-01-09 05:59:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127558 to 47928. [2025-01-09 05:59:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47928 states, 47926 states have (on average 1.3639986646079372) internal successors, (65371), 47927 states have internal predecessors, (65371), 0 states have call successors, (0), 0 states have 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:59:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47928 states to 47928 states and 65371 transitions. [2025-01-09 05:59:08,540 INFO L78 Accepts]: Start accepts. Automaton has 47928 states and 65371 transitions. Word has length 104 [2025-01-09 05:59:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:08,541 INFO L471 AbstractCegarLoop]: Abstraction has 47928 states and 65371 transitions. [2025-01-09 05:59:08,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:59:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 47928 states and 65371 transitions. [2025-01-09 05:59:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:59:08,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:08,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:08,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:59:08,546 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:08,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:08,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2119494480, now seen corresponding path program 1 times [2025-01-09 05:59:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:08,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031579614] [2025-01-09 05:59:08,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:08,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:59:08,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:59:08,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:08,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:59:08,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:08,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031579614] [2025-01-09 05:59:08,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031579614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:08,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:08,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:59:08,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714448401] [2025-01-09 05:59:08,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:08,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:59:08,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:08,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:59:08,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:59:08,746 INFO L87 Difference]: Start difference. First operand 47928 states and 65371 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 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:59:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:11,242 INFO L93 Difference]: Finished difference Result 158152 states and 223843 transitions. [2025-01-09 05:59:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:59:11,243 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 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 104 [2025-01-09 05:59:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:11,486 INFO L225 Difference]: With dead ends: 158152 [2025-01-09 05:59:11,487 INFO L226 Difference]: Without dead ends: 142854 [2025-01-09 05:59:11,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:59:11,544 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 9945 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9945 SdHoareTripleChecker+Valid, 4339 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:11,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9945 Valid, 4339 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:59:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142854 states. [2025-01-09 05:59:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142854 to 70904. [2025-01-09 05:59:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70904 states, 70902 states have (on average 1.3814419903528814) internal successors, (97947), 70903 states have internal predecessors, (97947), 0 states have call successors, (0), 0 states have 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:59:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70904 states to 70904 states and 97947 transitions. [2025-01-09 05:59:13,672 INFO L78 Accepts]: Start accepts. Automaton has 70904 states and 97947 transitions. Word has length 104 [2025-01-09 05:59:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:13,672 INFO L471 AbstractCegarLoop]: Abstraction has 70904 states and 97947 transitions. [2025-01-09 05:59:13,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 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:59:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 70904 states and 97947 transitions. [2025-01-09 05:59:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:59:13,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:13,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:13,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:59:13,677 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:13,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:13,678 INFO L85 PathProgramCache]: Analyzing trace with hash -937210800, now seen corresponding path program 1 times [2025-01-09 05:59:13,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:13,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610916556] [2025-01-09 05:59:13,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:13,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:13,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:59:13,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:59:13,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:13,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:59:13,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:13,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610916556] [2025-01-09 05:59:13,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610916556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:13,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:13,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:59:13,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310654976] [2025-01-09 05:59:13,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:13,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:59:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:13,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:59:13,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:59:13,825 INFO L87 Difference]: Start difference. First operand 70904 states and 97947 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:59:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:16,763 INFO L93 Difference]: Finished difference Result 173448 states and 245667 transitions. [2025-01-09 05:59:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:59:16,764 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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 104 [2025-01-09 05:59:16,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:17,008 INFO L225 Difference]: With dead ends: 173448 [2025-01-09 05:59:17,008 INFO L226 Difference]: Without dead ends: 158150 [2025-01-09 05:59:17,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:59:17,057 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 10003 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10003 SdHoareTripleChecker+Valid, 4252 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:17,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10003 Valid, 4252 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:59:17,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158150 states. [2025-01-09 05:59:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158150 to 86200. [2025-01-09 05:59:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86200 states, 86198 states have (on average 1.38948699505789) internal successors, (119771), 86199 states have internal predecessors, (119771), 0 states have call successors, (0), 0 states have 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:59:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86200 states to 86200 states and 119771 transitions. [2025-01-09 05:59:19,493 INFO L78 Accepts]: Start accepts. Automaton has 86200 states and 119771 transitions. Word has length 104 [2025-01-09 05:59:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:19,494 INFO L471 AbstractCegarLoop]: Abstraction has 86200 states and 119771 transitions. [2025-01-09 05:59:19,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:59:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 86200 states and 119771 transitions. [2025-01-09 05:59:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:59:19,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:19,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:19,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:59:19,499 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:19,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:19,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1142287696, now seen corresponding path program 1 times [2025-01-09 05:59:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787741855] [2025-01-09 05:59:19,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:19,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:19,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:59:19,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:59:19,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:19,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 05:59:19,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:19,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787741855] [2025-01-09 05:59:19,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787741855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:19,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:19,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:59:19,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293110954] [2025-01-09 05:59:19,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:19,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:59:19,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:19,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:59:19,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:59:19,632 INFO L87 Difference]: Start difference. First operand 86200 states and 119771 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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:59:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:59:23,191 INFO L93 Difference]: Finished difference Result 188744 states and 267491 transitions. [2025-01-09 05:59:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:59:23,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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 104 [2025-01-09 05:59:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:59:23,462 INFO L225 Difference]: With dead ends: 188744 [2025-01-09 05:59:23,462 INFO L226 Difference]: Without dead ends: 173446 [2025-01-09 05:59:23,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 05:59:23,518 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 10062 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10062 SdHoareTripleChecker+Valid, 4262 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:59:23,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10062 Valid, 4262 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:59:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173446 states. [2025-01-09 05:59:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173446 to 101496. [2025-01-09 05:59:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101496 states, 101494 states have (on average 1.3951070999270894) internal successors, (141595), 101495 states have internal predecessors, (141595), 0 states have call successors, (0), 0 states have 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:59:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101496 states to 101496 states and 141595 transitions. [2025-01-09 05:59:26,335 INFO L78 Accepts]: Start accepts. Automaton has 101496 states and 141595 transitions. Word has length 104 [2025-01-09 05:59:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:59:26,335 INFO L471 AbstractCegarLoop]: Abstraction has 101496 states and 141595 transitions. [2025-01-09 05:59:26,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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:59:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 101496 states and 141595 transitions. [2025-01-09 05:59:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:59:26,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:59:26,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:59:26,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:59:26,340 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:59:26,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:59:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1371746736, now seen corresponding path program 1 times [2025-01-09 05:59:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:59:26,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062131783] [2025-01-09 05:59:26,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:59:26,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:59:26,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:59:26,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:59:26,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:59:26,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:59:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:59:26,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:59:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062131783] [2025-01-09 05:59:26,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062131783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:59:26,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:59:26,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 05:59:26,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805709192] [2025-01-09 05:59:26,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:59:26,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:59:26,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:59:26,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:59:26,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:59:26,549 INFO L87 Difference]: Start difference. First operand 101496 states and 141595 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 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)