./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c --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/nla-digbench-scaling/hard-ll_unwindbound1.c -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 3f64d9b496c4f5484a31fbfb0a7c6af8258ace1e653eee382e318ab929fd1285 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:26:52,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:26:52,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:26:52,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:26:52,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:26:52,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:26:52,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:26:52,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:26:52,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:26:52,845 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:26:52,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:26:52,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:26:52,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:26:52,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:26:52,848 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:26:52,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:26:52,849 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:26:52,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:26:52,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:26:52,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:26:52,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:26:52,850 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 -> 3f64d9b496c4f5484a31fbfb0a7c6af8258ace1e653eee382e318ab929fd1285 [2025-01-09 03:26:53,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:26:53,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:26:53,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:26:53,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:26:53,049 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:26:53,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c [2025-01-09 03:26:54,118 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d25afbd10/057540ea14a941f9a7aad9b4d69c9b1a/FLAGfd06dbc51 [2025-01-09 03:26:54,340 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:26:54,343 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound1.c [2025-01-09 03:26:54,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d25afbd10/057540ea14a941f9a7aad9b4d69c9b1a/FLAGfd06dbc51 [2025-01-09 03:26:54,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d25afbd10/057540ea14a941f9a7aad9b4d69c9b1a [2025-01-09 03:26:54,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:26:54,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:26:54,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:26:54,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:26:54,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:26:54,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55619b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54, skipping insertion in model container [2025-01-09 03:26:54,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:26:54,793 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/nla-digbench-scaling/hard-ll_unwindbound1.c[538,551] [2025-01-09 03:26:54,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:26:54,818 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:26:54,827 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/nla-digbench-scaling/hard-ll_unwindbound1.c[538,551] [2025-01-09 03:26:54,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:26:54,844 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:26:54,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54 WrapperNode [2025-01-09 03:26:54,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:26:54,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:26:54,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:26:54,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:26:54,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,868 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-01-09 03:26:54,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:26:54,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:26:54,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:26:54,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:26:54,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,890 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 03:26:54,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:26:54,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:26:54,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:26:54,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:26:54,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (1/1) ... [2025-01-09 03:26:54,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:26:54,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:26:54,938 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 03:26:54,941 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 03:26:54,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:26:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:26:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:26:54,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:26:54,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:26:54,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:26:54,990 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:26:54,991 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:26:55,109 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-09 03:26:55,109 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:26:55,114 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:26:55,115 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 03:26:55,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:26:55 BoogieIcfgContainer [2025-01-09 03:26:55,115 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:26:55,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:26:55,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:26:55,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:26:55,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:26:54" (1/3) ... [2025-01-09 03:26:55,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e46dc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:26:55, skipping insertion in model container [2025-01-09 03:26:55,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:26:54" (2/3) ... [2025-01-09 03:26:55,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e46dc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:26:55, skipping insertion in model container [2025-01-09 03:26:55,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:26:55" (3/3) ... [2025-01-09 03:26:55,123 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound1.c [2025-01-09 03:26:55,133 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:26:55,134 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-ll_unwindbound1.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 03:26:55,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:26:55,181 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;@6d53a565, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:26:55,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:26:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 03:26:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 03:26:55,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:26:55,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:26:55,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:26:55,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:26:55,193 INFO L85 PathProgramCache]: Analyzing trace with hash -712527539, now seen corresponding path program 1 times [2025-01-09 03:26:55,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:26:55,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915163019] [2025-01-09 03:26:55,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:26:55,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:26:55,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 03:26:55,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 03:26:55,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:55,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:26:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:26:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:26:55,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915163019] [2025-01-09 03:26:55,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915163019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:26:55,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:26:55,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:26:55,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591054991] [2025-01-09 03:26:55,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:26:55,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:26:55,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:26:55,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:26:55,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:26:55,296 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:26:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:26:55,306 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2025-01-09 03:26:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:26:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 03:26:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:26:55,311 INFO L225 Difference]: With dead ends: 53 [2025-01-09 03:26:55,311 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 03:26:55,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 03:26:55,317 INFO L435 NwaCegarLoop]: 38 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, 38 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 03:26:55,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:26:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 03:26:55,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-09 03:26:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:26:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2025-01-09 03:26:55,343 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2025-01-09 03:26:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:26:55,343 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-01-09 03:26:55,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:26:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2025-01-09 03:26:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 03:26:55,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:26:55,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:26:55,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:26:55,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:26:55,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:26:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash -2015332289, now seen corresponding path program 1 times [2025-01-09 03:26:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:26:55,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734343492] [2025-01-09 03:26:55,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:26:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:26:55,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 03:26:55,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 03:26:55,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:55,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:26:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:26:55,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:26:55,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734343492] [2025-01-09 03:26:55,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734343492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:26:55,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:26:55,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:26:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589011305] [2025-01-09 03:26:55,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:26:55,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:26:55,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:26:55,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:26:55,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:26:55,473 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:26:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:26:55,519 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2025-01-09 03:26:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:26:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 03:26:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:26:55,520 INFO L225 Difference]: With dead ends: 38 [2025-01-09 03:26:55,520 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 03:26:55,520 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 03:26:55,521 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:26:55,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:26:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 03:26:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2025-01-09 03:26:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:26:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-01-09 03:26:55,526 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2025-01-09 03:26:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:26:55,526 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-01-09 03:26:55,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:26:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-01-09 03:26:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 03:26:55,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:26:55,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:26:55,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:26:55,529 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:26:55,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:26:55,529 INFO L85 PathProgramCache]: Analyzing trace with hash 902164894, now seen corresponding path program 1 times [2025-01-09 03:26:55,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:26:55,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394414483] [2025-01-09 03:26:55,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:26:55,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:26:55,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 03:26:55,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 03:26:55,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:26:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:26:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:26:55,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394414483] [2025-01-09 03:26:55,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394414483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:26:55,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:26:55,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:26:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117423893] [2025-01-09 03:26:55,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:26:55,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:26:55,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:26:55,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:26:55,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:26:55,591 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:26:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:26:55,609 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2025-01-09 03:26:55,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:26:55,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 03:26:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:26:55,611 INFO L225 Difference]: With dead ends: 44 [2025-01-09 03:26:55,611 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 03:26:55,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:26:55,612 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:26:55,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:26:55,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 03:26:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-09 03:26:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:26:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-01-09 03:26:55,617 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2025-01-09 03:26:55,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:26:55,618 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-01-09 03:26:55,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:26:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-01-09 03:26:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 03:26:55,618 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:26:55,618 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:26:55,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:26:55,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:26:55,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:26:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1435955584, now seen corresponding path program 1 times [2025-01-09 03:26:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:26:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162252145] [2025-01-09 03:26:55,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:26:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:26:55,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 03:26:55,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 03:26:55,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:55,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:26:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:26:55,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:26:55,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162252145] [2025-01-09 03:26:55,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162252145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:26:55,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:26:55,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:26:55,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074190958] [2025-01-09 03:26:55,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:26:55,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:26:55,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:26:55,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:26:55,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:26:55,725 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:26:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:26:55,773 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2025-01-09 03:26:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:26:55,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-09 03:26:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:26:55,774 INFO L225 Difference]: With dead ends: 44 [2025-01-09 03:26:55,774 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 03:26:55,775 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 03:26:55,775 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:26:55,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:26:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 03:26:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2025-01-09 03:26:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:26:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-01-09 03:26:55,780 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2025-01-09 03:26:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:26:55,780 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-01-09 03:26:55,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:26:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-01-09 03:26:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 03:26:55,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:26:55,781 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:26:55,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:26:55,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:26:55,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:26:55,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1121341599, now seen corresponding path program 1 times [2025-01-09 03:26:55,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:26:55,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592439603] [2025-01-09 03:26:55,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:26:55,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:26:55,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:26:55,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:26:55,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:55,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:26:55,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1824597877] [2025-01-09 03:26:55,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:26:55,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:26:55,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:26:55,801 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 03:26:55,802 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 03:26:55,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 03:26:55,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 03:26:55,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:55,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:26:55,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:26:55,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:26:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 03:26:55,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:26:55,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:26:55,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592439603] [2025-01-09 03:26:55,919 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:26:55,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824597877] [2025-01-09 03:26:55,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824597877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:26:55,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:26:55,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:26:55,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006288231] [2025-01-09 03:26:55,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:26:55,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:26:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:26:55,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:26:55,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:26:55,920 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:26:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:26:55,993 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2025-01-09 03:26:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:26:55,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-01-09 03:26:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:26:55,994 INFO L225 Difference]: With dead ends: 63 [2025-01-09 03:26:55,994 INFO L226 Difference]: Without dead ends: 48 [2025-01-09 03:26:55,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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 03:26:55,994 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:26:55,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:26:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-09 03:26:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-01-09 03:26:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 03:26:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2025-01-09 03:26:56,001 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2025-01-09 03:26:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:26:56,001 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2025-01-09 03:26:56,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:26:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2025-01-09 03:26:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 03:26:56,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:26:56,002 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:26:56,008 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 03:26:56,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:26:56,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:26:56,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:26:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1012149342, now seen corresponding path program 1 times [2025-01-09 03:26:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:26:56,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226111523] [2025-01-09 03:26:56,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:26:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:26:56,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 03:26:56,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 03:26:56,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:56,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:26:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:26:56,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:26:56,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226111523] [2025-01-09 03:26:56,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226111523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:26:56,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:26:56,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:26:56,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925760135] [2025-01-09 03:26:56,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:26:56,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:26:56,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:26:56,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:26:56,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:26:56,295 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:26:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:26:56,322 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-01-09 03:26:56,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:26:56,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-01-09 03:26:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:26:56,323 INFO L225 Difference]: With dead ends: 62 [2025-01-09 03:26:56,324 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 03:26:56,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:26:56,324 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:26:56,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 46 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:26:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 03:26:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-01-09 03:26:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 03:26:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-01-09 03:26:56,334 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 28 [2025-01-09 03:26:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:26:56,334 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-01-09 03:26:56,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:26:56,334 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-01-09 03:26:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 03:26:56,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:26:56,336 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:26:56,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:26:56,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:26:56,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:26:56,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1014115548, now seen corresponding path program 1 times [2025-01-09 03:26:56,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:26:56,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872639712] [2025-01-09 03:26:56,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:26:56,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:26:56,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 03:26:56,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 03:26:56,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:56,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:26:56,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1521983135] [2025-01-09 03:26:56,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:26:56,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:26:56,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:26:56,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:26:56,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:26:56,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 03:26:56,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 03:26:56,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:56,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:26:56,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 03:26:56,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:26:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 03:26:56,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:26:56,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:26:56,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872639712] [2025-01-09 03:26:56,474 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:26:56,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521983135] [2025-01-09 03:26:56,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521983135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:26:56,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:26:56,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:26:56,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715467220] [2025-01-09 03:26:56,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:26:56,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:26:56,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:26:56,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:26:56,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:26:56,475 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:26:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:26:56,510 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-01-09 03:26:56,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:26:56,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-01-09 03:26:56,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:26:56,512 INFO L225 Difference]: With dead ends: 47 [2025-01-09 03:26:56,512 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 03:26:56,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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 03:26:56,513 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:26:56,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:26:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 03:26:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 03:26:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 03:26:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-01-09 03:26:56,522 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 28 [2025-01-09 03:26:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:26:56,522 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-01-09 03:26:56,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 03:26:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-01-09 03:26:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 03:26:56,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:26:56,524 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:26:56,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:26:56,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:26:56,724 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:26:56,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:26:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash 546954684, now seen corresponding path program 1 times [2025-01-09 03:26:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:26:56,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959205240] [2025-01-09 03:26:56,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:26:56,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:26:56,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 03:26:56,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 03:26:56,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:56,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:26:56,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085977520] [2025-01-09 03:26:56,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:26:56,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:26:56,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:26:56,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:26:56,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:26:56,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 03:26:56,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 03:26:56,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:56,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:26:56,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 03:26:56,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 03:26:56,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 03:26:56,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:26:56,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:26:56,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 03:26:56,802 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 03:26:56,803 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:26:56,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:26:57,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:26:57,010 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:26:57,024 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:26:57,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:26:57 BoogieIcfgContainer [2025-01-09 03:26:57,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:26:57,027 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:26:57,027 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:26:57,027 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:26:57,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:26:55" (3/4) ... [2025-01-09 03:26:57,028 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 03:26:57,065 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 22. [2025-01-09 03:26:57,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:26:57,110 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:26:57,110 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:26:57,111 INFO L158 Benchmark]: Toolchain (without parser) took 2421.93ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 77.2MB in the end (delta: 57.2MB). Peak memory consumption was 54.6MB. Max. memory is 16.1GB. [2025-01-09 03:26:57,111 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:26:57,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.05ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 123.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:26:57,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.34ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:26:57,112 INFO L158 Benchmark]: Boogie Preprocessor took 36.27ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 120.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:26:57,112 INFO L158 Benchmark]: RCFGBuilder took 209.89ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 108.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:26:57,112 INFO L158 Benchmark]: TraceAbstraction took 1909.74ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 83.7MB in the end (delta: 23.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2025-01-09 03:26:57,112 INFO L158 Benchmark]: Witness Printer took 82.93ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 77.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:26:57,113 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.05ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 123.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.34ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.27ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 120.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 209.89ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 108.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1909.74ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 83.7MB in the end (delta: 23.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 82.93ms. Allocated memory is still 167.8MB. Free memory was 83.7MB in the beginning and 77.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] unsigned int A, B; [L25] long long r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) [L12] COND FALSE !(!cond) VAL [counter=0] [L28] RET assume_abort_if_not(B >= 1) [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [A=1, B=1, counter=0, d=1, p=1, q=0, r=1] [L35] EXPR counter++ VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L35] COND TRUE counter++<1 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=1, B=1, counter=1, d=1, p=1, q=0, r=1] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=1, B=1, counter=1, d=2, p=2, q=0, r=1] [L35] EXPR counter++ VAL [A=1, B=1, counter=2, d=2, p=2, q=0, r=1] [L35] COND FALSE !(counter++<1) [L45] EXPR counter++ VAL [A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L45] COND FALSE !(counter++<1) [L59] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L59] RET __VERIFIER_assert(A == d*q + r) VAL [A=1, B=1, counter=3, d=2, p=2, q=0, r=1] [L60] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 542 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 342 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 200 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 302 SizeOfPredicates, 2 NumberOfNonLiveVariables, 151 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 46/46 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 03:26:57,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE