./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-52.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-50_file-52.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 860048a24abd15d6568a41ffd17ac25bbefe747caeaf9a3976a4e57ac9819130 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:15:45,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:15:45,273 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:15:45,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:15:45,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:15:45,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:15:45,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:15:45,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:15:45,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:15:45,307 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:15:45,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:15:45,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:15:45,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:15:45,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:15:45,308 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:15:45,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:15:45,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:15:45,309 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:15:45,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:15:45,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:15:45,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:15:45,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:15:45,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:15:45,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:15:45,309 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:15:45,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:15:45,309 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:15:45,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:15:45,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:15:45,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:15:45,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:15:45,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:15:45,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:15:45,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:15:45,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:15:45,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:15:45,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:15:45,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:15:45,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:15:45,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:15:45,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:15:45,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:15:45,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:15:45,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:15:45,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:15:45,312 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:15:45,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:15:45,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:15:45,312 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 -> 860048a24abd15d6568a41ffd17ac25bbefe747caeaf9a3976a4e57ac9819130 [2025-01-09 10:15:45,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:15:45,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:15:45,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:15:45,652 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:15:45,653 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:15:45,654 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-50_file-52.i [2025-01-09 10:15:46,807 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07c7dbd82/6fbfdf016131402ab4bd52b4449927ba/FLAG3b51469af [2025-01-09 10:15:47,053 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:15:47,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-52.i [2025-01-09 10:15:47,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07c7dbd82/6fbfdf016131402ab4bd52b4449927ba/FLAG3b51469af [2025-01-09 10:15:47,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07c7dbd82/6fbfdf016131402ab4bd52b4449927ba [2025-01-09 10:15:47,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:15:47,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:15:47,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:15:47,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:15:47,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:15:47,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f081c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47, skipping insertion in model container [2025-01-09 10:15:47,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:15:47,495 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-50_file-52.i[915,928] [2025-01-09 10:15:47,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:15:47,561 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:15:47,570 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-50_file-52.i[915,928] [2025-01-09 10:15:47,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:15:47,627 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:15:47,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47 WrapperNode [2025-01-09 10:15:47,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:15:47,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:15:47,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:15:47,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:15:47,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,672 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2025-01-09 10:15:47,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:15:47,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:15:47,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:15:47,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:15:47,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,708 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 10:15:47,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:15:47,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:15:47,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:15:47,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:15:47,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (1/1) ... [2025-01-09 10:15:47,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:15:47,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:15:47,770 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 10:15:47,781 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 10:15:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:15:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:15:47,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:15:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:15:47,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:15:47,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:15:47,883 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:15:47,884 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:15:48,187 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 10:15:48,187 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:15:48,198 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:15:48,199 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:15:48,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:48 BoogieIcfgContainer [2025-01-09 10:15:48,202 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:15:48,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:15:48,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:15:48,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:15:48,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:15:47" (1/3) ... [2025-01-09 10:15:48,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec34a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:15:48, skipping insertion in model container [2025-01-09 10:15:48,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:15:47" (2/3) ... [2025-01-09 10:15:48,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec34a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:15:48, skipping insertion in model container [2025-01-09 10:15:48,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:15:48" (3/3) ... [2025-01-09 10:15:48,211 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-52.i [2025-01-09 10:15:48,222 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:15:48,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-52.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:15:48,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:15:48,272 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;@721f803a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:15:48,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:15:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 10:15:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 10:15:48,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:15:48,285 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:15:48,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:15:48,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:15:48,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1500667964, now seen corresponding path program 1 times [2025-01-09 10:15:48,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:15:48,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267347606] [2025-01-09 10:15:48,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:15:48,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:15:48,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 10:15:48,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 10:15:48,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:15:48,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:15:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 10:15:48,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:15:48,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267347606] [2025-01-09 10:15:48,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267347606] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:15:48,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581456358] [2025-01-09 10:15:48,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:15:48,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:15:48,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:15:48,570 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 10:15:48,572 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 10:15:48,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 10:15:48,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 10:15:48,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:15:48,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:15:48,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:15:48,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:15:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 10:15:48,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:15:48,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581456358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:15:48,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:15:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:15:48,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094567192] [2025-01-09 10:15:48,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:15:48,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:15:48,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:15:48,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:15:48,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:15:48,789 INFO L87 Difference]: Start difference. First operand has 105 states, 68 states have (on average 1.411764705882353) internal successors, (96), 69 states have internal predecessors, (96), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 10:15:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:15:48,812 INFO L93 Difference]: Finished difference Result 204 states and 357 transitions. [2025-01-09 10:15:48,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:15:48,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 219 [2025-01-09 10:15:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:15:48,818 INFO L225 Difference]: With dead ends: 204 [2025-01-09 10:15:48,819 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 10:15:48,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 220 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 10:15:48,824 INFO L435 NwaCegarLoop]: 159 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, 159 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 10:15:48,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:15:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 10:15:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 10:15:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.378787878787879) internal successors, (91), 66 states have internal predecessors, (91), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 10:15:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 159 transitions. [2025-01-09 10:15:48,860 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 159 transitions. Word has length 219 [2025-01-09 10:15:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:15:48,861 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 159 transitions. [2025-01-09 10:15:48,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 10:15:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 159 transitions. [2025-01-09 10:15:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 10:15:48,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:15:48,865 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:15:48,873 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 10:15:49,066 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 10:15:49,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:15:49,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:15:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash 84691400, now seen corresponding path program 1 times [2025-01-09 10:15:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:15:49,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637874227] [2025-01-09 10:15:49,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:15:49,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:15:49,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 10:15:49,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 10:15:49,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:15:49,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:15:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:15:49,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:15:49,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637874227] [2025-01-09 10:15:49,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637874227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:15:49,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:15:49,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:15:49,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253795158] [2025-01-09 10:15:49,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:15:49,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:15:49,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:15:49,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:15:49,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:15:49,808 INFO L87 Difference]: Start difference. First operand 102 states and 159 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:15:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:15:50,043 INFO L93 Difference]: Finished difference Result 272 states and 425 transitions. [2025-01-09 10:15:50,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:15:50,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-01-09 10:15:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:15:50,047 INFO L225 Difference]: With dead ends: 272 [2025-01-09 10:15:50,047 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 10:15:50,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:15:50,050 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 107 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:15:50,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 641 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:15:50,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 10:15:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2025-01-09 10:15:50,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 118 states have internal predecessors, (166), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 10:15:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 266 transitions. [2025-01-09 10:15:50,080 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 266 transitions. Word has length 219 [2025-01-09 10:15:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:15:50,080 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 266 transitions. [2025-01-09 10:15:50,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:15:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 266 transitions. [2025-01-09 10:15:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 10:15:50,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:15:50,086 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:15:50,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:15:50,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:15:50,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:15:50,087 INFO L85 PathProgramCache]: Analyzing trace with hash -49322106, now seen corresponding path program 1 times [2025-01-09 10:15:50,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:15:50,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287456603] [2025-01-09 10:15:50,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:15:50,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:15:50,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 10:15:50,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 10:15:50,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:15:50,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:15:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:15:50,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:15:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287456603] [2025-01-09 10:15:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287456603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:15:50,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:15:50,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:15:50,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629778813] [2025-01-09 10:15:50,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:15:50,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:15:50,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:15:50,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:15:50,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:15:50,376 INFO L87 Difference]: Start difference. First operand 170 states and 266 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:15:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:15:50,413 INFO L93 Difference]: Finished difference Result 470 states and 737 transitions. [2025-01-09 10:15:50,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:15:50,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-01-09 10:15:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:15:50,417 INFO L225 Difference]: With dead ends: 470 [2025-01-09 10:15:50,417 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 10:15:50,418 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 10:15:50,419 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 99 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:15:50,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 391 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:15:50,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 10:15:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2025-01-09 10:15:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 211 states have (on average 1.4312796208530805) internal successors, (302), 214 states have internal predecessors, (302), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 10:15:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 470 transitions. [2025-01-09 10:15:50,467 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 470 transitions. Word has length 219 [2025-01-09 10:15:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:15:50,471 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 470 transitions. [2025-01-09 10:15:50,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:15:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 470 transitions. [2025-01-09 10:15:50,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 10:15:50,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:15:50,476 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:15:50,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:15:50,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:15:50,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:15:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1934667563, now seen corresponding path program 1 times [2025-01-09 10:15:50,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:15:50,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211171241] [2025-01-09 10:15:50,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:15:50,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:15:50,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 10:15:50,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 10:15:50,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:15:50,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:15:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:15:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:15:57,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211171241] [2025-01-09 10:15:57,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211171241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:15:57,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:15:57,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 10:15:57,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546270429] [2025-01-09 10:15:57,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:15:57,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 10:15:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:15:57,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 10:15:57,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:15:57,087 INFO L87 Difference]: Start difference. First operand 300 states and 470 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 5 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 4 states have call predecessors, (34), 5 states have call successors, (34) [2025-01-09 10:16:00,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:16:00,846 INFO L93 Difference]: Finished difference Result 1042 states and 1593 transitions. [2025-01-09 10:16:00,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 10:16:00,846 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 5 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 4 states have call predecessors, (34), 5 states have call successors, (34) Word has length 220 [2025-01-09 10:16:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:16:00,855 INFO L225 Difference]: With dead ends: 1042 [2025-01-09 10:16:00,855 INFO L226 Difference]: Without dead ends: 745 [2025-01-09 10:16:00,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=307, Invalid=953, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 10:16:00,862 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 308 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:16:00,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1477 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 10:16:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-01-09 10:16:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 501. [2025-01-09 10:16:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 376 states have (on average 1.4308510638297873) internal successors, (538), 379 states have internal predecessors, (538), 118 states have call successors, (118), 6 states have call predecessors, (118), 6 states have return successors, (118), 115 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 10:16:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 774 transitions. [2025-01-09 10:16:00,923 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 774 transitions. Word has length 220 [2025-01-09 10:16:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:16:00,924 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 774 transitions. [2025-01-09 10:16:00,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 5 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 4 states have call predecessors, (34), 5 states have call successors, (34) [2025-01-09 10:16:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 774 transitions. [2025-01-09 10:16:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 10:16:00,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:16:00,928 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:16:00,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:16:00,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:16:00,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:16:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1676502125, now seen corresponding path program 1 times [2025-01-09 10:16:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:16:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369408514] [2025-01-09 10:16:00,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:16:00,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:16:00,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 10:16:00,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 10:16:00,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:16:00,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:16:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-01-09 10:16:01,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:16:01,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369408514] [2025-01-09 10:16:01,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369408514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:16:01,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:16:01,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:16:01,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766249945] [2025-01-09 10:16:01,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:16:01,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:16:01,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:16:01,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:16:01,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:16:01,188 INFO L87 Difference]: Start difference. First operand 501 states and 774 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:16:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:16:01,393 INFO L93 Difference]: Finished difference Result 1139 states and 1776 transitions. [2025-01-09 10:16:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:16:01,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2025-01-09 10:16:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:16:01,402 INFO L225 Difference]: With dead ends: 1139 [2025-01-09 10:16:01,403 INFO L226 Difference]: Without dead ends: 842 [2025-01-09 10:16:01,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 10:16:01,407 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 175 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:16:01,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 640 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:16:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-01-09 10:16:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 513. [2025-01-09 10:16:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 388 states have (on average 1.4175257731958764) internal successors, (550), 391 states have internal predecessors, (550), 118 states have call successors, (118), 6 states have call predecessors, (118), 6 states have return successors, (118), 115 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 10:16:01,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 786 transitions. [2025-01-09 10:16:01,463 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 786 transitions. Word has length 220 [2025-01-09 10:16:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:16:01,464 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 786 transitions. [2025-01-09 10:16:01,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-01-09 10:16:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 786 transitions. [2025-01-09 10:16:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 10:16:01,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:16:01,468 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:16:01,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:16:01,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:16:01,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:16:01,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1045737429, now seen corresponding path program 1 times [2025-01-09 10:16:01,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:16:01,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647043414] [2025-01-09 10:16:01,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:16:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:16:01,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 10:16:01,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 10:16:01,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:16:01,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat