./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.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-25_file-59.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 b8b9ffa0f086760a52bbb5b7ce872ecb50536a94abf6bed664eac71cc82e5722 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:56:25,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:56:25,104 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:56:25,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:56:25,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:56:25,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:56:25,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:56:25,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:56:25,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:56:25,135 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:56:25,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:56:25,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:56:25,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:56:25,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:56:25,137 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:56:25,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:56:25,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:56:25,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:56:25,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:56:25,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:56:25,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:56:25,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:56:25,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:56:25,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:56:25,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:56:25,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:56:25,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:56:25,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:56:25,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:56:25,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:56:25,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:56:25,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:56:25,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:56:25,139 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:56:25,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:56:25,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:56:25,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:56:25,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:56:25,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:56:25,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:56:25,140 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:56:25,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:56:25,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:56:25,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:56:25,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:56:25,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:56:25,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:56:25,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:56:25,140 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 -> b8b9ffa0f086760a52bbb5b7ce872ecb50536a94abf6bed664eac71cc82e5722 [2025-01-09 09:56:25,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:56:25,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:56:25,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:56:25,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:56:25,394 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:56:25,395 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-25_file-59.i [2025-01-09 09:56:26,630 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da78b0273/3d6bd9468b874604b0f35e60eef1732a/FLAG64e61bc31 [2025-01-09 09:56:26,887 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:56:26,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2025-01-09 09:56:26,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da78b0273/3d6bd9468b874604b0f35e60eef1732a/FLAG64e61bc31 [2025-01-09 09:56:26,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da78b0273/3d6bd9468b874604b0f35e60eef1732a [2025-01-09 09:56:26,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:56:26,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:56:26,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:56:26,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:56:26,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:56:26,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:56:26" (1/1) ... [2025-01-09 09:56:26,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145267a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:26, skipping insertion in model container [2025-01-09 09:56:26,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:56:26" (1/1) ... [2025-01-09 09:56:26,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:56:27,077 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-25_file-59.i[915,928] [2025-01-09 09:56:27,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:56:27,163 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:56:27,174 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-25_file-59.i[915,928] [2025-01-09 09:56:27,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:56:27,222 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:56:27,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27 WrapperNode [2025-01-09 09:56:27,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:56:27,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:56:27,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:56:27,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:56:27,232 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:56:27" (1/1) ... [2025-01-09 09:56:27,245 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:56:27" (1/1) ... [2025-01-09 09:56:27,276 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2025-01-09 09:56:27,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:56:27,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:56:27,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:56:27,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:56:27,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (1/1) ... [2025-01-09 09:56:27,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (1/1) ... [2025-01-09 09:56:27,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (1/1) ... [2025-01-09 09:56:27,311 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:56:27,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (1/1) ... [2025-01-09 09:56:27,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (1/1) ... [2025-01-09 09:56:27,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (1/1) ... [2025-01-09 09:56:27,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (1/1) ... [2025-01-09 09:56:27,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (1/1) ... [2025-01-09 09:56:27,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (1/1) ... [2025-01-09 09:56:27,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (1/1) ... [2025-01-09 09:56:27,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:56:27,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:56:27,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:56:27,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:56:27,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (1/1) ... [2025-01-09 09:56:27,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:56:27,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:56:27,376 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:56:27,378 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:56:27,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:56:27,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:56:27,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:56:27,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:56:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:56:27,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:56:27,458 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:56:27,460 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:56:27,770 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 09:56:27,770 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:56:27,781 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:56:27,781 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:56:27,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:56:27 BoogieIcfgContainer [2025-01-09 09:56:27,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:56:27,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:56:27,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:56:27,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:56:27,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:56:26" (1/3) ... [2025-01-09 09:56:27,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490f6fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:56:27, skipping insertion in model container [2025-01-09 09:56:27,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:56:27" (2/3) ... [2025-01-09 09:56:27,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490f6fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:56:27, skipping insertion in model container [2025-01-09 09:56:27,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:56:27" (3/3) ... [2025-01-09 09:56:27,793 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-59.i [2025-01-09 09:56:27,803 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:56:27,806 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-59.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:56:27,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:56:27,857 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;@3a8b2741, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:56:27,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:56:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 09:56:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 09:56:27,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:56:27,872 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:27,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:56:27,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:56:27,877 INFO L85 PathProgramCache]: Analyzing trace with hash -983159857, now seen corresponding path program 1 times [2025-01-09 09:56:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:56:27,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344946251] [2025-01-09 09:56:27,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:56:27,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:56:27,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 09:56:27,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 09:56:27,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:56:27,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:56:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 09:56:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:56:28,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344946251] [2025-01-09 09:56:28,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344946251] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:56:28,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766799392] [2025-01-09 09:56:28,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:56:28,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:56:28,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:56:28,161 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:56:28,162 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:56:28,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 09:56:28,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 09:56:28,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:56:28,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:56:28,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:56:28,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:56:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 09:56:28,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:56:28,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766799392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:56:28,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:56:28,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:56:28,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299993991] [2025-01-09 09:56:28,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:56:28,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:56:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:56:28,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:56:28,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:56:28,383 INFO L87 Difference]: Start difference. First operand has 85 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 09:56:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:56:28,403 INFO L93 Difference]: Finished difference Result 164 states and 286 transitions. [2025-01-09 09:56:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:56:28,404 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-01-09 09:56:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:56:28,408 INFO L225 Difference]: With dead ends: 164 [2025-01-09 09:56:28,408 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 09:56:28,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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:56:28,413 INFO L435 NwaCegarLoop]: 125 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, 125 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:56:28,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:56:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 09:56:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 09:56:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 09:56:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2025-01-09 09:56:28,454 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 175 [2025-01-09 09:56:28,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:56:28,455 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2025-01-09 09:56:28,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 09:56:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2025-01-09 09:56:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 09:56:28,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:56:28,459 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:28,466 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:56:28,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:56:28,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:56:28,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:56:28,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1687425211, now seen corresponding path program 1 times [2025-01-09 09:56:28,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:56:28,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729295091] [2025-01-09 09:56:28,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:56:28,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:56:28,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 09:56:28,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 09:56:28,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:56:28,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:56:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:56:29,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:56:29,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729295091] [2025-01-09 09:56:29,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729295091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:56:29,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:56:29,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:56:29,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158613735] [2025-01-09 09:56:29,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:56:29,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:56:29,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:56:29,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:56:29,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:56:29,038 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:56:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:56:29,197 INFO L93 Difference]: Finished difference Result 225 states and 343 transitions. [2025-01-09 09:56:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:56:29,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 09:56:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:56:29,201 INFO L225 Difference]: With dead ends: 225 [2025-01-09 09:56:29,202 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 09:56:29,203 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:56:29,205 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 96 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:56:29,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 309 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:56:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 09:56:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2025-01-09 09:56:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 94 states have internal predecessors, (124), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 09:56:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2025-01-09 09:56:29,231 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 175 [2025-01-09 09:56:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:56:29,231 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2025-01-09 09:56:29,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:56:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2025-01-09 09:56:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 09:56:29,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:56:29,235 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:29,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:56:29,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:56:29,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:56:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1596424835, now seen corresponding path program 1 times [2025-01-09 09:56:29,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:56:29,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895131646] [2025-01-09 09:56:29,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:56:29,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:56:29,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 09:56:29,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 09:56:29,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:56:29,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:56:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:56:29,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:56:29,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895131646] [2025-01-09 09:56:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895131646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:56:29,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:56:29,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:56:29,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412169197] [2025-01-09 09:56:29,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:56:29,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:56:29,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:56:29,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:56:29,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:56:29,509 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:56:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:56:29,556 INFO L93 Difference]: Finished difference Result 422 states and 647 transitions. [2025-01-09 09:56:29,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:56:29,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-01-09 09:56:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:56:29,564 INFO L225 Difference]: With dead ends: 422 [2025-01-09 09:56:29,564 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 09:56:29,565 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:56:29,567 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 71 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:56:29,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 273 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:56:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 09:56:29,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2025-01-09 09:56:29,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 183 states have internal predecessors, (241), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 09:56:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 429 transitions. [2025-01-09 09:56:29,616 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 429 transitions. Word has length 175 [2025-01-09 09:56:29,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:56:29,617 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 429 transitions. [2025-01-09 09:56:29,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:56:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 429 transitions. [2025-01-09 09:56:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 09:56:29,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:56:29,622 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:29,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:56:29,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:56:29,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:56:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1713347993, now seen corresponding path program 1 times [2025-01-09 09:56:29,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:56:29,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670729369] [2025-01-09 09:56:29,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:56:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:56:29,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 09:56:29,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 09:56:29,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:56:29,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:56:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:56:29,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:56:29,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670729369] [2025-01-09 09:56:29,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670729369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:56:29,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:56:29,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:56:29,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059212994] [2025-01-09 09:56:29,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:56:29,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:56:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:56:29,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:56:29,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:56:29,809 INFO L87 Difference]: Start difference. First operand 280 states and 429 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:56:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:56:29,857 INFO L93 Difference]: Finished difference Result 557 states and 855 transitions. [2025-01-09 09:56:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:56:29,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 09:56:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:56:29,862 INFO L225 Difference]: With dead ends: 557 [2025-01-09 09:56:29,863 INFO L226 Difference]: Without dead ends: 280 [2025-01-09 09:56:29,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:56:29,866 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 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:56:29,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:56:29,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-01-09 09:56:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2025-01-09 09:56:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 180 states have (on average 1.3111111111111111) internal successors, (236), 182 states have internal predecessors, (236), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 09:56:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 424 transitions. [2025-01-09 09:56:29,910 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 424 transitions. Word has length 176 [2025-01-09 09:56:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:56:29,911 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 424 transitions. [2025-01-09 09:56:29,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:56:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 424 transitions. [2025-01-09 09:56:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 09:56:29,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:56:29,914 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:29,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:56:29,915 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:56:29,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:56:29,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1570502053, now seen corresponding path program 1 times [2025-01-09 09:56:29,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:56:29,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911292817] [2025-01-09 09:56:29,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:56:29,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:56:29,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 09:56:29,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 09:56:29,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:56:29,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:56:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:56:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:56:30,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911292817] [2025-01-09 09:56:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911292817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:56:30,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:56:30,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:56:30,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740152497] [2025-01-09 09:56:30,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:56:30,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:56:30,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:56:30,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:56:30,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:56:30,143 INFO L87 Difference]: Start difference. First operand 279 states and 424 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:56:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:56:30,319 INFO L93 Difference]: Finished difference Result 687 states and 1040 transitions. [2025-01-09 09:56:30,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:56:30,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-01-09 09:56:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:56:30,322 INFO L225 Difference]: With dead ends: 687 [2025-01-09 09:56:30,322 INFO L226 Difference]: Without dead ends: 411 [2025-01-09 09:56:30,323 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:56:30,326 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 85 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:56:30,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 356 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:56:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-01-09 09:56:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 358. [2025-01-09 09:56:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 230 states have (on average 1.2695652173913043) internal successors, (292), 232 states have internal predecessors, (292), 121 states have call successors, (121), 6 states have call predecessors, (121), 6 states have return successors, (121), 119 states have call predecessors, (121), 121 states have call successors, (121) [2025-01-09 09:56:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 534 transitions. [2025-01-09 09:56:30,366 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 534 transitions. Word has length 176 [2025-01-09 09:56:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:56:30,366 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 534 transitions. [2025-01-09 09:56:30,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:56:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 534 transitions. [2025-01-09 09:56:30,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 09:56:30,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:56:30,368 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:30,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:56:30,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:56:30,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:56:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1254428069, now seen corresponding path program 1 times [2025-01-09 09:56:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:56:30,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937829778] [2025-01-09 09:56:30,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:56:30,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:56:30,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 09:56:30,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 09:56:30,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:56:30,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:56:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:56:30,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:56:30,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937829778] [2025-01-09 09:56:30,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937829778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:56:30,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:56:30,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:56:30,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322566957] [2025-01-09 09:56:30,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:56:30,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:56:30,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:56:30,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:56:30,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:56:30,599 INFO L87 Difference]: Start difference. First operand 358 states and 534 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:56:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:56:30,775 INFO L93 Difference]: Finished difference Result 944 states and 1421 transitions. [2025-01-09 09:56:30,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:56:30,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-01-09 09:56:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:56:30,781 INFO L225 Difference]: With dead ends: 944 [2025-01-09 09:56:30,782 INFO L226 Difference]: Without dead ends: 668 [2025-01-09 09:56:30,783 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:56:30,786 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 100 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:56:30,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 354 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:56:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-01-09 09:56:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 632. [2025-01-09 09:56:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 406 states have (on average 1.270935960591133) internal successors, (516), 410 states have internal predecessors, (516), 215 states have call successors, (215), 10 states have call predecessors, (215), 10 states have return successors, (215), 211 states have call predecessors, (215), 215 states have call successors, (215) [2025-01-09 09:56:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 946 transitions. [2025-01-09 09:56:30,884 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 946 transitions. Word has length 177 [2025-01-09 09:56:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:56:30,885 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 946 transitions. [2025-01-09 09:56:30,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:56:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 946 transitions. [2025-01-09 09:56:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 09:56:30,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:56:30,887 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:30,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:56:30,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:56:30,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:56:30,888 INFO L85 PathProgramCache]: Analyzing trace with hash -613788582, now seen corresponding path program 1 times [2025-01-09 09:56:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:56:30,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660429690] [2025-01-09 09:56:30,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:56:30,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:56:30,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 09:56:31,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 09:56:31,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:56:31,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:56:31,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272547763] [2025-01-09 09:56:31,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:56:31,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:56:31,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:56:31,030 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:56:31,032 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:56:31,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 09:56:31,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 09:56:31,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:56:31,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:56:31,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 09:56:31,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:56:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 338 proven. 300 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-01-09 09:56:33,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:56:49,446 WARN L286 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 09:56:54,681 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 09:56:59,952 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 09:57:06,588 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_5 Int)) (or (< v_z_5 .cse5) (not (= v_z_5 (mod (* v_z_5 .cse2) 4294967296))) (< .cse6 v_z_5) (< v_z_5 .cse1))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false [2025-01-09 09:57:20,574 WARN L286 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 09:57:32,412 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse4 (mod c_~var_1_17~0 65536)) (.cse3 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (forall ((v_z_5 Int)) (or (< v_z_5 .cse3) (not (= v_z_5 (mod (* v_z_5 .cse2) 4294967296))) (< .cse4 v_z_5) (< v_z_5 .cse1))) (or (not (= .cse5 .cse0)) (< .cse6 .cse0)) (or (< .cse4 .cse5) (< .cse5 .cse3) (< .cse6 .cse5)))))) is different from false [2025-01-09 09:57:50,237 WARN L286 SmtUtils]: Spent 9.94s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)