./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-98.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_fillercodesize_ps-cn-250_file-98.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 a92f5d1a6a5590db64f6b8ed4b8fabeff75b2e4cde71258ed22ec8ba2c9c0069 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:49:24,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:49:24,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:49:24,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:49:24,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:49:24,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:49:24,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:49:24,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:49:24,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:49:24,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:49:24,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:49:24,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:49:24,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:49:24,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:49:24,275 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:49:24,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:49:24,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:49:24,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:49:24,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:49:24,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:49:24,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:49:24,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:49:24,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:49:24,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:49:24,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:49:24,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:49:24,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:49:24,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:49:24,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:49:24,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:49:24,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:49:24,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:49:24,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:49:24,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:49:24,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:49:24,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:49:24,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:49:24,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:49:24,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:49:24,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:49:24,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:49:24,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:49:24,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:49:24,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:49:24,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:49:24,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:49:24,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:49:24,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:49:24,279 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 -> a92f5d1a6a5590db64f6b8ed4b8fabeff75b2e4cde71258ed22ec8ba2c9c0069 [2025-01-09 09:49:24,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:49:24,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:49:24,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:49:24,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:49:24,517 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:49:24,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-98.i [2025-01-09 09:49:25,623 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b74bd321/446b489dd192442ba5a191d38a952c79/FLAG4cb2886be [2025-01-09 09:49:25,939 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:49:25,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-98.i [2025-01-09 09:49:25,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b74bd321/446b489dd192442ba5a191d38a952c79/FLAG4cb2886be [2025-01-09 09:49:25,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b74bd321/446b489dd192442ba5a191d38a952c79 [2025-01-09 09:49:25,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:49:25,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:49:25,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:49:25,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:49:25,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:49:25,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:49:25" (1/1) ... [2025-01-09 09:49:25,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b8eea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:25, skipping insertion in model container [2025-01-09 09:49:25,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:49:25" (1/1) ... [2025-01-09 09:49:26,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:49:26,142 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_fillercodesize_ps-cn-250_file-98.i[916,929] [2025-01-09 09:49:26,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:49:26,242 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:49:26,249 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_fillercodesize_ps-cn-250_file-98.i[916,929] [2025-01-09 09:49:26,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:49:26,309 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:49:26,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26 WrapperNode [2025-01-09 09:49:26,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:49:26,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:49:26,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:49:26,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:49:26,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,330 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,380 INFO L138 Inliner]: procedures = 26, calls = 100, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 559 [2025-01-09 09:49:26,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:49:26,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:49:26,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:49:26,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:49:26,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,423 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 09:49:26,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:49:26,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:49:26,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:49:26,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:49:26,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (1/1) ... [2025-01-09 09:49:26,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:49:26,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:26,528 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 09:49:26,537 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 09:49:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:49:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:49:26,562 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:49:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:49:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:49:26,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:49:26,695 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:49:26,700 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:49:27,314 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 09:49:27,315 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:49:27,330 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:49:27,331 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:49:27,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:49:27 BoogieIcfgContainer [2025-01-09 09:49:27,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:49:27,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:49:27,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:49:27,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:49:27,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:49:25" (1/3) ... [2025-01-09 09:49:27,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34361c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:49:27, skipping insertion in model container [2025-01-09 09:49:27,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:49:26" (2/3) ... [2025-01-09 09:49:27,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34361c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:49:27, skipping insertion in model container [2025-01-09 09:49:27,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:49:27" (3/3) ... [2025-01-09 09:49:27,340 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-98.i [2025-01-09 09:49:27,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:49:27,352 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-98.i that has 2 procedures, 242 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:49:27,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:49:27,398 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;@57a3f142, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:49:27,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:49:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 152 states have (on average 1.5) internal successors, (228), 153 states have internal predecessors, (228), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 09:49:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-01-09 09:49:27,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:27,420 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:27,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:27,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash -803298862, now seen corresponding path program 1 times [2025-01-09 09:49:27,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:27,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207430976] [2025-01-09 09:49:27,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:27,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:27,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-01-09 09:49:27,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-01-09 09:49:27,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:27,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2025-01-09 09:49:27,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207430976] [2025-01-09 09:49:27,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207430976] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:49:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9386110] [2025-01-09 09:49:27,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:27,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:49:27,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:49:27,959 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 09:49:27,962 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 09:49:28,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-01-09 09:49:28,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-01-09 09:49:28,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:28,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:28,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:49:28,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:49:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2025-01-09 09:49:28,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:49:28,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9386110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:28,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:49:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:49:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650548087] [2025-01-09 09:49:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:28,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:49:28,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:28,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:49:28,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:49:28,291 INFO L87 Difference]: Start difference. First operand has 242 states, 152 states have (on average 1.5) internal successors, (228), 153 states have internal predecessors, (228), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) [2025-01-09 09:49:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:28,331 INFO L93 Difference]: Finished difference Result 475 states and 880 transitions. [2025-01-09 09:49:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:49:28,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) Word has length 535 [2025-01-09 09:49:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:28,338 INFO L225 Difference]: With dead ends: 475 [2025-01-09 09:49:28,338 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 09:49:28,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 536 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 09:49:28,343 INFO L435 NwaCegarLoop]: 389 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, 389 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 09:49:28,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:49:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 09:49:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-01-09 09:49:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 147 states have (on average 1.4625850340136055) internal successors, (215), 147 states have internal predecessors, (215), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 09:49:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 389 transitions. [2025-01-09 09:49:28,405 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 389 transitions. Word has length 535 [2025-01-09 09:49:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:28,405 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 389 transitions. [2025-01-09 09:49:28,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) [2025-01-09 09:49:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 389 transitions. [2025-01-09 09:49:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:49:28,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:28,413 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:28,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:49:28,613 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 09:49:28,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:28,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash -687053504, now seen corresponding path program 1 times [2025-01-09 09:49:28,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:28,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776131383] [2025-01-09 09:49:28,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:28,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:49:28,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:49:28,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:28,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 09:49:29,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:29,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776131383] [2025-01-09 09:49:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776131383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:29,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:49:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539032518] [2025-01-09 09:49:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:29,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:49:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:29,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:49:29,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:49:29,524 INFO L87 Difference]: Start difference. First operand 236 states and 389 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 09:49:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:29,557 INFO L93 Difference]: Finished difference Result 470 states and 777 transitions. [2025-01-09 09:49:29,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:49:29,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 536 [2025-01-09 09:49:29,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:29,561 INFO L225 Difference]: With dead ends: 470 [2025-01-09 09:49:29,561 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 09:49:29,562 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 09:49:29,562 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 0 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:29,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 770 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:49:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 09:49:29,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-01-09 09:49:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 148 states have (on average 1.4594594594594594) internal successors, (216), 148 states have internal predecessors, (216), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 09:49:29,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 390 transitions. [2025-01-09 09:49:29,599 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 390 transitions. Word has length 536 [2025-01-09 09:49:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:29,602 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 390 transitions. [2025-01-09 09:49:29,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 09:49:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 390 transitions. [2025-01-09 09:49:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:49:29,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:29,609 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:29,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:49:29,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:29,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:29,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1307091202, now seen corresponding path program 1 times [2025-01-09 09:49:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:29,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182772536] [2025-01-09 09:49:29,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:29,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:29,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:49:29,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:49:29,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:29,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 09:49:30,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:30,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182772536] [2025-01-09 09:49:30,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182772536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:30,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:30,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:49:30,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287120559] [2025-01-09 09:49:30,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:30,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:49:30,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:30,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:49:30,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:49:30,593 INFO L87 Difference]: Start difference. First operand 237 states and 390 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 09:49:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:30,687 INFO L93 Difference]: Finished difference Result 682 states and 1129 transitions. [2025-01-09 09:49:30,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:49:30,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 536 [2025-01-09 09:49:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:30,694 INFO L225 Difference]: With dead ends: 682 [2025-01-09 09:49:30,696 INFO L226 Difference]: Without dead ends: 448 [2025-01-09 09:49:30,697 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 09:49:30,697 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 381 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:30,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1071 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:49:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-01-09 09:49:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 237. [2025-01-09 09:49:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 148 states have (on average 1.4527027027027026) internal successors, (215), 148 states have internal predecessors, (215), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-01-09 09:49:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 389 transitions. [2025-01-09 09:49:30,733 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 389 transitions. Word has length 536 [2025-01-09 09:49:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:30,736 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 389 transitions. [2025-01-09 09:49:30,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 09:49:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 389 transitions. [2025-01-09 09:49:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:49:30,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:30,745 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:30,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:49:30,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:30,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1565256640, now seen corresponding path program 1 times [2025-01-09 09:49:30,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:30,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324350577] [2025-01-09 09:49:30,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:30,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:30,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:49:30,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:49:30,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:30,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 09:49:34,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:34,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324350577] [2025-01-09 09:49:34,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324350577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:34,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:34,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:49:34,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565393646] [2025-01-09 09:49:34,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:34,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:49:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:34,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:49:34,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:49:34,550 INFO L87 Difference]: Start difference. First operand 237 states and 389 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 09:49:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:35,423 INFO L93 Difference]: Finished difference Result 961 states and 1578 transitions. [2025-01-09 09:49:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:49:35,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 536 [2025-01-09 09:49:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:35,429 INFO L225 Difference]: With dead ends: 961 [2025-01-09 09:49:35,429 INFO L226 Difference]: Without dead ends: 727 [2025-01-09 09:49:35,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:49:35,430 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 1015 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:35,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1795 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:49:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-01-09 09:49:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 509. [2025-01-09 09:49:35,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 313 states have (on average 1.4345047923322685) internal successors, (449), 314 states have internal predecessors, (449), 192 states have call successors, (192), 3 states have call predecessors, (192), 3 states have return successors, (192), 191 states have call predecessors, (192), 192 states have call successors, (192) [2025-01-09 09:49:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 833 transitions. [2025-01-09 09:49:35,518 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 833 transitions. Word has length 536 [2025-01-09 09:49:35,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:35,518 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 833 transitions. [2025-01-09 09:49:35,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 09:49:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 833 transitions. [2025-01-09 09:49:35,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:49:35,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:35,525 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:35,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:49:35,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:35,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:35,526 INFO L85 PathProgramCache]: Analyzing trace with hash -954703294, now seen corresponding path program 1 times [2025-01-09 09:49:35,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:35,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494064210] [2025-01-09 09:49:35,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:35,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:35,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:49:35,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:49:35,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:35,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 09:49:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:51,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494064210] [2025-01-09 09:49:51,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494064210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:51,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:51,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 09:49:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195115826] [2025-01-09 09:49:51,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:51,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 09:49:51,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:51,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 09:49:51,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:49:51,958 INFO L87 Difference]: Start difference. First operand 509 states and 833 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 09:49:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:54,114 INFO L93 Difference]: Finished difference Result 565 states and 909 transitions. [2025-01-09 09:49:54,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:49:54,115 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 536 [2025-01-09 09:49:54,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:54,121 INFO L225 Difference]: With dead ends: 565 [2025-01-09 09:49:54,121 INFO L226 Difference]: Without dead ends: 563 [2025-01-09 09:49:54,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-01-09 09:49:54,124 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 139 mSDsluCounter, 2809 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:54,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 3171 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:49:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-01-09 09:49:54,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 530. [2025-01-09 09:49:54,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 334 states have (on average 1.437125748502994) internal successors, (480), 335 states have internal predecessors, (480), 192 states have call successors, (192), 3 states have call predecessors, (192), 3 states have return successors, (192), 191 states have call predecessors, (192), 192 states have call successors, (192) [2025-01-09 09:49:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 864 transitions. [2025-01-09 09:49:54,209 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 864 transitions. Word has length 536 [2025-01-09 09:49:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:54,211 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 864 transitions. [2025-01-09 09:49:54,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 09:49:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 864 transitions. [2025-01-09 09:49:54,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:49:54,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:54,219 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:54,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:49:54,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:54,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:54,220 INFO L85 PathProgramCache]: Analyzing trace with hash 885198270, now seen corresponding path program 1 times [2025-01-09 09:49:54,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:54,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082787396] [2025-01-09 09:49:54,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:54,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:54,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:49:54,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:49:54,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:54,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:49:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-01-09 09:49:55,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:49:55,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082787396] [2025-01-09 09:49:55,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082787396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:49:55,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:49:55,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:49:55,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143222716] [2025-01-09 09:49:55,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:49:55,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:49:55,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:49:55,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:49:55,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:49:55,107 INFO L87 Difference]: Start difference. First operand 530 states and 864 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 09:49:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:49:55,705 INFO L93 Difference]: Finished difference Result 1282 states and 2091 transitions. [2025-01-09 09:49:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:49:55,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 536 [2025-01-09 09:49:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:49:55,711 INFO L225 Difference]: With dead ends: 1282 [2025-01-09 09:49:55,711 INFO L226 Difference]: Without dead ends: 755 [2025-01-09 09:49:55,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:49:55,713 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 824 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:49:55,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1856 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:49:55,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-01-09 09:49:55,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 537. [2025-01-09 09:49:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 338 states have (on average 1.4289940828402368) internal successors, (483), 339 states have internal predecessors, (483), 194 states have call successors, (194), 4 states have call predecessors, (194), 4 states have return successors, (194), 193 states have call predecessors, (194), 194 states have call successors, (194) [2025-01-09 09:49:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 871 transitions. [2025-01-09 09:49:55,782 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 871 transitions. Word has length 536 [2025-01-09 09:49:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:49:55,783 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 871 transitions. [2025-01-09 09:49:55,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-01-09 09:49:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 871 transitions. [2025-01-09 09:49:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:49:55,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:49:55,786 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:55,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:49:55,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:49:55,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:49:55,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1634761664, now seen corresponding path program 1 times [2025-01-09 09:49:55,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:49:55,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742291044] [2025-01-09 09:49:55,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:49:55,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:49:55,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:49:55,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:49:55,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:49:55,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat