./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-19.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-19.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 8782992ede62a00cd83cf50ccb00b62cd9fb02bef3f9a0721eb7de82bc29451b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:40:05,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:40:05,161 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:40:05,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:40:05,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:40:05,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:40:05,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:40:05,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:40:05,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:40:05,180 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:40:05,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:40:05,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:40:05,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:40:05,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:40:05,180 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:40:05,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:40:05,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:40:05,181 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:40:05,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:40:05,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:40:05,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:40:05,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:40:05,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:40:05,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:40:05,181 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:40:05,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:40:05,181 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:40:05,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:40:05,182 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:40:05,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:40:05,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:40:05,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:40:05,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:40:05,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:40:05,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:40:05,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:40:05,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:40:05,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:40:05,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:40:05,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:40:05,183 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:40:05,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:40:05,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:40:05,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:40:05,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:40:05,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:40:05,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:40:05,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:40:05,183 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 -> 8782992ede62a00cd83cf50ccb00b62cd9fb02bef3f9a0721eb7de82bc29451b [2025-01-09 09:40:05,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:40:05,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:40:05,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:40:05,381 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:40:05,384 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:40:05,385 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-19.i [2025-01-09 09:40:06,570 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f92cd04b/0b05be18d0de46638b589c4b40e941d3/FLAG92bedf6c9 [2025-01-09 09:40:06,867 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:40:06,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-19.i [2025-01-09 09:40:06,875 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f92cd04b/0b05be18d0de46638b589c4b40e941d3/FLAG92bedf6c9 [2025-01-09 09:40:07,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f92cd04b/0b05be18d0de46638b589c4b40e941d3 [2025-01-09 09:40:07,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:40:07,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:40:07,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:40:07,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:40:07,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:40:07,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@611dfea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07, skipping insertion in model container [2025-01-09 09:40:07,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:40:07,242 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-19.i[916,929] [2025-01-09 09:40:07,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:40:07,348 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:40:07,358 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-19.i[916,929] [2025-01-09 09:40:07,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:40:07,414 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:40:07,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07 WrapperNode [2025-01-09 09:40:07,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:40:07,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:40:07,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:40:07,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:40:07,425 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:40:07" (1/1) ... [2025-01-09 09:40:07,445 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:40:07" (1/1) ... [2025-01-09 09:40:07,504 INFO L138 Inliner]: procedures = 26, calls = 95, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 576 [2025-01-09 09:40:07,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:40:07,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:40:07,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:40:07,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:40:07,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,548 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:40:07,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:40:07,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:40:07,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:40:07,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:40:07,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (1/1) ... [2025-01-09 09:40:07,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:40:07,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:07,653 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:40:07,655 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:40:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:40:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:40:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:40:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:40:07,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:40:07,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:40:07,783 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:40:07,785 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:40:08,614 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 09:40:08,615 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:40:08,628 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:40:08,628 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:40:08,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:40:08 BoogieIcfgContainer [2025-01-09 09:40:08,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:40:08,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:40:08,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:40:08,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:40:08,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:40:07" (1/3) ... [2025-01-09 09:40:08,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e4d2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:40:08, skipping insertion in model container [2025-01-09 09:40:08,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:40:07" (2/3) ... [2025-01-09 09:40:08,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e4d2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:40:08, skipping insertion in model container [2025-01-09 09:40:08,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:40:08" (3/3) ... [2025-01-09 09:40:08,636 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-19.i [2025-01-09 09:40:08,646 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:40:08,648 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-19.i that has 2 procedures, 238 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:40:08,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:40:08,707 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;@389c78af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:40:08,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:40:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 154 states have internal predecessors, (231), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 09:40:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 09:40:08,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:08,731 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:08,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:08,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1078424218, now seen corresponding path program 1 times [2025-01-09 09:40:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508171026] [2025-01-09 09:40:08,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:08,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 09:40:08,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 09:40:08,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:08,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:09,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508171026] [2025-01-09 09:40:09,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508171026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:09,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:09,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:40:09,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296894558] [2025-01-09 09:40:09,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:09,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:40:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:09,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:40:09,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:40:09,370 INFO L87 Difference]: Start difference. First operand has 238 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 154 states have internal predecessors, (231), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) Second operand has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:09,412 INFO L93 Difference]: Finished difference Result 469 states and 865 transitions. [2025-01-09 09:40:09,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:40:09,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-01-09 09:40:09,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:09,422 INFO L225 Difference]: With dead ends: 469 [2025-01-09 09:40:09,422 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 09:40:09,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:40:09,433 INFO L435 NwaCegarLoop]: 386 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, 386 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:40:09,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 09:40:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-01-09 09:40:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 150 states have (on average 1.48) internal successors, (222), 150 states have internal predecessors, (222), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 09:40:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 386 transitions. [2025-01-09 09:40:09,504 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 386 transitions. Word has length 520 [2025-01-09 09:40:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:09,508 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 386 transitions. [2025-01-09 09:40:09,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 386 transitions. [2025-01-09 09:40:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 09:40:09,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:09,517 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:09,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 09:40:09,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash -777302150, now seen corresponding path program 1 times [2025-01-09 09:40:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472943959] [2025-01-09 09:40:09,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:09,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:09,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 09:40:09,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 09:40:09,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:09,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472943959] [2025-01-09 09:40:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472943959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:10,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:10,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:40:10,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630986032] [2025-01-09 09:40:10,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:10,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:40:10,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:10,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:40:10,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:10,254 INFO L87 Difference]: Start difference. First operand 234 states and 386 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:10,658 INFO L93 Difference]: Finished difference Result 696 states and 1152 transitions. [2025-01-09 09:40:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:40:10,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-01-09 09:40:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:10,663 INFO L225 Difference]: With dead ends: 696 [2025-01-09 09:40:10,663 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 09:40:10,664 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 09:40:10,664 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 647 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:10,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 712 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:40:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 09:40:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 241. [2025-01-09 09:40:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 157 states have (on average 1.4904458598726114) internal successors, (234), 157 states have internal predecessors, (234), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 09:40:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 398 transitions. [2025-01-09 09:40:10,709 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 398 transitions. Word has length 520 [2025-01-09 09:40:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:10,710 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 398 transitions. [2025-01-09 09:40:10,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:10,711 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 398 transitions. [2025-01-09 09:40:10,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 09:40:10,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:10,717 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:10,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:40:10,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:10,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:10,718 INFO L85 PathProgramCache]: Analyzing trace with hash -736627400, now seen corresponding path program 1 times [2025-01-09 09:40:10,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:10,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787499243] [2025-01-09 09:40:10,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:10,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:10,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 09:40:10,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 09:40:10,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:10,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:11,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:11,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787499243] [2025-01-09 09:40:11,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787499243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:11,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:11,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:11,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338295986] [2025-01-09 09:40:11,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:11,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:11,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:11,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:11,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:11,014 INFO L87 Difference]: Start difference. First operand 241 states and 398 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:11,080 INFO L93 Difference]: Finished difference Result 709 states and 1175 transitions. [2025-01-09 09:40:11,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:11,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-01-09 09:40:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:11,086 INFO L225 Difference]: With dead ends: 709 [2025-01-09 09:40:11,086 INFO L226 Difference]: Without dead ends: 471 [2025-01-09 09:40:11,087 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 09:40:11,087 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 352 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:11,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 824 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-01-09 09:40:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 295. [2025-01-09 09:40:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 211 states have (on average 1.5687203791469195) internal successors, (331), 211 states have internal predecessors, (331), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 09:40:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 495 transitions. [2025-01-09 09:40:11,129 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 495 transitions. Word has length 520 [2025-01-09 09:40:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:11,130 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 495 transitions. [2025-01-09 09:40:11,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 495 transitions. [2025-01-09 09:40:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 09:40:11,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:11,137 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:11,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:40:11,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:11,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:11,138 INFO L85 PathProgramCache]: Analyzing trace with hash 801712630, now seen corresponding path program 1 times [2025-01-09 09:40:11,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:11,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178871898] [2025-01-09 09:40:11,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:11,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:11,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 09:40:11,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 09:40:11,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:11,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:11,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178871898] [2025-01-09 09:40:11,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178871898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:11,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:40:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545827040] [2025-01-09 09:40:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:11,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:40:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:11,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:40:11,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:11,756 INFO L87 Difference]: Start difference. First operand 295 states and 495 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:12,100 INFO L93 Difference]: Finished difference Result 894 states and 1500 transitions. [2025-01-09 09:40:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:40:12,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-01-09 09:40:12,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:12,104 INFO L225 Difference]: With dead ends: 894 [2025-01-09 09:40:12,104 INFO L226 Difference]: Without dead ends: 602 [2025-01-09 09:40:12,105 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 09:40:12,105 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 362 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:12,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1139 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:40:12,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-01-09 09:40:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 585. [2025-01-09 09:40:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 418 states have (on average 1.569377990430622) internal successors, (656), 418 states have internal predecessors, (656), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 09:40:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 984 transitions. [2025-01-09 09:40:12,148 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 984 transitions. Word has length 520 [2025-01-09 09:40:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:12,149 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 984 transitions. [2025-01-09 09:40:12,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 984 transitions. [2025-01-09 09:40:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 09:40:12,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:12,154 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:12,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:40:12,154 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:12,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash -209404620, now seen corresponding path program 1 times [2025-01-09 09:40:12,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:12,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127569567] [2025-01-09 09:40:12,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:12,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:12,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 09:40:12,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 09:40:12,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:12,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:12,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:12,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127569567] [2025-01-09 09:40:12,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127569567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:12,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:12,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:12,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970363308] [2025-01-09 09:40:12,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:12,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:12,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:12,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:12,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:12,544 INFO L87 Difference]: Start difference. First operand 585 states and 984 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:12,622 INFO L93 Difference]: Finished difference Result 1459 states and 2457 transitions. [2025-01-09 09:40:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:12,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-01-09 09:40:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:12,629 INFO L225 Difference]: With dead ends: 1459 [2025-01-09 09:40:12,629 INFO L226 Difference]: Without dead ends: 877 [2025-01-09 09:40:12,630 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:40:12,631 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 204 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:12,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 760 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-01-09 09:40:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 875. [2025-01-09 09:40:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 625 states have (on average 1.5664) internal successors, (979), 625 states have internal predecessors, (979), 246 states have call successors, (246), 3 states have call predecessors, (246), 3 states have return successors, (246), 246 states have call predecessors, (246), 246 states have call successors, (246) [2025-01-09 09:40:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1471 transitions. [2025-01-09 09:40:12,734 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1471 transitions. Word has length 520 [2025-01-09 09:40:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:12,735 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1471 transitions. [2025-01-09 09:40:12,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1471 transitions. [2025-01-09 09:40:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 09:40:12,740 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:12,740 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:12,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:40:12,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:12,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash -796210634, now seen corresponding path program 1 times [2025-01-09 09:40:12,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:12,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865620845] [2025-01-09 09:40:12,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:12,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:12,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 09:40:12,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 09:40:12,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:12,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:13,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:13,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865620845] [2025-01-09 09:40:13,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865620845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:13,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:13,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 09:40:13,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886003374] [2025-01-09 09:40:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:13,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 09:40:13,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:13,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 09:40:13,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:40:13,774 INFO L87 Difference]: Start difference. First operand 875 states and 1471 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:15,062 INFO L93 Difference]: Finished difference Result 3607 states and 6005 transitions. [2025-01-09 09:40:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:40:15,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 520 [2025-01-09 09:40:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:15,076 INFO L225 Difference]: With dead ends: 3607 [2025-01-09 09:40:15,076 INFO L226 Difference]: Without dead ends: 2735 [2025-01-09 09:40:15,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:40:15,080 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1216 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:15,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 1915 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 09:40:15,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2025-01-09 09:40:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 1631. [2025-01-09 09:40:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1222 states have (on average 1.5965630114566285) internal successors, (1951), 1225 states have internal predecessors, (1951), 402 states have call successors, (402), 6 states have call predecessors, (402), 6 states have return successors, (402), 399 states have call predecessors, (402), 402 states have call successors, (402) [2025-01-09 09:40:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2755 transitions. [2025-01-09 09:40:15,345 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2755 transitions. Word has length 520 [2025-01-09 09:40:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:15,346 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2755 transitions. [2025-01-09 09:40:15,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2755 transitions. [2025-01-09 09:40:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-09 09:40:15,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:15,349 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:15,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:40:15,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:15,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:15,350 INFO L85 PathProgramCache]: Analyzing trace with hash -930224140, now seen corresponding path program 1 times [2025-01-09 09:40:15,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:15,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656574500] [2025-01-09 09:40:15,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:15,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:15,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 09:40:15,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 09:40:15,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:15,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-01-09 09:40:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656574500] [2025-01-09 09:40:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656574500] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:40:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139852328] [2025-01-09 09:40:15,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:15,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:15,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:15,969 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:40:15,971 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:40:16,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-09 09:40:16,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-09 09:40:16,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:16,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:16,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 09:40:16,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:40:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 8277 proven. 48 refuted. 0 times theorem prover too weak. 4959 trivial. 0 not checked. [2025-01-09 09:40:16,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:40:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 195 proven. 48 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-01-09 09:40:17,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139852328] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:40:17,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:40:17,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-01-09 09:40:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656220644] [2025-01-09 09:40:17,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:40:17,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:40:17,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:17,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:40:17,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:40:17,313 INFO L87 Difference]: Start difference. First operand 1631 states and 2755 transitions. Second operand has 16 states, 16 states have (on average 14.75) internal successors, (236), 16 states have internal predecessors, (236), 6 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 6 states have call predecessors, (162), 6 states have call successors, (162) [2025-01-09 09:40:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:18,895 INFO L93 Difference]: Finished difference Result 4194 states and 6993 transitions. [2025-01-09 09:40:18,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 09:40:18,896 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 14.75) internal successors, (236), 16 states have internal predecessors, (236), 6 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 6 states have call predecessors, (162), 6 states have call successors, (162) Word has length 520 [2025-01-09 09:40:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:18,912 INFO L225 Difference]: With dead ends: 4194 [2025-01-09 09:40:18,912 INFO L226 Difference]: Without dead ends: 2566 [2025-01-09 09:40:18,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1063 GetRequests, 1034 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2025-01-09 09:40:18,917 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 618 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:18,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1772 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [639 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 09:40:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2025-01-09 09:40:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1667. [2025-01-09 09:40:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1252 states have (on average 1.567891373801917) internal successors, (1963), 1255 states have internal predecessors, (1963), 402 states have call successors, (402), 12 states have call predecessors, (402), 12 states have return successors, (402), 399 states have call predecessors, (402), 402 states have call successors, (402) [2025-01-09 09:40:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2767 transitions. [2025-01-09 09:40:19,091 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2767 transitions. Word has length 520 [2025-01-09 09:40:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:19,092 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2767 transitions. [2025-01-09 09:40:19,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.75) internal successors, (236), 16 states have internal predecessors, (236), 6 states have call successors, (162), 3 states have call predecessors, (162), 6 states have return successors, (162), 6 states have call predecessors, (162), 6 states have call successors, (162) [2025-01-09 09:40:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2767 transitions. [2025-01-09 09:40:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-01-09 09:40:19,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:19,095 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:19,105 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 09:40:19,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:19,297 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:19,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1386016094, now seen corresponding path program 1 times [2025-01-09 09:40:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:19,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914129891] [2025-01-09 09:40:19,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:19,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-01-09 09:40:19,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-01-09 09:40:19,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:19,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 291 proven. 189 refuted. 0 times theorem prover too weak. 12804 trivial. 0 not checked. [2025-01-09 09:40:23,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:23,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914129891] [2025-01-09 09:40:23,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914129891] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:40:23,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116636036] [2025-01-09 09:40:23,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:23,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:40:23,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:40:23,549 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 09:40:23,550 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 09:40:23,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-01-09 09:40:23,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-01-09 09:40:23,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:23,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:23,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 09:40:23,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:40:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 8840 proven. 594 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2025-01-09 09:40:27,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:40:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 432 proven. 288 refuted. 0 times theorem prover too weak. 12564 trivial. 0 not checked. [2025-01-09 09:40:33,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116636036] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:40:33,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:40:33,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 19] total 61 [2025-01-09 09:40:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515319986] [2025-01-09 09:40:33,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:40:33,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-01-09 09:40:33,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:33,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-01-09 09:40:33,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=3297, Unknown=0, NotChecked=0, Total=3660 [2025-01-09 09:40:33,056 INFO L87 Difference]: Start difference. First operand 1667 states and 2767 transitions. Second operand has 61 states, 59 states have (on average 5.932203389830509) internal successors, (350), 59 states have internal predecessors, (350), 15 states have call successors, (246), 7 states have call predecessors, (246), 14 states have return successors, (246), 14 states have call predecessors, (246), 15 states have call successors, (246)