./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.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_100-1loop_file-14.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 8b9b5c3584162f1ac164bc4062f8fb20bbcdce8e443da62cb4410d73442b6f23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:49:38,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:49:38,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:49:38,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:49:38,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:49:38,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:49:38,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:49:38,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:49:38,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:49:38,305 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:49:38,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:49:38,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:49:38,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:49:38,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:49:38,308 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:49:38,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:49:38,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:49:38,308 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:49:38,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:49:38,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:49:38,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:49:38,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:49:38,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:49:38,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:49:38,309 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:49:38,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:49:38,309 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:49:38,309 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:49:38,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:49:38,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:49:38,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:49:38,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:49:38,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:49:38,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:49:38,311 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 -> 8b9b5c3584162f1ac164bc4062f8fb20bbcdce8e443da62cb4410d73442b6f23 [2025-01-09 12:49:38,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:49:38,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:49:38,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:49:38,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:49:38,600 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:49:38,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.i [2025-01-09 12:49:39,812 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d59af01b6/b046a763c1d2421da8a8394ed7c6ce81/FLAG6131d1513 [2025-01-09 12:49:40,094 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:49:40,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.i [2025-01-09 12:49:40,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d59af01b6/b046a763c1d2421da8a8394ed7c6ce81/FLAG6131d1513 [2025-01-09 12:49:40,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d59af01b6/b046a763c1d2421da8a8394ed7c6ce81 [2025-01-09 12:49:40,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:49:40,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:49:40,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:49:40,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:49:40,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:49:40,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c453938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40, skipping insertion in model container [2025-01-09 12:49:40,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:49:40,556 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_100-1loop_file-14.i[916,929] [2025-01-09 12:49:40,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:49:40,679 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:49:40,689 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_100-1loop_file-14.i[916,929] [2025-01-09 12:49:40,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:49:40,763 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:49:40,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40 WrapperNode [2025-01-09 12:49:40,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:49:40,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:49:40,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:49:40,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:49:40,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,824 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 279 [2025-01-09 12:49:40,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:49:40,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:49:40,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:49:40,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:49:40,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,870 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 12:49:40,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:49:40,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:49:40,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:49:40,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:49:40,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (1/1) ... [2025-01-09 12:49:40,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:49:40,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:49:40,951 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 12:49:40,956 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 12:49:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:49:40,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:49:40,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:49:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:49:40,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:49:40,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:49:41,081 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:49:41,083 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:49:41,637 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 12:49:41,640 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:49:41,653 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:49:41,654 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:49:41,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:49:41 BoogieIcfgContainer [2025-01-09 12:49:41,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:49:41,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:49:41,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:49:41,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:49:41,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:49:40" (1/3) ... [2025-01-09 12:49:41,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df8f45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:49:41, skipping insertion in model container [2025-01-09 12:49:41,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:49:40" (2/3) ... [2025-01-09 12:49:41,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df8f45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:49:41, skipping insertion in model container [2025-01-09 12:49:41,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:49:41" (3/3) ... [2025-01-09 12:49:41,665 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-14.i [2025-01-09 12:49:41,678 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:49:41,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-14.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:49:41,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:49:41,755 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;@5aeb8d20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:49:41,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:49:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 12:49:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 12:49:41,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:49:41,772 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:41,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:49:41,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:49:41,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1335418435, now seen corresponding path program 1 times [2025-01-09 12:49:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:49:41,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630736858] [2025-01-09 12:49:41,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:49:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:49:41,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 12:49:41,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 12:49:41,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:49:41,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:49:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 12:49:42,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:49:42,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630736858] [2025-01-09 12:49:42,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630736858] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:49:42,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016323567] [2025-01-09 12:49:42,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:49:42,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:49:42,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:49:42,154 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 12:49:42,156 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 12:49:42,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 12:49:42,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 12:49:42,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:49:42,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:49:42,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:49:42,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:49:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-01-09 12:49:42,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:49:42,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016323567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:49:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:49:42,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:49:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119892150] [2025-01-09 12:49:42,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:49:42,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:49:42,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:49:42,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:49:42,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:49:42,498 INFO L87 Difference]: Start difference. First operand has 114 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:49:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:49:42,523 INFO L93 Difference]: Finished difference Result 224 states and 384 transitions. [2025-01-09 12:49:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:49:42,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-01-09 12:49:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:49:42,531 INFO L225 Difference]: With dead ends: 224 [2025-01-09 12:49:42,531 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 12:49:42,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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 12:49:42,537 INFO L435 NwaCegarLoop]: 174 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, 174 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 12:49:42,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:49:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 12:49:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 12:49:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 12:49:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 171 transitions. [2025-01-09 12:49:42,586 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 171 transitions. Word has length 202 [2025-01-09 12:49:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:49:42,586 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 171 transitions. [2025-01-09 12:49:42,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 12:49:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 171 transitions. [2025-01-09 12:49:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 12:49:42,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:49:42,591 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:42,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:49:42,797 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 12:49:42,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:49:42,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:49:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -300856193, now seen corresponding path program 1 times [2025-01-09 12:49:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:49:42,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66203123] [2025-01-09 12:49:42,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:49:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:49:42,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 12:49:42,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 12:49:42,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:49:42,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:49:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:49:43,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:49:43,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66203123] [2025-01-09 12:49:43,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66203123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:49:43,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:49:43,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:49:43,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461733441] [2025-01-09 12:49:43,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:49:43,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:49:43,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:49:43,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:49:43,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:49:43,346 INFO L87 Difference]: Start difference. First operand 110 states and 171 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:49:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:49:43,402 INFO L93 Difference]: Finished difference Result 218 states and 341 transitions. [2025-01-09 12:49:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:49:43,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-01-09 12:49:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:49:43,407 INFO L225 Difference]: With dead ends: 218 [2025-01-09 12:49:43,407 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 12:49:43,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:49:43,409 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 4 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:49:43,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 495 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:49:43,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 12:49:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 12:49:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 12:49:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2025-01-09 12:49:43,427 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 202 [2025-01-09 12:49:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:49:43,428 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2025-01-09 12:49:43,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:49:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2025-01-09 12:49:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 12:49:43,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:49:43,432 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:43,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:49:43,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:49:43,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:49:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1593527972, now seen corresponding path program 1 times [2025-01-09 12:49:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:49:43,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404074948] [2025-01-09 12:49:43,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:49:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:49:43,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 12:49:43,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 12:49:43,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:49:43,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:49:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:49:44,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:49:44,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404074948] [2025-01-09 12:49:44,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404074948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:49:44,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:49:44,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:49:44,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813740923] [2025-01-09 12:49:44,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:49:44,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:49:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:49:44,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:49:44,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:49:44,981 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:49:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:49:45,272 INFO L93 Difference]: Finished difference Result 228 states and 351 transitions. [2025-01-09 12:49:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:49:45,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-01-09 12:49:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:49:45,278 INFO L225 Difference]: With dead ends: 228 [2025-01-09 12:49:45,278 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 12:49:45,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:49:45,281 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 73 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:49:45,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 505 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:49:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 12:49:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-01-09 12:49:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 84 states have internal predecessors, (114), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:49:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2025-01-09 12:49:45,301 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 203 [2025-01-09 12:49:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:49:45,301 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2025-01-09 12:49:45,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:49:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2025-01-09 12:49:45,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 12:49:45,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:49:45,305 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:49:45,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:49:45,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:49:45,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:49:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash 371548759, now seen corresponding path program 1 times [2025-01-09 12:49:45,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:49:45,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143316929] [2025-01-09 12:49:45,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:49:45,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:49:45,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:49:45,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:49:45,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:49:45,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:50:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 12:50:37,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:50:37,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143316929] [2025-01-09 12:50:37,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143316929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:50:37,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:50:37,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 12:50:37,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495253601] [2025-01-09 12:50:37,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:50:37,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:50:37,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:50:37,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:50:37,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:50:37,932 INFO L87 Difference]: Start difference. First operand 119 states and 180 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:50:48,004 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2025-01-09 12:50:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 12:50:48,005 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2025-01-09 12:50:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:50:48,009 INFO L225 Difference]: With dead ends: 503 [2025-01-09 12:50:48,009 INFO L226 Difference]: Without dead ends: 391 [2025-01-09 12:50:48,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=220, Invalid=430, Unknown=0, NotChecked=0, Total=650 [2025-01-09 12:50:48,011 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 717 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:50:48,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1152 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 12:50:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-01-09 12:50:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 220. [2025-01-09 12:50:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 169 states have (on average 1.4142011834319526) internal successors, (239), 171 states have internal predecessors, (239), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 12:50:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 331 transitions. [2025-01-09 12:50:48,047 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 331 transitions. Word has length 205 [2025-01-09 12:50:48,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:50:48,048 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 331 transitions. [2025-01-09 12:50:48,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 12:50:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 331 transitions. [2025-01-09 12:50:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 12:50:48,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:50:48,051 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:50:48,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:50:48,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:50:48,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:50:48,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1072613337, now seen corresponding path program 1 times [2025-01-09 12:50:48,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:50:48,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891830320] [2025-01-09 12:50:48,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:50:48,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:50:48,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 12:50:48,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 12:50:48,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:50:48,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat