./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.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_loopvsstraightlinecode_50-while_file-10.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 dffb49b583bf1b2953c0c17a06d6fc63bf48c484ad06befbc2660a12f206f89f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:49:58,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:49:58,080 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:49:58,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:49:58,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:49:58,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:49:58,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:49:58,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:49:58,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:49:58,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:49:58,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:49:58,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:49:58,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:49:58,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:49:58,103 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:49:58,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:49:58,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:49:58,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:49:58,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:49:58,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:49:58,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:49:58,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:49:58,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:58,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:49:58,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:49:58,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:49:58,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:49:58,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:49:58,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:49:58,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:49:58,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:49:58,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:49:58,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:49:58,109 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 -> dffb49b583bf1b2953c0c17a06d6fc63bf48c484ad06befbc2660a12f206f89f [2025-01-09 13:49:58,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:49:58,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:49:58,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:49:58,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:49:58,308 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:49:58,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i [2025-01-09 13:49:59,512 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0faf0d10e/98c497b8593e4392a1a4186ed0e60da1/FLAG206e213f0 [2025-01-09 13:49:59,825 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:49:59,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i [2025-01-09 13:49:59,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0faf0d10e/98c497b8593e4392a1a4186ed0e60da1/FLAG206e213f0 [2025-01-09 13:49:59,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0faf0d10e/98c497b8593e4392a1a4186ed0e60da1 [2025-01-09 13:49:59,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:49:59,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:49:59,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:49:59,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:49:59,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:49:59,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d119d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:49:59, skipping insertion in model container [2025-01-09 13:49:59,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:49:59" (1/1) ... [2025-01-09 13:49:59,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:49:59,988 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_loopvsstraightlinecode_50-while_file-10.i[915,928] [2025-01-09 13:50:00,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:50:00,050 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:50:00,059 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_loopvsstraightlinecode_50-while_file-10.i[915,928] [2025-01-09 13:50:00,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:50:00,105 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:50:00,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00 WrapperNode [2025-01-09 13:50:00,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:50:00,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:50:00,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:50:00,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:50:00,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,146 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2025-01-09 13:50:00,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:50:00,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:50:00,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:50:00,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:50:00,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,183 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 13:50:00,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:50:00,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:50:00,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:50:00,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:50:00,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (1/1) ... [2025-01-09 13:50:00,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:50:00,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:50:00,233 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 13:50:00,236 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 13:50:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:50:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:50:00,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:50:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:50:00,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:50:00,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:50:00,306 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:50:00,307 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:50:00,589 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-09 13:50:00,589 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:50:00,601 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:50:00,601 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:50:00,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:50:00 BoogieIcfgContainer [2025-01-09 13:50:00,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:50:00,604 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:50:00,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:50:00,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:50:00,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:49:59" (1/3) ... [2025-01-09 13:50:00,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe7d96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:50:00, skipping insertion in model container [2025-01-09 13:50:00,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:50:00" (2/3) ... [2025-01-09 13:50:00,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe7d96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:50:00, skipping insertion in model container [2025-01-09 13:50:00,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:50:00" (3/3) ... [2025-01-09 13:50:00,612 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-10.i [2025-01-09 13:50:00,624 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:50:00,626 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-10.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:50:00,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:50:00,691 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;@7ce2f266, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:50:00,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:50:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:50:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 13:50:00,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:50:00,705 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:50:00,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:50:00,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:50:00,710 INFO L85 PathProgramCache]: Analyzing trace with hash -703626017, now seen corresponding path program 1 times [2025-01-09 13:50:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:50:00,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127219675] [2025-01-09 13:50:00,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:00,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:50:00,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 13:50:00,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 13:50:00,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:00,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:50:00,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:50:00,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127219675] [2025-01-09 13:50:00,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127219675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:50:00,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016895659] [2025-01-09 13:50:00,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:00,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:50:00,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:50:00,962 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 13:50:00,963 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 13:50:01,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 13:50:01,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 13:50:01,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:01,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:01,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:50:01,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:50:01,134 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:50:01,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:50:01,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016895659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:50:01,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:50:01,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:50:01,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465203907] [2025-01-09 13:50:01,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:50:01,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:50:01,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:50:01,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:50:01,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:50:01,159 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:50:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:50:01,180 INFO L93 Difference]: Finished difference Result 140 states and 229 transitions. [2025-01-09 13:50:01,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:50:01,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 122 [2025-01-09 13:50:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:50:01,188 INFO L225 Difference]: With dead ends: 140 [2025-01-09 13:50:01,189 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 13:50:01,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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 13:50:01,196 INFO L435 NwaCegarLoop]: 103 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, 103 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 13:50:01,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:50:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 13:50:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 13:50:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:50:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2025-01-09 13:50:01,237 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 122 [2025-01-09 13:50:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:50:01,237 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 103 transitions. [2025-01-09 13:50:01,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:50:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 103 transitions. [2025-01-09 13:50:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 13:50:01,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:50:01,243 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:50:01,250 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 13:50:01,444 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 13:50:01,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:50:01,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:50:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash 94632863, now seen corresponding path program 1 times [2025-01-09 13:50:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:50:01,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473376739] [2025-01-09 13:50:01,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:01,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:50:01,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 13:50:01,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 13:50:01,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:01,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:50:01,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:50:01,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473376739] [2025-01-09 13:50:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473376739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:50:01,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:50:01,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:50:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935287004] [2025-01-09 13:50:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:50:01,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:50:01,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:50:01,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:50:01,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:50:01,936 INFO L87 Difference]: Start difference. First operand 70 states and 103 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:50:02,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:50:02,124 INFO L93 Difference]: Finished difference Result 205 states and 304 transitions. [2025-01-09 13:50:02,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:50:02,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2025-01-09 13:50:02,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:50:02,127 INFO L225 Difference]: With dead ends: 205 [2025-01-09 13:50:02,127 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 13:50:02,128 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 13:50:02,128 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:50:02,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 384 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:50:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 13:50:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 104. [2025-01-09 13:50:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 13:50:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2025-01-09 13:50:02,159 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 122 [2025-01-09 13:50:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:50:02,159 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2025-01-09 13:50:02,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:50:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2025-01-09 13:50:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 13:50:02,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:50:02,161 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:50:02,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:50:02,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:50:02,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:50:02,162 INFO L85 PathProgramCache]: Analyzing trace with hash -310146851, now seen corresponding path program 1 times [2025-01-09 13:50:02,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:50:02,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743137880] [2025-01-09 13:50:02,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:50:02,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 13:50:02,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 13:50:02,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:02,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:50:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:50:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743137880] [2025-01-09 13:50:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743137880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:50:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:50:15,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 13:50:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395389163] [2025-01-09 13:50:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:50:15,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:50:15,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:50:15,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:50:15,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:50:15,149 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:50:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:50:16,004 INFO L93 Difference]: Finished difference Result 357 states and 513 transitions. [2025-01-09 13:50:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 13:50:16,012 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2025-01-09 13:50:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:50:16,014 INFO L225 Difference]: With dead ends: 357 [2025-01-09 13:50:16,014 INFO L226 Difference]: Without dead ends: 290 [2025-01-09 13:50:16,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:50:16,015 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 354 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:50:16,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 571 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:50:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-09 13:50:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 187. [2025-01-09 13:50:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 128 states have (on average 1.3046875) internal successors, (167), 129 states have internal predecessors, (167), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 13:50:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 275 transitions. [2025-01-09 13:50:16,051 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 275 transitions. Word has length 123 [2025-01-09 13:50:16,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:50:16,052 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 275 transitions. [2025-01-09 13:50:16,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 13:50:16,052 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 275 transitions. [2025-01-09 13:50:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 13:50:16,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:50:16,055 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:50:16,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:50:16,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:50:16,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:50:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash 369911519, now seen corresponding path program 1 times [2025-01-09 13:50:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:50:16,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729456702] [2025-01-09 13:50:16,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:50:16,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 13:50:16,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 13:50:16,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:16,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:50:31,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:50:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729456702] [2025-01-09 13:50:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729456702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:50:31,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:50:31,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 13:50:31,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958026815] [2025-01-09 13:50:31,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:50:31,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 13:50:31,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:50:31,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 13:50:31,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:50:31,750 INFO L87 Difference]: Start difference. First operand 187 states and 275 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 13:50:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:50:33,863 INFO L93 Difference]: Finished difference Result 531 states and 753 transitions. [2025-01-09 13:50:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 13:50:33,864 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 123 [2025-01-09 13:50:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:50:33,867 INFO L225 Difference]: With dead ends: 531 [2025-01-09 13:50:33,867 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 13:50:33,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2025-01-09 13:50:33,871 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 793 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:50:33,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 570 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 13:50:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 13:50:33,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 300. [2025-01-09 13:50:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 215 states have (on average 1.2930232558139534) internal successors, (278), 216 states have internal predecessors, (278), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 13:50:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 422 transitions. [2025-01-09 13:50:33,902 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 422 transitions. Word has length 123 [2025-01-09 13:50:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:50:33,902 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 422 transitions. [2025-01-09 13:50:33,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 13:50:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 422 transitions. [2025-01-09 13:50:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 13:50:33,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:50:33,904 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:50:33,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:50:33,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:50:33,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:50:33,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1458272291, now seen corresponding path program 1 times [2025-01-09 13:50:33,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:50:33,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791041525] [2025-01-09 13:50:33,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:50:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:50:33,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 13:50:34,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 13:50:34,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:50:34,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:50:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 13:50:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:50:59,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791041525] [2025-01-09 13:50:59,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791041525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:50:59,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:50:59,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 13:50:59,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939909676] [2025-01-09 13:50:59,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:50:59,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 13:50:59,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:50:59,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 13:50:59,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-01-09 13:50:59,336 INFO L87 Difference]: Start difference. First operand 300 states and 422 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 19 states have internal predecessors, (36), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 13:51:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:51:04,467 INFO L93 Difference]: Finished difference Result 535 states and 743 transitions. [2025-01-09 13:51:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 13:51:04,467 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 19 states have internal predecessors, (36), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 123 [2025-01-09 13:51:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:51:04,470 INFO L225 Difference]: With dead ends: 535 [2025-01-09 13:51:04,470 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 13:51:04,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=289, Invalid=1043, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 13:51:04,471 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 825 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 13:51:04,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 883 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 13:51:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 13:51:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 281. [2025-01-09 13:51:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 211 states have (on average 1.3127962085308056) internal successors, (277), 212 states have internal predecessors, (277), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 13:51:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 393 transitions. [2025-01-09 13:51:04,500 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 393 transitions. Word has length 123 [2025-01-09 13:51:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:51:04,500 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 393 transitions. [2025-01-09 13:51:04,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 19 states have internal predecessors, (36), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 13:51:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 393 transitions. [2025-01-09 13:51:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 13:51:04,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:51:04,501 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:51:04,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:51:04,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:51:04,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:51:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash 628076957, now seen corresponding path program 1 times [2025-01-09 13:51:04,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:51:04,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715769802] [2025-01-09 13:51:04,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:51:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:51:04,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 13:51:04,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 13:51:04,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:51:04,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat