./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:16:10,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:16:10,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:16:10,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:16:10,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:16:10,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:16:10,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:16:10,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:16:10,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:16:10,196 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:16:10,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:16:10,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:16:10,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:16:10,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:16:10,197 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:16:10,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:16:10,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:16:10,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:16:10,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:16:10,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:16:10,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:16:10,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:16:10,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:16:10,198 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:16:10,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:16:10,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:16:10,199 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 [2025-02-05 20:16:10,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:16:10,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:16:10,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:16:10,363 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:16:10,363 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:16:10,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2025-02-05 20:16:11,520 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d4a0cf94/b04e208e1ab244c9b920af050667bf09/FLAG39445dc6f [2025-02-05 20:16:11,842 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:16:11,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2025-02-05 20:16:11,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d4a0cf94/b04e208e1ab244c9b920af050667bf09/FLAG39445dc6f [2025-02-05 20:16:11,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d4a0cf94/b04e208e1ab244c9b920af050667bf09 [2025-02-05 20:16:11,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:16:11,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:16:11,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:16:11,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:16:11,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:16:11,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:16:11" (1/1) ... [2025-02-05 20:16:11,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72143edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:11, skipping insertion in model container [2025-02-05 20:16:11,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:16:11" (1/1) ... [2025-02-05 20:16:11,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:16:12,030 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c[1259,1272] [2025-02-05 20:16:12,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:16:12,218 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:16:12,226 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c[1259,1272] [2025-02-05 20:16:12,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:16:12,327 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:16:12,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12 WrapperNode [2025-02-05 20:16:12,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:16:12,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:16:12,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:16:12,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:16:12,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,550 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2136 [2025-02-05 20:16:12,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:16:12,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:16:12,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:16:12,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:16:12,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,645 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-02-05 20:16:12,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,779 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:16:12,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:16:12,840 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:16:12,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:16:12,841 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (1/1) ... [2025-02-05 20:16:12,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:16:12,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:16:12,873 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-02-05 20:16:12,877 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-02-05 20:16:12,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:16:12,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:16:12,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:16:12,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:16:13,137 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:16:13,138 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:16:14,772 INFO L? ?]: Removed 1339 outVars from TransFormulas that were not future-live. [2025-02-05 20:16:14,772 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:16:14,855 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:16:14,858 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:16:14,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:14 BoogieIcfgContainer [2025-02-05 20:16:14,859 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:16:14,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:16:14,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:16:14,865 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:16:14,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:16:11" (1/3) ... [2025-02-05 20:16:14,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55af7452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:16:14, skipping insertion in model container [2025-02-05 20:16:14,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:12" (2/3) ... [2025-02-05 20:16:14,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55af7452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:16:14, skipping insertion in model container [2025-02-05 20:16:14,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:14" (3/3) ... [2025-02-05 20:16:14,867 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p14.c [2025-02-05 20:16:14,879 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:16:14,880 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p14.c that has 1 procedures, 539 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:16:14,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:16:14,948 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;@71145dbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:16:14,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:16:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 539 states, 537 states have (on average 1.499068901303538) internal successors, (805), 538 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 20:16:14,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:14,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:14,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:14,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash -546205231, now seen corresponding path program 1 times [2025-02-05 20:16:14,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:14,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389818383] [2025-02-05 20:16:14,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:14,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:15,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 20:16:15,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 20:16:15,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:15,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:15,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:15,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389818383] [2025-02-05 20:16:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389818383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:15,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:15,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:16:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543245747] [2025-02-05 20:16:15,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:15,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:16:15,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:15,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:16:15,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:16:15,543 INFO L87 Difference]: Start difference. First operand has 539 states, 537 states have (on average 1.499068901303538) internal successors, (805), 538 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:15,876 INFO L93 Difference]: Finished difference Result 1023 states and 1531 transitions. [2025-02-05 20:16:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:16:15,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-05 20:16:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:15,886 INFO L225 Difference]: With dead ends: 1023 [2025-02-05 20:16:15,886 INFO L226 Difference]: Without dead ends: 538 [2025-02-05 20:16:15,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-05 20:16:15,894 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 0 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:15,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1996 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:15,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-02-05 20:16:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-02-05 20:16:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.495344506517691) internal successors, (803), 537 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 803 transitions. [2025-02-05 20:16:15,931 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 803 transitions. Word has length 43 [2025-02-05 20:16:15,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:15,932 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 803 transitions. [2025-02-05 20:16:15,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 803 transitions. [2025-02-05 20:16:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 20:16:15,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:15,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:15,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:16:15,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:15,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:15,933 INFO L85 PathProgramCache]: Analyzing trace with hash 252186961, now seen corresponding path program 1 times [2025-02-05 20:16:15,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:15,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851401413] [2025-02-05 20:16:15,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:15,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:15,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 20:16:15,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 20:16:15,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:15,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:16,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851401413] [2025-02-05 20:16:16,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851401413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:16,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:16,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:16:16,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942097354] [2025-02-05 20:16:16,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:16,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:16:16,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:16,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:16:16,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:16:16,108 INFO L87 Difference]: Start difference. First operand 538 states and 803 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:16,473 INFO L93 Difference]: Finished difference Result 1024 states and 1529 transitions. [2025-02-05 20:16:16,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:16:16,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-02-05 20:16:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:16,475 INFO L225 Difference]: With dead ends: 1024 [2025-02-05 20:16:16,475 INFO L226 Difference]: Without dead ends: 540 [2025-02-05 20:16:16,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-02-05 20:16:16,476 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 0 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:16,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1993 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-05 20:16:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-02-05 20:16:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.4935064935064934) internal successors, (805), 539 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 805 transitions. [2025-02-05 20:16:16,489 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 805 transitions. Word has length 44 [2025-02-05 20:16:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:16,490 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 805 transitions. [2025-02-05 20:16:16,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 805 transitions. [2025-02-05 20:16:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 20:16:16,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:16,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:16,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:16:16,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:16,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:16,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1159371212, now seen corresponding path program 1 times [2025-02-05 20:16:16,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:16,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339230620] [2025-02-05 20:16:16,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:16,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:16,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 20:16:16,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 20:16:16,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:16,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:16,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:16,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339230620] [2025-02-05 20:16:16,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339230620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:16,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:16,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:16:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413682889] [2025-02-05 20:16:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:16,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:16:16,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:16,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:16:16,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:16:16,860 INFO L87 Difference]: Start difference. First operand 540 states and 805 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:17,256 INFO L93 Difference]: Finished difference Result 1030 states and 1536 transitions. [2025-02-05 20:16:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:17,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-02-05 20:16:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:17,259 INFO L225 Difference]: With dead ends: 1030 [2025-02-05 20:16:17,259 INFO L226 Difference]: Without dead ends: 544 [2025-02-05 20:16:17,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:16:17,260 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 773 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 3287 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:17,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 3287 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:16:17,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-02-05 20:16:17,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 543. [2025-02-05 20:16:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.4907749077490775) internal successors, (808), 542 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 808 transitions. [2025-02-05 20:16:17,280 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 808 transitions. Word has length 45 [2025-02-05 20:16:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:17,281 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 808 transitions. [2025-02-05 20:16:17,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 808 transitions. [2025-02-05 20:16:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 20:16:17,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:17,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:17,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:16:17,282 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:17,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:17,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1180830420, now seen corresponding path program 1 times [2025-02-05 20:16:17,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:17,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301328926] [2025-02-05 20:16:17,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:17,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:17,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 20:16:17,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 20:16:17,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:17,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:17,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301328926] [2025-02-05 20:16:17,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301328926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:17,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:17,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:16:17,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158485335] [2025-02-05 20:16:17,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:17,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:16:17,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:17,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:16:17,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:16:17,624 INFO L87 Difference]: Start difference. First operand 543 states and 808 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:18,138 INFO L93 Difference]: Finished difference Result 1036 states and 1542 transitions. [2025-02-05 20:16:18,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:16:18,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-05 20:16:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:18,140 INFO L225 Difference]: With dead ends: 1036 [2025-02-05 20:16:18,140 INFO L226 Difference]: Without dead ends: 547 [2025-02-05 20:16:18,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-05 20:16:18,141 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 2 mSDsluCounter, 1324 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:18,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1989 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:16:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-05 20:16:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2025-02-05 20:16:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4889705882352942) internal successors, (810), 544 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 810 transitions. [2025-02-05 20:16:18,150 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 810 transitions. Word has length 46 [2025-02-05 20:16:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:18,150 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 810 transitions. [2025-02-05 20:16:18,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 810 transitions. [2025-02-05 20:16:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 20:16:18,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:18,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:18,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:16:18,151 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:18,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash -825834794, now seen corresponding path program 1 times [2025-02-05 20:16:18,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:18,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874031922] [2025-02-05 20:16:18,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:18,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:18,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 20:16:18,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 20:16:18,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:18,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:18,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874031922] [2025-02-05 20:16:18,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874031922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:18,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:18,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:18,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554213437] [2025-02-05 20:16:18,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:18,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:18,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:18,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:18,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:18,324 INFO L87 Difference]: Start difference. First operand 545 states and 810 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:18,677 INFO L93 Difference]: Finished difference Result 1040 states and 1546 transitions. [2025-02-05 20:16:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:18,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-05 20:16:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:18,682 INFO L225 Difference]: With dead ends: 1040 [2025-02-05 20:16:18,682 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 20:16:18,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:18,684 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 1 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3307 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:18,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3307 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:16:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 20:16:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 548. [2025-02-05 20:16:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 547 states have (on average 1.4881170018281535) internal successors, (814), 547 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 814 transitions. [2025-02-05 20:16:18,693 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 814 transitions. Word has length 46 [2025-02-05 20:16:18,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:18,694 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 814 transitions. [2025-02-05 20:16:18,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 814 transitions. [2025-02-05 20:16:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 20:16:18,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:18,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:18,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:16:18,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:18,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash 596704483, now seen corresponding path program 1 times [2025-02-05 20:16:18,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:18,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092739438] [2025-02-05 20:16:18,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:18,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 20:16:18,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 20:16:18,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:18,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:19,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:19,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092739438] [2025-02-05 20:16:19,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092739438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:19,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:19,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:16:19,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029699404] [2025-02-05 20:16:19,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:19,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:16:19,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:19,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:16:19,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:16:19,026 INFO L87 Difference]: Start difference. First operand 548 states and 814 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:19,456 INFO L93 Difference]: Finished difference Result 1047 states and 1555 transitions. [2025-02-05 20:16:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:16:19,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-05 20:16:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:19,458 INFO L225 Difference]: With dead ends: 1047 [2025-02-05 20:16:19,458 INFO L226 Difference]: Without dead ends: 553 [2025-02-05 20:16:19,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:16:19,459 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 771 mSDsluCounter, 2631 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 3292 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:19,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 3292 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:16:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-02-05 20:16:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 551. [2025-02-05 20:16:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.4872727272727273) internal successors, (818), 550 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 818 transitions. [2025-02-05 20:16:19,471 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 818 transitions. Word has length 47 [2025-02-05 20:16:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:19,472 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 818 transitions. [2025-02-05 20:16:19,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 818 transitions. [2025-02-05 20:16:19,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 20:16:19,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:19,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:19,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:16:19,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:19,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1419578683, now seen corresponding path program 1 times [2025-02-05 20:16:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:19,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813096302] [2025-02-05 20:16:19,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:19,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:19,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 20:16:19,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 20:16:19,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:19,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:19,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:16:19,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813096302] [2025-02-05 20:16:19,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813096302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:19,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:19,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:16:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807722098] [2025-02-05 20:16:19,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:19,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:16:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:16:19,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:16:19,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:16:19,688 INFO L87 Difference]: Start difference. First operand 551 states and 818 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:20,126 INFO L93 Difference]: Finished difference Result 1242 states and 1840 transitions. [2025-02-05 20:16:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:16:20,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-05 20:16:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:20,130 INFO L225 Difference]: With dead ends: 1242 [2025-02-05 20:16:20,130 INFO L226 Difference]: Without dead ends: 745 [2025-02-05 20:16:20,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:16:20,132 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 1335 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:20,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 2594 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:16:20,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-02-05 20:16:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 561. [2025-02-05 20:16:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 1.4857142857142858) internal successors, (832), 560 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 832 transitions. [2025-02-05 20:16:20,145 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 832 transitions. Word has length 47 [2025-02-05 20:16:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:20,146 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 832 transitions. [2025-02-05 20:16:20,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 832 transitions. [2025-02-05 20:16:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 20:16:20,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:20,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:20,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:16:20,148 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:20,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash 918031005, now seen corresponding path program 1 times [2025-02-05 20:16:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:16:20,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782000974] [2025-02-05 20:16:20,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:16:20,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 20:16:20,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 20:16:20,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:20,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:16:20,197 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:16:20,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 20:16:20,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 20:16:20,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:20,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:16:20,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:16:20,270 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:16:20,270 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:16:20,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:16:20,275 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:20,314 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 20:16:20,325 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:16:20,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:16:20 BoogieIcfgContainer [2025-02-05 20:16:20,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:16:20,328 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:16:20,328 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:16:20,329 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:16:20,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:14" (3/4) ... [2025-02-05 20:16:20,331 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:16:20,331 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:16:20,333 INFO L158 Benchmark]: Toolchain (without parser) took 8468.26ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 104.0MB in the beginning and 217.5MB in the end (delta: -113.5MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2025-02-05 20:16:20,333 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:16:20,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.83ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 60.4MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 20:16:20,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 222.21ms. Allocated memory is still 142.6MB. Free memory was 60.4MB in the beginning and 68.3MB in the end (delta: -7.9MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2025-02-05 20:16:20,334 INFO L158 Benchmark]: Boogie Preprocessor took 286.74ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 77.4MB in the end (delta: -9.1MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2025-02-05 20:16:20,334 INFO L158 Benchmark]: IcfgBuilder took 2019.89ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 77.4MB in the beginning and 130.2MB in the end (delta: -52.8MB). Peak memory consumption was 179.6MB. Max. memory is 16.1GB. [2025-02-05 20:16:20,335 INFO L158 Benchmark]: TraceAbstraction took 5466.73ms. Allocated memory was 285.2MB in the beginning and 343.9MB in the end (delta: 58.7MB). Free memory was 130.2MB in the beginning and 217.5MB in the end (delta: -87.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:16:20,335 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 343.9MB. Free memory was 217.5MB in the beginning and 217.5MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:16:20,336 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.18ms. Allocated memory is still 226.5MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.83ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 60.4MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 222.21ms. Allocated memory is still 142.6MB. Free memory was 60.4MB in the beginning and 68.3MB in the end (delta: -7.9MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 286.74ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 77.4MB in the end (delta: -9.1MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * IcfgBuilder took 2019.89ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 77.4MB in the beginning and 130.2MB in the end (delta: -52.8MB). Peak memory consumption was 179.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5466.73ms. Allocated memory was 285.2MB in the beginning and 343.9MB in the end (delta: 58.7MB). Free memory was 130.2MB in the beginning and 217.5MB in the end (delta: -87.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 343.9MB. Free memory was 217.5MB in the beginning and 217.5MB in the end (delta: 42.9kB). There was no memory consumed. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 171, overapproximation of bitwiseAnd at line 176. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_78 mask_SORT_78 = (SORT_78)-1 >> (sizeof(SORT_78) * 8 - 32); [L39] const SORT_78 msb_SORT_78 = (SORT_78)1 << (32 - 1); [L41] const SORT_107 mask_SORT_107 = (SORT_107)-1 >> (sizeof(SORT_107) * 8 - 4); [L42] const SORT_107 msb_SORT_107 = (SORT_107)1 << (4 - 1); [L44] const SORT_174 mask_SORT_174 = (SORT_174)-1 >> (sizeof(SORT_174) * 8 - 2); [L45] const SORT_174 msb_SORT_174 = (SORT_174)1 << (2 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_5 var_12 = 0; [L49] const SORT_7 var_16 = 2; [L50] const SORT_1 var_19 = 0; [L51] const SORT_3 var_26 = 0; [L52] const SORT_1 var_35 = 1; [L53] const SORT_7 var_57 = 1; [L54] const SORT_7 var_62 = 4; [L55] const SORT_7 var_64 = 5; [L56] const SORT_7 var_68 = 3; [L57] const SORT_78 var_80 = 0; [L58] const SORT_3 var_94 = 2; [L59] const SORT_7 var_124 = 7; [L60] const SORT_7 var_129 = 6; [L61] const SORT_3 var_183 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_171; [L67] SORT_3 input_172; [L68] SORT_3 input_173; [L69] SORT_3 input_182; [L70] SORT_3 input_192; [L71] SORT_3 input_193; [L72] SORT_3 input_194; [L73] SORT_3 input_197; [L74] SORT_3 input_216; [L75] SORT_3 input_217; [L76] SORT_3 input_218; [L77] SORT_3 input_221; [L78] SORT_3 input_223; [L79] SORT_174 input_237; [L80] SORT_174 input_238; [L81] SORT_174 input_239; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L84] SORT_5 state_13 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L85] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L86] SORT_3 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L87] SORT_3 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L88] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L89] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L90] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L91] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L92] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L93] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L94] SORT_3 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, var_124=7, var_129=6, var_12=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L95] SORT_3 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_7 init_10_arg_1 = var_8; [L98] state_9 = init_10_arg_1 [L99] SORT_5 init_14_arg_1 = var_12; [L100] state_13 = init_14_arg_1 [L101] SORT_1 init_21_arg_1 = var_19; [L102] state_20 = init_21_arg_1 [L103] SORT_3 init_28_arg_1 = var_26; [L104] state_27 = init_28_arg_1 [L105] SORT_3 init_30_arg_1 = var_26; [L106] state_29 = init_30_arg_1 [L107] SORT_3 init_40_arg_1 = var_26; [L108] state_39 = init_40_arg_1 [L109] SORT_3 init_42_arg_1 = var_26; [L110] state_41 = init_42_arg_1 [L111] SORT_3 init_44_arg_1 = var_26; [L112] state_43 = init_44_arg_1 [L113] SORT_3 init_46_arg_1 = var_26; [L114] state_45 = init_46_arg_1 [L115] SORT_3 init_48_arg_1 = var_26; [L116] state_47 = init_48_arg_1 [L117] SORT_3 init_50_arg_1 = var_26; [L118] state_49 = init_50_arg_1 [L119] SORT_3 init_52_arg_1 = var_26; [L120] state_51 = init_52_arg_1 [L121] SORT_3 init_54_arg_1 = var_26; [L122] state_53 = init_54_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_171 = __VERIFIER_nondet_uchar() [L129] input_172 = __VERIFIER_nondet_uchar() [L130] input_173 = __VERIFIER_nondet_uchar() [L131] input_182 = __VERIFIER_nondet_uchar() [L132] input_192 = __VERIFIER_nondet_uchar() [L133] input_193 = __VERIFIER_nondet_uchar() [L134] input_194 = __VERIFIER_nondet_uchar() [L135] input_197 = __VERIFIER_nondet_uchar() [L136] input_216 = __VERIFIER_nondet_uchar() [L137] input_217 = __VERIFIER_nondet_uchar() [L138] input_218 = __VERIFIER_nondet_uchar() [L139] input_221 = __VERIFIER_nondet_uchar() [L140] input_223 = __VERIFIER_nondet_uchar() [L141] input_237 = __VERIFIER_nondet_uchar() [L142] input_238 = __VERIFIER_nondet_uchar() [L143] input_239 = __VERIFIER_nondet_uchar() [L146] SORT_7 var_11_arg_0 = state_9; [L147] SORT_1 var_11 = var_11_arg_0 >> 2; [L148] SORT_5 var_15_arg_0 = state_13; [L149] SORT_7 var_15 = var_15_arg_0 >> 9; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L150] EXPR var_15 & mask_SORT_7 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_16=2, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L150] var_15 = var_15 & mask_SORT_7 [L151] SORT_7 var_17_arg_0 = var_15; [L152] SORT_7 var_17_arg_1 = var_16; [L153] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L154] SORT_1 var_18_arg_0 = var_17; [L155] SORT_1 var_18 = ~var_18_arg_0; [L156] SORT_1 var_22_arg_0 = state_20; [L157] SORT_1 var_22 = ~var_22_arg_0; [L158] SORT_1 var_23_arg_0 = var_18; [L159] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_23_arg_0=-1, var_23_arg_1=-1, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L160] EXPR var_23_arg_0 | var_23_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_11=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L160] SORT_1 var_23 = var_23_arg_0 | var_23_arg_1; [L161] SORT_1 var_24_arg_0 = var_11; [L162] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_24_arg_0=0, var_24_arg_1=255, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L163] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L163] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L164] SORT_1 var_25_arg_0 = var_24; [L165] SORT_1 var_25 = ~var_25_arg_0; [L166] SORT_3 var_31_arg_0 = state_27; [L167] SORT_3 var_31_arg_1 = state_29; [L168] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L169] SORT_1 var_32_arg_0 = var_25; [L170] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_32_arg_0=-1, var_32_arg_1=1, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L171] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L171] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L172] SORT_1 var_36_arg_0 = var_32; [L173] SORT_1 var_36 = ~var_36_arg_0; [L174] SORT_1 var_37_arg_0 = var_35; [L175] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_37_arg_0=1, var_37_arg_1=-1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L176] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L176] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L177] EXPR var_37 & mask_SORT_1 VAL [mask_SORT_107=15, mask_SORT_174=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_7=7, state_13=0, state_20=0, state_27=0, state_29=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_9=0, var_124=7, var_129=6, var_15=0, var_16=2, var_17=0, var_183=31, var_19=0, var_26=0, var_35=1, var_57=1, var_62=4, var_64=5, var_68=3, var_80=0, var_8=0, var_94=2] [L177] var_37 = var_37 & mask_SORT_1 [L178] SORT_1 bad_38_arg_0 = var_37; [L179] CALL __VERIFIER_assert(!(bad_38_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 539 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2882 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2882 mSDsluCounter, 18458 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13824 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3974 IncrementalHoareTripleChecker+Invalid, 3976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 4634 mSDtfsCounter, 3974 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=561occurred in iteration=7, InterpolantAutomatonStates: 38, 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, 190 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2025-02-05 20:16:20,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:16:22,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:16:22,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 20:16:22,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:16:22,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:16:22,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:16:22,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:16:22,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:16:22,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:16:22,454 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:16:22,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:16:22,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:16:22,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:16:22,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:16:22,455 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:16:22,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:16:22,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:16:22,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:16:22,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:16:22,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:16:22,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:16:22,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:16:22,456 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:16:22,456 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:16:22,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:16:22,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:16:22,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:16:22,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:16:22,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:16:22,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:16:22,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:16:22,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:16:22,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:16:22,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:16:22,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:16:22,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:16:22,457 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:16:22,457 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:16:22,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:16:22,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:16:22,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:16:22,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:16:22,458 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 422986a7dcf99d4b0e96a15a0ba07b8ed6118724772e8af056de2de5bc5122f8 [2025-02-05 20:16:22,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:16:22,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:16:22,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:16:22,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:16:22,711 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:16:22,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2025-02-05 20:16:23,846 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc8f73fff/b0a960edb4694127b101b86cb5e67b36/FLAGff8c6a368 [2025-02-05 20:16:24,130 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:16:24,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c [2025-02-05 20:16:24,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc8f73fff/b0a960edb4694127b101b86cb5e67b36/FLAGff8c6a368 [2025-02-05 20:16:24,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc8f73fff/b0a960edb4694127b101b86cb5e67b36 [2025-02-05 20:16:24,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:16:24,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:16:24,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:16:24,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:16:24,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:16:24,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:24,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774f141f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24, skipping insertion in model container [2025-02-05 20:16:24,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:24,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:16:24,609 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c[1259,1272] [2025-02-05 20:16:24,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:16:24,773 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:16:24,781 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p14.c[1259,1272] [2025-02-05 20:16:24,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:16:24,877 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:16:24,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24 WrapperNode [2025-02-05 20:16:24,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:16:24,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:16:24,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:16:24,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:16:24,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:24,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:24,979 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1078 [2025-02-05 20:16:24,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:16:24,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:16:24,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:16:24,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:16:24,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:24,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:25,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:25,043 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-02-05 20:16:25,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:25,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:25,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:25,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:25,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:25,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:25,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:16:25,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:16:25,100 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:16:25,100 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:16:25,101 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (1/1) ... [2025-02-05 20:16:25,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:16:25,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:16:25,154 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-02-05 20:16:25,161 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-02-05 20:16:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:16:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:16:25,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:16:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:16:25,365 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:16:25,367 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:16:26,384 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-02-05 20:16:26,385 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:16:26,390 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:16:26,390 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:16:26,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:26 BoogieIcfgContainer [2025-02-05 20:16:26,391 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:16:26,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:16:26,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:16:26,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:16:26,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:16:24" (1/3) ... [2025-02-05 20:16:26,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b38966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:16:26, skipping insertion in model container [2025-02-05 20:16:26,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:16:24" (2/3) ... [2025-02-05 20:16:26,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b38966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:16:26, skipping insertion in model container [2025-02-05 20:16:26,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:16:26" (3/3) ... [2025-02-05 20:16:26,401 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p14.c [2025-02-05 20:16:26,414 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:16:26,415 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p14.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:16:26,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:16:26,467 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;@39402cb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:16:26,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:16:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 20:16:26,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:26,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 20:16:26,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:26,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:26,480 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 20:16:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:16:26,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1585049695] [2025-02-05 20:16:26,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:26,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:16:26,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:16:26,509 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-02-05 20:16:26,514 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-02-05 20:16:26,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 20:16:26,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 20:16:26,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:26,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:26,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 20:16:26,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:16:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:26,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:16:26,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:16:26,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585049695] [2025-02-05 20:16:26,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585049695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:16:26,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:16:26,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:16:26,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003780276] [2025-02-05 20:16:26,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:16:26,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:16:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:16:26,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:16:26,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:16:26,885 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:26,939 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 20:16:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:16:26,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-05 20:16:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:26,945 INFO L225 Difference]: With dead ends: 18 [2025-02-05 20:16:26,945 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 20:16:26,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:16:26,950 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 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-02-05 20:16:26,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:16:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 20:16:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 20:16:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:26,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 20:16:26,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 20:16:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:26,969 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 20:16:26,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 20:16:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 20:16:26,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:26,971 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 20:16:26,980 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-02-05 20:16:27,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:16:27,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:27,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:27,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 20:16:27,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:16:27,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281484392] [2025-02-05 20:16:27,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:16:27,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:16:27,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:16:27,182 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-02-05 20:16:27,184 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-02-05 20:16:27,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 20:16:27,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 20:16:27,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:16:27,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:27,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-05 20:16:27,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:16:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:27,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:16:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:16:27,914 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:16:27,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281484392] [2025-02-05 20:16:27,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281484392] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:16:27,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:16:27,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 20:16:27,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317476593] [2025-02-05 20:16:27,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:16:27,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:16:27,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:16:27,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:16:27,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:16:27,917 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:16:28,198 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-02-05 20:16:28,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 20:16:28,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 20:16:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:16:28,198 INFO L225 Difference]: With dead ends: 18 [2025-02-05 20:16:28,198 INFO L226 Difference]: Without dead ends: 16 [2025-02-05 20:16:28,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:16:28,200 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:16:28,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:16:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-05 20:16:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-02-05 20:16:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-02-05 20:16:28,206 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-02-05 20:16:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:16:28,207 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-02-05 20:16:28,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:16:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-02-05 20:16:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 20:16:28,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:16:28,207 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-02-05 20:16:28,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 20:16:28,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:16:28,412 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:16:28,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:16:28,415 INFO L85 PathProgramCache]: Analyzing trace with hash -506187805, now seen corresponding path program 2 times [2025-02-05 20:16:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:16:28,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963557909] [2025-02-05 20:16:28,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 20:16:28,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:16:28,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:16:28,420 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-02-05 20:16:28,422 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-02-05 20:16:28,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-05 20:16:28,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 20:16:28,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 20:16:28,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:16:28,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-02-05 20:16:28,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:17:42,741 WARN L286 SmtUtils]: Spent 7.62s on a formula simplification. DAG size of input: 642 DAG size of output: 638 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)