./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-84.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_operatoramount_amount250_file-84.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 54a452aafc3ad15c1ca5b324711d24dde38f7844e5b94bac37b2af7fa81c8041 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:29:05,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:29:05,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:29:05,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:29:05,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:29:05,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:29:05,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:29:05,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:29:05,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:29:05,887 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:29:05,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:29:05,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:29:05,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:29:05,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:29:05,888 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:29:05,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:29:05,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:29:05,889 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:29:05,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:29:05,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:29:05,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:29:05,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:29:05,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:29:05,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:29:05,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:29:05,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:29:05,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:29:05,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:29:05,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:29:05,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:29:05,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:29:05,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:29:05,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:29:05,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:29:05,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:29:05,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:29:05,891 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 -> 54a452aafc3ad15c1ca5b324711d24dde38f7844e5b94bac37b2af7fa81c8041 [2025-01-09 14:29:06,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:29:06,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:29:06,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:29:06,130 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:29:06,130 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:29:06,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-84.i [2025-01-09 14:29:07,364 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28b515426/a4af4fd536224aa8b6707b9e30422221/FLAGe7583f08b [2025-01-09 14:29:07,771 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:29:07,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-84.i [2025-01-09 14:29:07,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28b515426/a4af4fd536224aa8b6707b9e30422221/FLAGe7583f08b [2025-01-09 14:29:07,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28b515426/a4af4fd536224aa8b6707b9e30422221 [2025-01-09 14:29:07,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:29:07,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:29:07,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:29:07,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:29:07,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:29:07,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:29:07" (1/1) ... [2025-01-09 14:29:07,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c92ef46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:07, skipping insertion in model container [2025-01-09 14:29:07,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:29:07" (1/1) ... [2025-01-09 14:29:07,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:29:08,099 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_operatoramount_amount250_file-84.i[916,929] [2025-01-09 14:29:08,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:29:08,199 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:29:08,206 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-84.i[916,929] [2025-01-09 14:29:08,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:29:08,282 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:29:08,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08 WrapperNode [2025-01-09 14:29:08,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:29:08,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:29:08,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:29:08,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:29:08,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,371 INFO L138 Inliner]: procedures = 26, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 424 [2025-01-09 14:29:08,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:29:08,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:29:08,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:29:08,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:29:08,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,438 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 14:29:08,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,464 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,468 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:29:08,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:29:08,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:29:08,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:29:08,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (1/1) ... [2025-01-09 14:29:08,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:29:08,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:08,517 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 14:29:08,525 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 14:29:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:29:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:29:08,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:29:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:29:08,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:29:08,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:29:08,626 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:29:08,627 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:29:09,289 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-01-09 14:29:09,289 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:29:09,301 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:29:09,302 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:29:09,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:29:09 BoogieIcfgContainer [2025-01-09 14:29:09,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:29:09,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:29:09,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:29:09,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:29:09,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:29:07" (1/3) ... [2025-01-09 14:29:09,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b11e04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:29:09, skipping insertion in model container [2025-01-09 14:29:09,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:08" (2/3) ... [2025-01-09 14:29:09,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b11e04c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:29:09, skipping insertion in model container [2025-01-09 14:29:09,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:29:09" (3/3) ... [2025-01-09 14:29:09,309 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-84.i [2025-01-09 14:29:09,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:29:09,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-84.i that has 2 procedures, 183 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:29:09,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:29:09,381 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;@71c41add, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:29:09,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:29:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 133 states have (on average 1.4962406015037595) internal successors, (199), 134 states have internal predecessors, (199), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 14:29:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 14:29:09,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:09,398 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:29:09,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:09,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:09,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1894482100, now seen corresponding path program 1 times [2025-01-09 14:29:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:09,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662872300] [2025-01-09 14:29:09,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:09,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:09,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 14:29:09,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 14:29:09,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:09,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:29:10,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:10,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662872300] [2025-01-09 14:29:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662872300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:10,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:10,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:29:10,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307258981] [2025-01-09 14:29:10,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:10,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:29:10,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:10,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:29:10,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:29:10,123 INFO L87 Difference]: Start difference. First operand has 183 states, 133 states have (on average 1.4962406015037595) internal successors, (199), 134 states have internal predecessors, (199), 47 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:29:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:10,246 INFO L93 Difference]: Finished difference Result 536 states and 961 transitions. [2025-01-09 14:29:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:29:10,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 312 [2025-01-09 14:29:10,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:10,264 INFO L225 Difference]: With dead ends: 536 [2025-01-09 14:29:10,264 INFO L226 Difference]: Without dead ends: 356 [2025-01-09 14:29:10,268 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 14:29:10,269 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 250 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:10,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 550 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:29:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-09 14:29:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2025-01-09 14:29:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 255 states have (on average 1.4666666666666666) internal successors, (374), 255 states have internal predecessors, (374), 94 states have call successors, (94), 2 states have call predecessors, (94), 2 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 14:29:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 562 transitions. [2025-01-09 14:29:10,351 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 562 transitions. Word has length 312 [2025-01-09 14:29:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:10,354 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 562 transitions. [2025-01-09 14:29:10,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:29:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 562 transitions. [2025-01-09 14:29:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 14:29:10,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:10,363 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:29:10,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 14:29:10,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:10,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:10,365 INFO L85 PathProgramCache]: Analyzing trace with hash 614618422, now seen corresponding path program 1 times [2025-01-09 14:29:10,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:10,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255312570] [2025-01-09 14:29:10,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:10,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:10,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 14:29:10,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 14:29:10,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:10,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4324 trivial. 0 not checked. [2025-01-09 14:29:10,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:10,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255312570] [2025-01-09 14:29:10,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255312570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:10,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:10,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:29:10,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295533285] [2025-01-09 14:29:10,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:10,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:29:10,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:10,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:29:10,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:29:10,873 INFO L87 Difference]: Start difference. First operand 352 states and 562 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:29:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:11,244 INFO L93 Difference]: Finished difference Result 1160 states and 1847 transitions. [2025-01-09 14:29:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:29:11,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 312 [2025-01-09 14:29:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:11,254 INFO L225 Difference]: With dead ends: 1160 [2025-01-09 14:29:11,255 INFO L226 Difference]: Without dead ends: 811 [2025-01-09 14:29:11,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:29:11,258 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 343 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:11,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1181 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:29:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-01-09 14:29:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 697. [2025-01-09 14:29:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 504 states have (on average 1.4642857142857142) internal successors, (738), 504 states have internal predecessors, (738), 188 states have call successors, (188), 4 states have call predecessors, (188), 4 states have return successors, (188), 188 states have call predecessors, (188), 188 states have call successors, (188) [2025-01-09 14:29:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1114 transitions. [2025-01-09 14:29:11,314 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1114 transitions. Word has length 312 [2025-01-09 14:29:11,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:11,315 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1114 transitions. [2025-01-09 14:29:11,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (47), 1 states have call predecessors, (47), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2025-01-09 14:29:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1114 transitions. [2025-01-09 14:29:11,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 14:29:11,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:11,318 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:29:11,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:29:11,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:11,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1434769420, now seen corresponding path program 1 times [2025-01-09 14:29:11,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:11,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447492084] [2025-01-09 14:29:11,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:11,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:11,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 14:29:11,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 14:29:11,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:11,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 45 proven. 93 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-01-09 14:29:12,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:12,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447492084] [2025-01-09 14:29:12,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447492084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:12,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803570418] [2025-01-09 14:29:12,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:12,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:12,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:12,135 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 14:29:12,137 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 14:29:12,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 14:29:12,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 14:29:12,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:12,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:12,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:29:12,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1452 proven. 27 refuted. 0 times theorem prover too weak. 2845 trivial. 0 not checked. [2025-01-09 14:29:12,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:29:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 111 proven. 27 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-01-09 14:29:13,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803570418] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:29:13,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:29:13,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 15 [2025-01-09 14:29:13,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744395127] [2025-01-09 14:29:13,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:29:13,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:29:13,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:13,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:29:13,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:29:13,356 INFO L87 Difference]: Start difference. First operand 697 states and 1114 transitions. Second operand has 15 states, 15 states have (on average 12.466666666666667) internal successors, (187), 15 states have internal predecessors, (187), 5 states have call successors, (141), 3 states have call predecessors, (141), 6 states have return successors, (141), 5 states have call predecessors, (141), 5 states have call successors, (141) [2025-01-09 14:29:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:15,547 INFO L93 Difference]: Finished difference Result 4719 states and 7387 transitions. [2025-01-09 14:29:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 14:29:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.466666666666667) internal successors, (187), 15 states have internal predecessors, (187), 5 states have call successors, (141), 3 states have call predecessors, (141), 6 states have return successors, (141), 5 states have call predecessors, (141), 5 states have call successors, (141) Word has length 312 [2025-01-09 14:29:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:15,570 INFO L225 Difference]: With dead ends: 4719 [2025-01-09 14:29:15,571 INFO L226 Difference]: Without dead ends: 4025 [2025-01-09 14:29:15,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 620 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=389, Invalid=1333, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 14:29:15,576 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 1933 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2031 SdHoareTripleChecker+Valid, 2746 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:15,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2031 Valid, 2746 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 14:29:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2025-01-09 14:29:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3289. [2025-01-09 14:29:15,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 2384 states have (on average 1.424496644295302) internal successors, (3396), 2392 states have internal predecessors, (3396), 872 states have call successors, (872), 32 states have call predecessors, (872), 32 states have return successors, (872), 864 states have call predecessors, (872), 872 states have call successors, (872) [2025-01-09 14:29:15,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 5140 transitions. [2025-01-09 14:29:15,848 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 5140 transitions. Word has length 312 [2025-01-09 14:29:15,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:15,849 INFO L471 AbstractCegarLoop]: Abstraction has 3289 states and 5140 transitions. [2025-01-09 14:29:15,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.466666666666667) internal successors, (187), 15 states have internal predecessors, (187), 5 states have call successors, (141), 3 states have call predecessors, (141), 6 states have return successors, (141), 5 states have call predecessors, (141), 5 states have call successors, (141) [2025-01-09 14:29:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 5140 transitions. [2025-01-09 14:29:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 14:29:15,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:15,853 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:29:15,865 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 14:29:16,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:16,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:16,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash 621414900, now seen corresponding path program 1 times [2025-01-09 14:29:16,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:16,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666085294] [2025-01-09 14:29:16,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:16,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:16,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 14:29:16,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 14:29:16,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:16,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 75 proven. 63 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-01-09 14:29:16,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:16,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666085294] [2025-01-09 14:29:16,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666085294] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:16,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664389357] [2025-01-09 14:29:16,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:16,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:16,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:16,554 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 14:29:16,558 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 14:29:16,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 14:29:16,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 14:29:16,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:16,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:16,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:29:16,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 2196 proven. 63 refuted. 0 times theorem prover too weak. 2065 trivial. 0 not checked. [2025-01-09 14:29:16,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:29:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 75 proven. 63 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-01-09 14:29:17,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664389357] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:29:17,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:29:17,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:29:17,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760936207] [2025-01-09 14:29:17,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:29:17,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:29:17,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:17,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:29:17,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:29:17,129 INFO L87 Difference]: Start difference. First operand 3289 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-01-09 14:29:17,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:17,483 INFO L93 Difference]: Finished difference Result 5130 states and 7961 transitions. [2025-01-09 14:29:17,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:29:17,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) Word has length 312 [2025-01-09 14:29:17,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:17,504 INFO L225 Difference]: With dead ends: 5130 [2025-01-09 14:29:17,504 INFO L226 Difference]: Without dead ends: 1844 [2025-01-09 14:29:17,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 621 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:29:17,516 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 494 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:17,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 551 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:29:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-01-09 14:29:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1741. [2025-01-09 14:29:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1229 states have (on average 1.3620829943043125) internal successors, (1674), 1233 states have internal predecessors, (1674), 483 states have call successors, (483), 28 states have call predecessors, (483), 28 states have return successors, (483), 479 states have call predecessors, (483), 483 states have call successors, (483) [2025-01-09 14:29:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2640 transitions. [2025-01-09 14:29:17,661 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2640 transitions. Word has length 312 [2025-01-09 14:29:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:17,663 INFO L471 AbstractCegarLoop]: Abstraction has 1741 states and 2640 transitions. [2025-01-09 14:29:17,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-01-09 14:29:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2640 transitions. [2025-01-09 14:29:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 14:29:17,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:17,669 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:29:17,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:29:17,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:17,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:17,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:17,871 INFO L85 PathProgramCache]: Analyzing trace with hash -407944398, now seen corresponding path program 1 times [2025-01-09 14:29:17,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:17,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448359744] [2025-01-09 14:29:17,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:17,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:17,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 14:29:18,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 14:29:18,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:18,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 39 proven. 99 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2025-01-09 14:29:20,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:20,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448359744] [2025-01-09 14:29:20,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448359744] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303828756] [2025-01-09 14:29:20,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:20,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:20,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:20,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:29:20,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:29:20,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 14:29:20,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 14:29:20,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:20,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:20,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 14:29:20,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 1982 proven. 474 refuted. 0 times theorem prover too weak. 1868 trivial. 0 not checked. [2025-01-09 14:29:25,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:29:26,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303828756] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:26,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:29:26,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 22] total 28 [2025-01-09 14:29:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008694864] [2025-01-09 14:29:26,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:29:26,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 14:29:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:26,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 14:29:26,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 14:29:26,562 INFO L87 Difference]: Start difference. First operand 1741 states and 2640 transitions. Second operand has 28 states, 28 states have (on average 5.785714285714286) internal successors, (162), 27 states have internal predecessors, (162), 7 states have call successors, (85), 6 states have call predecessors, (85), 10 states have return successors, (86), 7 states have call predecessors, (86), 7 states have call successors, (86) [2025-01-09 14:29:36,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:29:46,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:29:51,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:29:55,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:30:00,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:30:04,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:30:09,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:30:11,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:30:18,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:30:35,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:30:38,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]