./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i --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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i -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 7ff62df6f9603281bf0e236ab8865fc937b3dc90e8a1704cf1768013825b0923 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:03:57,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:03:58,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:03:58,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:03:58,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:03:58,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:03:58,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:03:58,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:03:58,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:03:58,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:03:58,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:03:58,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:03:58,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:03:58,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:03:58,055 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:03:58,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:03:58,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:03:58,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:03:58,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:03:58,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:03:58,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:03:58,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:03:58,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:03:58,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:03:58,057 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:03:58,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:03:58,057 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:03:58,057 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:03:58,057 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:03:58,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:03:58,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:03:58,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:03:58,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:03:58,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:03:58,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:03:58,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:03:58,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:03:58,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:03:58,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:03:58,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:03:58,058 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:03:58,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:03:58,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:03:58,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:03:58,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:03:58,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:03:58,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:03:58,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:03:58,059 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 -> 7ff62df6f9603281bf0e236ab8865fc937b3dc90e8a1704cf1768013825b0923 [2025-01-09 12:03:58,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:03:58,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:03:58,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:03:58,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:03:58,408 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:03:58,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i [2025-01-09 12:03:59,771 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ea7aaa87/4d9b85853041412aa5dc9e442ec4ea31/FLAGf884423c4 [2025-01-09 12:04:00,074 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:04:00,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i [2025-01-09 12:04:00,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ea7aaa87/4d9b85853041412aa5dc9e442ec4ea31/FLAGf884423c4 [2025-01-09 12:04:00,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ea7aaa87/4d9b85853041412aa5dc9e442ec4ea31 [2025-01-09 12:04:00,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:04:00,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:04:00,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:04:00,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:04:00,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:04:00,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7575d929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00, skipping insertion in model container [2025-01-09 12:04:00,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:04:00,269 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i[918,931] [2025-01-09 12:04:00,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:04:00,360 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:04:00,372 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i[918,931] [2025-01-09 12:04:00,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:04:00,426 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:04:00,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00 WrapperNode [2025-01-09 12:04:00,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:04:00,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:04:00,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:04:00,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:04:00,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,498 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 271 [2025-01-09 12:04:00,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:04:00,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:04:00,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:04:00,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:04:00,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,534 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 12:04:00,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:04:00,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:04:00,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:04:00,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:04:00,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (1/1) ... [2025-01-09 12:04:00,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:04:00,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:04:00,614 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 12:04:00,619 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 12:04:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:04:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:04:00,641 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:04:00,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:04:00,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:04:00,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:04:00,728 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:04:00,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:04:01,236 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 12:04:01,237 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:04:01,247 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:04:01,248 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:04:01,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:04:01 BoogieIcfgContainer [2025-01-09 12:04:01,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:04:01,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:04:01,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:04:01,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:04:01,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:04:00" (1/3) ... [2025-01-09 12:04:01,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5895da64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:04:01, skipping insertion in model container [2025-01-09 12:04:01,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:04:00" (2/3) ... [2025-01-09 12:04:01,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5895da64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:04:01, skipping insertion in model container [2025-01-09 12:04:01,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:04:01" (3/3) ... [2025-01-09 12:04:01,258 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i [2025-01-09 12:04:01,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:04:01,273 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-3.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:04:01,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:04:01,341 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;@46aa4dbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:04:01,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:04:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 12:04:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 12:04:01,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:01,364 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:01,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:01,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1992375825, now seen corresponding path program 1 times [2025-01-09 12:04:01,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:01,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817642743] [2025-01-09 12:04:01,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:01,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:01,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 12:04:01,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 12:04:01,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:01,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 12:04:01,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:01,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817642743] [2025-01-09 12:04:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817642743] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:04:01,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867696323] [2025-01-09 12:04:01,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:01,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:04:01,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:04:01,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:04:01,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:04:01,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 12:04:01,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 12:04:01,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:01,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:01,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:04:01,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:04:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 12:04:01,990 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:04:01,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867696323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:01,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:04:01,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:04:01,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828566583] [2025-01-09 12:04:01,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:01,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:04:01,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:02,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:04:02,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:04:02,016 INFO L87 Difference]: Start difference. First operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 12:04:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:02,050 INFO L93 Difference]: Finished difference Result 238 states and 421 transitions. [2025-01-09 12:04:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:04:02,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 221 [2025-01-09 12:04:02,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:02,058 INFO L225 Difference]: With dead ends: 238 [2025-01-09 12:04:02,058 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 12:04:02,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:04:02,064 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:02,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:04:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 12:04:02,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 12:04:02,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 83 states have internal predecessors, (122), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 12:04:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 190 transitions. [2025-01-09 12:04:02,109 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 190 transitions. Word has length 221 [2025-01-09 12:04:02,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:02,110 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 190 transitions. [2025-01-09 12:04:02,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 12:04:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 190 transitions. [2025-01-09 12:04:02,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 12:04:02,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:02,116 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:02,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:04:02,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:04:02,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:02,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1431143079, now seen corresponding path program 1 times [2025-01-09 12:04:02,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:02,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926375549] [2025-01-09 12:04:02,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:02,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:02,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 12:04:02,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 12:04:02,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:02,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:02,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:02,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926375549] [2025-01-09 12:04:02,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926375549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:02,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:02,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:04:02,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423166641] [2025-01-09 12:04:02,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:02,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:04:02,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:02,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:04:02,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:02,753 INFO L87 Difference]: Start difference. First operand 119 states and 190 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:02,948 INFO L93 Difference]: Finished difference Result 352 states and 566 transitions. [2025-01-09 12:04:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:04:02,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 221 [2025-01-09 12:04:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:02,954 INFO L225 Difference]: With dead ends: 352 [2025-01-09 12:04:02,956 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 12:04:02,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:02,958 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 127 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:02,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 475 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:04:02,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 12:04:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2025-01-09 12:04:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 12:04:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 375 transitions. [2025-01-09 12:04:02,994 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 375 transitions. Word has length 221 [2025-01-09 12:04:02,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:02,994 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 375 transitions. [2025-01-09 12:04:02,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 375 transitions. [2025-01-09 12:04:02,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 12:04:02,997 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:02,997 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:02,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:04:02,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:02,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1312604316, now seen corresponding path program 1 times [2025-01-09 12:04:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:02,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43366290] [2025-01-09 12:04:02,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:02,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:03,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 12:04:03,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 12:04:03,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:03,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:03,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:03,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43366290] [2025-01-09 12:04:03,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43366290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:03,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:03,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:04:03,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777070294] [2025-01-09 12:04:03,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:03,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:04:03,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:03,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:04:03,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:04:03,325 INFO L87 Difference]: Start difference. First operand 233 states and 375 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:03,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:03,419 INFO L93 Difference]: Finished difference Result 693 states and 1119 transitions. [2025-01-09 12:04:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:04:03,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2025-01-09 12:04:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:03,426 INFO L225 Difference]: With dead ends: 693 [2025-01-09 12:04:03,428 INFO L226 Difference]: Without dead ends: 463 [2025-01-09 12:04:03,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 12:04:03,432 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 108 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:03,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 345 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:04:03,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-01-09 12:04:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2025-01-09 12:04:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 320 states have (on average 1.45625) internal successors, (466), 320 states have internal predecessors, (466), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-01-09 12:04:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 738 transitions. [2025-01-09 12:04:03,514 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 738 transitions. Word has length 222 [2025-01-09 12:04:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:03,518 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 738 transitions. [2025-01-09 12:04:03,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 738 transitions. [2025-01-09 12:04:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 12:04:03,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:03,524 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:03,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:04:03,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:03,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1888755029, now seen corresponding path program 1 times [2025-01-09 12:04:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:03,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727528144] [2025-01-09 12:04:03,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:03,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 12:04:03,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 12:04:03,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:03,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:03,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:03,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727528144] [2025-01-09 12:04:03,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727528144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:03,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:03,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:04:03,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127624894] [2025-01-09 12:04:03,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:03,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:04:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:03,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:04:03,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:04:03,703 INFO L87 Difference]: Start difference. First operand 461 states and 738 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:03,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:03,839 INFO L93 Difference]: Finished difference Result 1349 states and 2170 transitions. [2025-01-09 12:04:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:04:03,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2025-01-09 12:04:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:03,849 INFO L225 Difference]: With dead ends: 1349 [2025-01-09 12:04:03,850 INFO L226 Difference]: Without dead ends: 891 [2025-01-09 12:04:03,852 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 12:04:03,853 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 169 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:03,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 468 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:04:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-01-09 12:04:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2025-01-09 12:04:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 608 states have (on average 1.4375) internal successors, (874), 608 states have internal predecessors, (874), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-01-09 12:04:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1418 transitions. [2025-01-09 12:04:03,944 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1418 transitions. Word has length 223 [2025-01-09 12:04:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:03,944 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1418 transitions. [2025-01-09 12:04:03,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1418 transitions. [2025-01-09 12:04:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 12:04:03,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:03,948 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:03,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:04:03,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:03,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1370933253, now seen corresponding path program 1 times [2025-01-09 12:04:03,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:03,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601776244] [2025-01-09 12:04:03,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:03,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 12:04:03,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 12:04:03,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:03,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:04,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:04,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601776244] [2025-01-09 12:04:04,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601776244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:04,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:04,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:04:04,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009665247] [2025-01-09 12:04:04,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:04,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:04:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:04,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:04:04,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:04:04,074 INFO L87 Difference]: Start difference. First operand 889 states and 1418 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:04,156 INFO L93 Difference]: Finished difference Result 2009 states and 3178 transitions. [2025-01-09 12:04:04,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:04:04,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2025-01-09 12:04:04,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:04,166 INFO L225 Difference]: With dead ends: 2009 [2025-01-09 12:04:04,166 INFO L226 Difference]: Without dead ends: 1123 [2025-01-09 12:04:04,171 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 12:04:04,173 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 43 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:04,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 392 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:04:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2025-01-09 12:04:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 961. [2025-01-09 12:04:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 680 states have (on average 1.438235294117647) internal successors, (978), 680 states have internal predecessors, (978), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-01-09 12:04:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1522 transitions. [2025-01-09 12:04:04,276 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1522 transitions. Word has length 223 [2025-01-09 12:04:04,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:04,276 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1522 transitions. [2025-01-09 12:04:04,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1522 transitions. [2025-01-09 12:04:04,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 12:04:04,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:04,282 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:04,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:04:04,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:04,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2057382752, now seen corresponding path program 1 times [2025-01-09 12:04:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:04,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067634541] [2025-01-09 12:04:04,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:04,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 12:04:04,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 12:04:04,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:04,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:04,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:04,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067634541] [2025-01-09 12:04:04,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067634541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:04,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:04:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822928277] [2025-01-09 12:04:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:04,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:04:04,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:04,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:04:04,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:04,510 INFO L87 Difference]: Start difference. First operand 961 states and 1522 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:04,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:04,861 INFO L93 Difference]: Finished difference Result 3503 states and 5573 transitions. [2025-01-09 12:04:04,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:04:04,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-01-09 12:04:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:04,879 INFO L225 Difference]: With dead ends: 3503 [2025-01-09 12:04:04,880 INFO L226 Difference]: Without dead ends: 2455 [2025-01-09 12:04:04,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:04,885 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 335 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:04,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 544 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:04:04,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2025-01-09 12:04:05,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2451. [2025-01-09 12:04:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2451 states, 1750 states have (on average 1.44) internal successors, (2520), 1750 states have internal predecessors, (2520), 680 states have call successors, (680), 20 states have call predecessors, (680), 20 states have return successors, (680), 680 states have call predecessors, (680), 680 states have call successors, (680) [2025-01-09 12:04:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 3880 transitions. [2025-01-09 12:04:05,060 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 3880 transitions. Word has length 224 [2025-01-09 12:04:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:05,061 INFO L471 AbstractCegarLoop]: Abstraction has 2451 states and 3880 transitions. [2025-01-09 12:04:05,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 3880 transitions. [2025-01-09 12:04:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 12:04:05,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:05,080 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:05,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:04:05,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:05,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:05,081 INFO L85 PathProgramCache]: Analyzing trace with hash 238265804, now seen corresponding path program 1 times [2025-01-09 12:04:05,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:05,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299908393] [2025-01-09 12:04:05,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:05,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:05,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 12:04:05,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 12:04:05,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:05,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:05,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:05,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299908393] [2025-01-09 12:04:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299908393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:05,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:05,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:04:05,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714540724] [2025-01-09 12:04:05,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:05,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:04:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:05,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:04:05,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:05,334 INFO L87 Difference]: Start difference. First operand 2451 states and 3880 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:06,247 INFO L93 Difference]: Finished difference Result 6595 states and 10450 transitions. [2025-01-09 12:04:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:04:06,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-01-09 12:04:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:06,283 INFO L225 Difference]: With dead ends: 6595 [2025-01-09 12:04:06,283 INFO L226 Difference]: Without dead ends: 5103 [2025-01-09 12:04:06,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 12:04:06,292 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 500 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:06,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 359 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:04:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5103 states. [2025-01-09 12:04:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5103 to 4141. [2025-01-09 12:04:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4141 states, 2880 states have (on average 1.4131944444444444) internal successors, (4070), 2880 states have internal predecessors, (4070), 1224 states have call successors, (1224), 36 states have call predecessors, (1224), 36 states have return successors, (1224), 1224 states have call predecessors, (1224), 1224 states have call successors, (1224) [2025-01-09 12:04:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 6518 transitions. [2025-01-09 12:04:06,672 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 6518 transitions. Word has length 224 [2025-01-09 12:04:06,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:06,673 INFO L471 AbstractCegarLoop]: Abstraction has 4141 states and 6518 transitions. [2025-01-09 12:04:06,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 6518 transitions. [2025-01-09 12:04:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 12:04:06,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:06,675 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:06,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:04:06,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:06,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash 489623884, now seen corresponding path program 1 times [2025-01-09 12:04:06,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:06,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128057607] [2025-01-09 12:04:06,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:06,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:06,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 12:04:06,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 12:04:06,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:06,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:06,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:06,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128057607] [2025-01-09 12:04:06,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128057607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:06,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:06,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:04:06,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239366609] [2025-01-09 12:04:06,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:06,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:04:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:06,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:04:06,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:04:06,903 INFO L87 Difference]: Start difference. First operand 4141 states and 6518 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:07,393 INFO L93 Difference]: Finished difference Result 12417 states and 19548 transitions. [2025-01-09 12:04:07,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:04:07,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 225 [2025-01-09 12:04:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:07,447 INFO L225 Difference]: With dead ends: 12417 [2025-01-09 12:04:07,447 INFO L226 Difference]: Without dead ends: 8279 [2025-01-09 12:04:07,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:04:07,464 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 128 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:07,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 349 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:04:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8279 states. [2025-01-09 12:04:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8279 to 8241. [2025-01-09 12:04:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8241 states, 5720 states have (on average 1.4104895104895105) internal successors, (8068), 5720 states have internal predecessors, (8068), 2448 states have call successors, (2448), 72 states have call predecessors, (2448), 72 states have return successors, (2448), 2448 states have call predecessors, (2448), 2448 states have call successors, (2448) [2025-01-09 12:04:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8241 states to 8241 states and 12964 transitions. [2025-01-09 12:04:08,167 INFO L78 Accepts]: Start accepts. Automaton has 8241 states and 12964 transitions. Word has length 225 [2025-01-09 12:04:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:08,168 INFO L471 AbstractCegarLoop]: Abstraction has 8241 states and 12964 transitions. [2025-01-09 12:04:08,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 8241 states and 12964 transitions. [2025-01-09 12:04:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-01-09 12:04:08,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:08,175 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:08,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:04:08,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:08,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:08,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1307959461, now seen corresponding path program 1 times [2025-01-09 12:04:08,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:08,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428785714] [2025-01-09 12:04:08,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:08,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-01-09 12:04:08,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-01-09 12:04:08,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:08,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:08,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:08,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428785714] [2025-01-09 12:04:08,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428785714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:08,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:08,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:04:08,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832972197] [2025-01-09 12:04:08,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:08,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:04:08,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:08,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:04:08,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:04:08,403 INFO L87 Difference]: Start difference. First operand 8241 states and 12964 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:09,101 INFO L93 Difference]: Finished difference Result 20687 states and 32596 transitions. [2025-01-09 12:04:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:04:09,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 226 [2025-01-09 12:04:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:09,192 INFO L225 Difference]: With dead ends: 20687 [2025-01-09 12:04:09,192 INFO L226 Difference]: Without dead ends: 12449 [2025-01-09 12:04:09,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 12:04:09,223 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 122 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:09,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 366 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:04:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12449 states. [2025-01-09 12:04:10,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12449 to 12447. [2025-01-09 12:04:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12447 states, 8666 states have (on average 1.4043387952919455) internal successors, (12170), 8666 states have internal predecessors, (12170), 3672 states have call successors, (3672), 108 states have call predecessors, (3672), 108 states have return successors, (3672), 3672 states have call predecessors, (3672), 3672 states have call successors, (3672) [2025-01-09 12:04:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12447 states to 12447 states and 19514 transitions. [2025-01-09 12:04:10,290 INFO L78 Accepts]: Start accepts. Automaton has 12447 states and 19514 transitions. Word has length 226 [2025-01-09 12:04:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:10,291 INFO L471 AbstractCegarLoop]: Abstraction has 12447 states and 19514 transitions. [2025-01-09 12:04:10,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 12447 states and 19514 transitions. [2025-01-09 12:04:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 12:04:10,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:10,295 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:10,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:04:10,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:10,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:10,296 INFO L85 PathProgramCache]: Analyzing trace with hash -845864651, now seen corresponding path program 1 times [2025-01-09 12:04:10,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:10,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251667143] [2025-01-09 12:04:10,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:10,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:10,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 12:04:10,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 12:04:10,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:10,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:10,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:10,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251667143] [2025-01-09 12:04:10,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251667143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:10,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:10,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:04:10,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61797994] [2025-01-09 12:04:10,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:10,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:04:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:10,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:04:10,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:04:10,410 INFO L87 Difference]: Start difference. First operand 12447 states and 19514 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:11,127 INFO L93 Difference]: Finished difference Result 24941 states and 39122 transitions. [2025-01-09 12:04:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:04:11,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 227 [2025-01-09 12:04:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:11,206 INFO L225 Difference]: With dead ends: 24941 [2025-01-09 12:04:11,206 INFO L226 Difference]: Without dead ends: 12497 [2025-01-09 12:04:11,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:04:11,253 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 122 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:11,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 476 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:04:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2025-01-09 12:04:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 12447. [2025-01-09 12:04:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12447 states, 8666 states have (on average 1.4006462035541196) internal successors, (12138), 8666 states have internal predecessors, (12138), 3672 states have call successors, (3672), 108 states have call predecessors, (3672), 108 states have return successors, (3672), 3672 states have call predecessors, (3672), 3672 states have call successors, (3672) [2025-01-09 12:04:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12447 states to 12447 states and 19482 transitions. [2025-01-09 12:04:11,945 INFO L78 Accepts]: Start accepts. Automaton has 12447 states and 19482 transitions. Word has length 227 [2025-01-09 12:04:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:11,946 INFO L471 AbstractCegarLoop]: Abstraction has 12447 states and 19482 transitions. [2025-01-09 12:04:11,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 12447 states and 19482 transitions. [2025-01-09 12:04:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 12:04:11,948 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:11,949 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:11,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:04:11,949 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:11,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:11,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1698993016, now seen corresponding path program 1 times [2025-01-09 12:04:11,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:11,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768965184] [2025-01-09 12:04:11,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:11,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 12:04:11,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 12:04:11,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:11,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:12,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:12,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768965184] [2025-01-09 12:04:12,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768965184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:12,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:12,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:04:12,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796250614] [2025-01-09 12:04:12,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:12,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:04:12,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:12,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:04:12,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:04:12,261 INFO L87 Difference]: Start difference. First operand 12447 states and 19482 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:14,355 INFO L93 Difference]: Finished difference Result 40465 states and 63387 transitions. [2025-01-09 12:04:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:04:14,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-01-09 12:04:14,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:14,497 INFO L225 Difference]: With dead ends: 40465 [2025-01-09 12:04:14,497 INFO L226 Difference]: Without dead ends: 28021 [2025-01-09 12:04:14,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:04:14,550 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 610 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:14,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 704 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:04:14,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28021 states. [2025-01-09 12:04:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28021 to 16109. [2025-01-09 12:04:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16109 states, 11542 states have (on average 1.4170854271356783) internal successors, (16356), 11600 states have internal predecessors, (16356), 4414 states have call successors, (4414), 152 states have call predecessors, (4414), 152 states have return successors, (4414), 4356 states have call predecessors, (4414), 4414 states have call successors, (4414) [2025-01-09 12:04:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16109 states to 16109 states and 25184 transitions. [2025-01-09 12:04:15,831 INFO L78 Accepts]: Start accepts. Automaton has 16109 states and 25184 transitions. Word has length 228 [2025-01-09 12:04:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:15,831 INFO L471 AbstractCegarLoop]: Abstraction has 16109 states and 25184 transitions. [2025-01-09 12:04:15,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:15,832 INFO L276 IsEmpty]: Start isEmpty. Operand 16109 states and 25184 transitions. [2025-01-09 12:04:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 12:04:15,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:15,835 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:15,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:04:15,835 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:15,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1558444406, now seen corresponding path program 1 times [2025-01-09 12:04:15,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:15,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773769405] [2025-01-09 12:04:15,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:15,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:15,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 12:04:15,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 12:04:15,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:15,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773769405] [2025-01-09 12:04:16,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773769405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:16,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:16,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:04:16,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596373341] [2025-01-09 12:04:16,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:16,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:04:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:16,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:04:16,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:04:16,048 INFO L87 Difference]: Start difference. First operand 16109 states and 25184 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:17,378 INFO L93 Difference]: Finished difference Result 38603 states and 60238 transitions. [2025-01-09 12:04:17,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:04:17,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-01-09 12:04:17,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:17,498 INFO L225 Difference]: With dead ends: 38603 [2025-01-09 12:04:17,498 INFO L226 Difference]: Without dead ends: 22497 [2025-01-09 12:04:17,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:04:17,542 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 124 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:17,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 352 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:04:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22497 states. [2025-01-09 12:04:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22497 to 22435. [2025-01-09 12:04:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22435 states, 16044 states have (on average 1.4099975068561457) internal successors, (22622), 16134 states have internal predecessors, (22622), 6174 states have call successors, (6174), 216 states have call predecessors, (6174), 216 states have return successors, (6174), 6084 states have call predecessors, (6174), 6174 states have call successors, (6174) [2025-01-09 12:04:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22435 states to 22435 states and 34970 transitions. [2025-01-09 12:04:19,780 INFO L78 Accepts]: Start accepts. Automaton has 22435 states and 34970 transitions. Word has length 228 [2025-01-09 12:04:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:19,781 INFO L471 AbstractCegarLoop]: Abstraction has 22435 states and 34970 transitions. [2025-01-09 12:04:19,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 22435 states and 34970 transitions. [2025-01-09 12:04:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 12:04:19,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:19,784 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:19,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:04:19,784 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:19,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:19,786 INFO L85 PathProgramCache]: Analyzing trace with hash 294757716, now seen corresponding path program 1 times [2025-01-09 12:04:19,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:19,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698291578] [2025-01-09 12:04:19,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:19,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:19,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 12:04:19,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 12:04:19,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:19,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-01-09 12:04:20,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:20,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698291578] [2025-01-09 12:04:20,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698291578] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:04:20,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971515882] [2025-01-09 12:04:20,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:20,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:04:20,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:04:20,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:04:20,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:04:20,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 12:04:20,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 12:04:20,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:20,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:20,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 12:04:20,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:04:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-01-09 12:04:20,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:04:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-01-09 12:04:20,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971515882] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:04:20,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:04:20,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 12:04:20,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857418129] [2025-01-09 12:04:20,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:04:20,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:04:20,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:20,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:04:20,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:04:20,672 INFO L87 Difference]: Start difference. First operand 22435 states and 34970 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-01-09 12:04:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:22,378 INFO L93 Difference]: Finished difference Result 42461 states and 65105 transitions. [2025-01-09 12:04:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:04:22,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 229 [2025-01-09 12:04:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:22,502 INFO L225 Difference]: With dead ends: 42461 [2025-01-09 12:04:22,502 INFO L226 Difference]: Without dead ends: 20029 [2025-01-09 12:04:22,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:04:22,564 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 626 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:22,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 461 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:04:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20029 states. [2025-01-09 12:04:24,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20029 to 17451. [2025-01-09 12:04:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17451 states, 12404 states have (on average 1.3828603676233473) internal successors, (17153), 12424 states have internal predecessors, (17153), 4704 states have call successors, (4704), 342 states have call predecessors, (4704), 342 states have return successors, (4704), 4684 states have call predecessors, (4704), 4704 states have call successors, (4704) [2025-01-09 12:04:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17451 states to 17451 states and 26561 transitions. [2025-01-09 12:04:24,465 INFO L78 Accepts]: Start accepts. Automaton has 17451 states and 26561 transitions. Word has length 229 [2025-01-09 12:04:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:24,468 INFO L471 AbstractCegarLoop]: Abstraction has 17451 states and 26561 transitions. [2025-01-09 12:04:24,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2025-01-09 12:04:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 17451 states and 26561 transitions. [2025-01-09 12:04:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 12:04:24,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:24,472 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:24,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:04:24,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:04:24,673 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:24,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash -596356560, now seen corresponding path program 1 times [2025-01-09 12:04:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:24,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037678550] [2025-01-09 12:04:24,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:24,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 12:04:24,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 12:04:24,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:24,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:25,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:25,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:25,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037678550] [2025-01-09 12:04:25,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037678550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:25,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:25,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:04:25,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534632411] [2025-01-09 12:04:25,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:25,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:04:25,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:25,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:04:25,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:04:25,166 INFO L87 Difference]: Start difference. First operand 17451 states and 26561 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:29,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:29,070 INFO L93 Difference]: Finished difference Result 49801 states and 75696 transitions. [2025-01-09 12:04:29,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:04:29,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 230 [2025-01-09 12:04:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:29,229 INFO L225 Difference]: With dead ends: 49801 [2025-01-09 12:04:29,229 INFO L226 Difference]: Without dead ends: 32353 [2025-01-09 12:04:29,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:04:29,279 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 606 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:29,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 607 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 12:04:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32353 states. [2025-01-09 12:04:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32353 to 25945. [2025-01-09 12:04:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25945 states, 18502 states have (on average 1.3806615501026915) internal successors, (25545), 18568 states have internal predecessors, (25545), 6962 states have call successors, (6962), 480 states have call predecessors, (6962), 480 states have return successors, (6962), 6896 states have call predecessors, (6962), 6962 states have call successors, (6962) [2025-01-09 12:04:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25945 states to 25945 states and 39469 transitions. [2025-01-09 12:04:31,087 INFO L78 Accepts]: Start accepts. Automaton has 25945 states and 39469 transitions. Word has length 230 [2025-01-09 12:04:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:31,088 INFO L471 AbstractCegarLoop]: Abstraction has 25945 states and 39469 transitions. [2025-01-09 12:04:31,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 25945 states and 39469 transitions. [2025-01-09 12:04:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 12:04:31,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:31,090 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:31,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:04:31,090 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:31,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash -534316946, now seen corresponding path program 1 times [2025-01-09 12:04:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:31,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719072934] [2025-01-09 12:04:31,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:31,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 12:04:31,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 12:04:31,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:31,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 12:04:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:31,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719072934] [2025-01-09 12:04:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719072934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:04:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:04:31,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:04:31,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237188079] [2025-01-09 12:04:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:04:31,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:04:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:04:31,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:04:31,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:04:31,483 INFO L87 Difference]: Start difference. First operand 25945 states and 39469 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:04:34,582 INFO L93 Difference]: Finished difference Result 53694 states and 81688 transitions. [2025-01-09 12:04:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:04:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 230 [2025-01-09 12:04:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:04:34,827 INFO L225 Difference]: With dead ends: 53694 [2025-01-09 12:04:34,827 INFO L226 Difference]: Without dead ends: 27752 [2025-01-09 12:04:34,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:04:34,933 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 319 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:04:34,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 574 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:04:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27752 states. [2025-01-09 12:04:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27752 to 26418. [2025-01-09 12:04:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26418 states, 18843 states have (on average 1.378018362256541) internal successors, (25966), 18915 states have internal predecessors, (25966), 7088 states have call successors, (7088), 486 states have call predecessors, (7088), 486 states have return successors, (7088), 7016 states have call predecessors, (7088), 7088 states have call successors, (7088) [2025-01-09 12:04:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26418 states to 26418 states and 40142 transitions. [2025-01-09 12:04:37,044 INFO L78 Accepts]: Start accepts. Automaton has 26418 states and 40142 transitions. Word has length 230 [2025-01-09 12:04:37,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:04:37,045 INFO L471 AbstractCegarLoop]: Abstraction has 26418 states and 40142 transitions. [2025-01-09 12:04:37,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 12:04:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 26418 states and 40142 transitions. [2025-01-09 12:04:37,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-09 12:04:37,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:04:37,047 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:37,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 12:04:37,047 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:04:37,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:04:37,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1704891311, now seen corresponding path program 1 times [2025-01-09 12:04:37,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:04:37,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62626957] [2025-01-09 12:04:37,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:37,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:04:37,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 12:04:37,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 12:04:37,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:37,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 75 proven. 117 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2025-01-09 12:04:38,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:04:38,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62626957] [2025-01-09 12:04:38,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62626957] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:04:38,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660092440] [2025-01-09 12:04:38,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:04:38,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:04:38,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:04:38,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:04:38,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 12:04:38,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 12:04:38,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 12:04:38,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:04:38,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:04:38,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 12:04:38,171 INFO L279 TraceCheckSpWp]: Computing forward predicates...