./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:43:44,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:43:44,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:43:44,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:43:44,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:43:44,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:43:44,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:43:44,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:43:44,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:43:44,804 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:43:44,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:43:44,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:43:44,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:43:44,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:43:44,806 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:43:44,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:43:44,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:43:44,806 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:43:44,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:43:44,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:43:44,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:43:44,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:43:44,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:43:44,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:43:44,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:43:44,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:43:44,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:43:44,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:43:44,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:43:44,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:43:44,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:43:44,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:43:44,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:43:44,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:43:44,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:43:44,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:43:44,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:43:44,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:43:44,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:43:44,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:43:44,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:43:44,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:43:44,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:43:44,809 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2025-03-16 17:43:45,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:43:45,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:43:45,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:43:45,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:43:45,046 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:43:45,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2025-03-16 17:43:46,180 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62fab7bb/60de690c75ee4846926c77d85e53e4cc/FLAGfffcfb086 [2025-03-16 17:43:46,464 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:43:46,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2025-03-16 17:43:46,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62fab7bb/60de690c75ee4846926c77d85e53e4cc/FLAGfffcfb086 [2025-03-16 17:43:46,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62fab7bb/60de690c75ee4846926c77d85e53e4cc [2025-03-16 17:43:46,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:43:46,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:43:46,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:43:46,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:43:46,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:43:46,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:43:46" (1/1) ... [2025-03-16 17:43:46,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68bdb456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:46, skipping insertion in model container [2025-03-16 17:43:46,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:43:46" (1/1) ... [2025-03-16 17:43:46,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:43:46,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2025-03-16 17:43:46,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:43:46,992 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:43:47,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2025-03-16 17:43:47,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:43:47,042 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:43:47,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47 WrapperNode [2025-03-16 17:43:47,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:43:47,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:43:47,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:43:47,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:43:47,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,067 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2025-03-16 17:43:47,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:43:47,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:43:47,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:43:47,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:43:47,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,091 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-16 17:43:47,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:43:47,110 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:43:47,110 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:43:47,110 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:43:47,113 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (1/1) ... [2025-03-16 17:43:47,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:43:47,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:47,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:43:47,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-16 17:43:47,154 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 17:43:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:43:47,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:43:47,237 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:43:47,238 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:43:47,352 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc sll_circular_get_data_at_#t~mem11#1; [2025-03-16 17:43:47,367 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-16 17:43:47,377 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-16 17:43:47,377 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:43:47,383 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:43:47,383 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:43:47,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:43:47 BoogieIcfgContainer [2025-03-16 17:43:47,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:43:47,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:43:47,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:43:47,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:43:47,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:43:46" (1/3) ... [2025-03-16 17:43:47,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476649e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:43:47, skipping insertion in model container [2025-03-16 17:43:47,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:43:47" (2/3) ... [2025-03-16 17:43:47,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476649e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:43:47, skipping insertion in model container [2025-03-16 17:43:47,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:43:47" (3/3) ... [2025-03-16 17:43:47,389 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2025-03-16 17:43:47,403 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:43:47,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_update_all_reverse.i that has 2 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-16 17:43:47,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:43:47,456 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;@123691ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:43:47,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:43:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 17:43:47,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:47,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:47,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:47,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash 500430697, now seen corresponding path program 1 times [2025-03-16 17:43:47,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:47,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742537609] [2025-03-16 17:43:47,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:47,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 17:43:47,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 17:43:47,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:47,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:47,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742537609] [2025-03-16 17:43:47,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742537609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:47,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:43:47,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 17:43:47,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768897723] [2025-03-16 17:43:47,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:47,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:43:47,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:47,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:43:47,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:43:47,772 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:43:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:47,797 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2025-03-16 17:43:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:43:47,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-16 17:43:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:47,803 INFO L225 Difference]: With dead ends: 43 [2025-03-16 17:43:47,803 INFO L226 Difference]: Without dead ends: 22 [2025-03-16 17:43:47,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:43:47,808 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:47,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-16 17:43:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-16 17:43:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-16 17:43:47,831 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2025-03-16 17:43:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:47,831 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-16 17:43:47,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 17:43:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-16 17:43:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 17:43:47,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:47,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:47,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:43:47,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:47,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1571568839, now seen corresponding path program 1 times [2025-03-16 17:43:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:47,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271418041] [2025-03-16 17:43:47,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:47,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:47,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 17:43:47,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 17:43:47,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:47,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 17:43:47,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:47,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271418041] [2025-03-16 17:43:47,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271418041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:47,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:43:47,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:43:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700066041] [2025-03-16 17:43:47,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:47,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:43:47,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:47,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:43:47,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:43:47,994 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:48,034 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2025-03-16 17:43:48,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:43:48,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-16 17:43:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:48,037 INFO L225 Difference]: With dead ends: 34 [2025-03-16 17:43:48,037 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 17:43:48,037 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-03-16 17:43:48,038 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:48,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 17:43:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2025-03-16 17:43:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-16 17:43:48,044 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 23 [2025-03-16 17:43:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:48,045 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-16 17:43:48,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-03-16 17:43:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 17:43:48,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:48,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:48,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:43:48,046 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:48,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:48,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1248333861, now seen corresponding path program 1 times [2025-03-16 17:43:48,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:48,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139033215] [2025-03-16 17:43:48,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:48,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:48,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 17:43:48,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 17:43:48,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:48,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 17:43:48,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:48,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139033215] [2025-03-16 17:43:48,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139033215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:48,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568497598] [2025-03-16 17:43:48,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:48,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:48,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:48,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:48,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 17:43:48,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 17:43:48,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 17:43:48,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:48,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:48,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:43:48,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 17:43:48,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:43:48,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568497598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:48,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 17:43:48,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-16 17:43:48,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235430429] [2025-03-16 17:43:48,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:48,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:43:48,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:48,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:43:48,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:43:48,431 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:48,473 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-03-16 17:43:48,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:43:48,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-16 17:43:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:48,475 INFO L225 Difference]: With dead ends: 37 [2025-03-16 17:43:48,475 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 17:43:48,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:43:48,476 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:48,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 57 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:48,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 17:43:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2025-03-16 17:43:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-16 17:43:48,483 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 25 [2025-03-16 17:43:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:48,484 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-16 17:43:48,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-03-16 17:43:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 17:43:48,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:48,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:48,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 17:43:48,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:48,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:48,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:48,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1590440491, now seen corresponding path program 1 times [2025-03-16 17:43:48,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:48,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293982551] [2025-03-16 17:43:48,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:48,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:48,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:43:48,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:43:48,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:48,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:43:48,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:48,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293982551] [2025-03-16 17:43:48,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293982551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:48,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117319204] [2025-03-16 17:43:48,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:48,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:48,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:48,777 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:48,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 17:43:48,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 17:43:48,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 17:43:48,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:48,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:48,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:43:48,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:48,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:43:48,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:43:48,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117319204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:43:48,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:43:48,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-16 17:43:48,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155249072] [2025-03-16 17:43:48,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:48,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:43:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:48,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:43:48,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:43:48,934 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:43:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:48,970 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2025-03-16 17:43:48,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:43:48,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2025-03-16 17:43:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:48,971 INFO L225 Difference]: With dead ends: 37 [2025-03-16 17:43:48,971 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 17:43:48,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:43:48,971 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:48,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 58 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 17:43:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2025-03-16 17:43:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-16 17:43:48,979 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 26 [2025-03-16 17:43:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:48,980 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-16 17:43:48,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:43:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-16 17:43:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 17:43:48,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:48,980 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:48,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 17:43:49,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 17:43:49,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:49,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:49,181 INFO L85 PathProgramCache]: Analyzing trace with hash -900753997, now seen corresponding path program 2 times [2025-03-16 17:43:49,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:49,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518545307] [2025-03-16 17:43:49,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:43:49,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:49,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-16 17:43:49,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-03-16 17:43:49,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 17:43:49,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:43:49,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:49,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518545307] [2025-03-16 17:43:49,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518545307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:49,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:43:49,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:43:49,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10465293] [2025-03-16 17:43:49,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:49,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:43:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:49,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:43:49,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:43:49,260 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:49,312 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2025-03-16 17:43:49,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:43:49,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-16 17:43:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:49,313 INFO L225 Difference]: With dead ends: 37 [2025-03-16 17:43:49,313 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 17:43:49,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:43:49,314 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:49,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 55 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 17:43:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2025-03-16 17:43:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-16 17:43:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-16 17:43:49,318 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 28 [2025-03-16 17:43:49,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:49,318 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-16 17:43:49,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-16 17:43:49,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 17:43:49,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:49,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:49,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:43:49,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:49,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2142413255, now seen corresponding path program 1 times [2025-03-16 17:43:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:49,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984039878] [2025-03-16 17:43:49,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:49,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:49,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 17:43:49,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 17:43:49,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:49,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:43:50,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:50,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984039878] [2025-03-16 17:43:50,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984039878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:50,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886884034] [2025-03-16 17:43:50,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:50,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:50,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:50,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:50,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:43:50,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 17:43:50,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 17:43:50,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:50,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:50,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-16 17:43:50,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:50,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-16 17:43:50,989 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-16 17:43:50,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-16 17:43:51,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 17:43:51,084 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:43:51,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-16 17:43:51,220 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-16 17:43:51,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2025-03-16 17:43:51,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-16 17:43:51,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2025-03-16 17:43:51,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:51,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2025-03-16 17:43:51,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-16 17:43:51,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 17:43:51,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-16 17:43:51,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-16 17:43:51,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-16 17:43:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:43:51,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:51,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_376 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (or (not (= v_ArrVal_375 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_375 .cse0)))) (not (= v_ArrVal_376 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_376 .cse0)))) (= (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_377) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_375) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_376) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))))) is different from false [2025-03-16 17:43:51,690 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| Int) (v_ArrVal_377 (Array Int Int))) (or (= (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_377) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_12| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-03-16 17:43:51,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:51,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2025-03-16 17:43:51,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:51,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 78 [2025-03-16 17:43:51,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2025-03-16 17:43:51,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:51,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2025-03-16 17:43:51,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-03-16 17:43:51,930 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2025-03-16 17:43:51,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 17:43:51,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2025-03-16 17:43:51,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2025-03-16 17:43:51,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-16 17:43:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-03-16 17:43:52,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886884034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:43:52,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:43:52,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 57 [2025-03-16 17:43:52,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988990232] [2025-03-16 17:43:52,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:52,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-16 17:43:52,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:52,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-16 17:43:52,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2684, Unknown=3, NotChecked=318, Total=3192 [2025-03-16 17:43:52,189 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 57 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 49 states have internal predecessors, (67), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 17:43:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:53,188 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2025-03-16 17:43:53,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 17:43:53,188 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 49 states have internal predecessors, (67), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2025-03-16 17:43:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:53,190 INFO L225 Difference]: With dead ends: 56 [2025-03-16 17:43:53,191 INFO L226 Difference]: Without dead ends: 54 [2025-03-16 17:43:53,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=303, Invalid=3738, Unknown=3, NotChecked=378, Total=4422 [2025-03-16 17:43:53,194 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 140 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:53,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 270 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 808 Invalid, 0 Unknown, 175 Unchecked, 0.5s Time] [2025-03-16 17:43:53,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-16 17:43:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2025-03-16 17:43:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2025-03-16 17:43:53,202 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 29 [2025-03-16 17:43:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:53,202 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-03-16 17:43:53,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 49 states have internal predecessors, (67), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-16 17:43:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2025-03-16 17:43:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 17:43:53,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:53,204 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:53,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 17:43:53,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:53,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:53,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:53,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1991317555, now seen corresponding path program 2 times [2025-03-16 17:43:53,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:53,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138332515] [2025-03-16 17:43:53,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:43:53,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:53,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-16 17:43:53,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:43:53,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:43:53,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:43:53,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:53,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138332515] [2025-03-16 17:43:53,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138332515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:53,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:43:53,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:43:53,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016764814] [2025-03-16 17:43:53,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:53,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:43:53,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:53,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:43:53,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:43:53,497 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:53,534 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2025-03-16 17:43:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:43:53,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-16 17:43:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:53,536 INFO L225 Difference]: With dead ends: 51 [2025-03-16 17:43:53,536 INFO L226 Difference]: Without dead ends: 45 [2025-03-16 17:43:53,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:43:53,538 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:53,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 54 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-16 17:43:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-16 17:43:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2025-03-16 17:43:53,546 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 30 [2025-03-16 17:43:53,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:53,547 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2025-03-16 17:43:53,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2025-03-16 17:43:53,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 17:43:53,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:53,548 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:53,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 17:43:53,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1452161037, now seen corresponding path program 3 times [2025-03-16 17:43:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139140509] [2025-03-16 17:43:53,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:43:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:53,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-16 17:43:53,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:43:53,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 17:43:53,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:43:53,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:53,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139140509] [2025-03-16 17:43:53,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139140509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:53,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092451731] [2025-03-16 17:43:53,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:43:53,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:53,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:53,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:53,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:43:53,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-16 17:43:53,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 17:43:53,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 17:43:53,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:53,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:43:53,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:43:53,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:43:53,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092451731] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:53,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 17:43:53,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2025-03-16 17:43:53,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280896948] [2025-03-16 17:43:53,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:53,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:43:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:53,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:43:53,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:43:53,819 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:53,844 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2025-03-16 17:43:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:43:53,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-16 17:43:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:53,845 INFO L225 Difference]: With dead ends: 52 [2025-03-16 17:43:53,845 INFO L226 Difference]: Without dead ends: 43 [2025-03-16 17:43:53,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:43:53,846 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:53,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-16 17:43:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-03-16 17:43:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2025-03-16 17:43:53,851 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 30 [2025-03-16 17:43:53,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:53,851 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2025-03-16 17:43:53,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:53,851 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2025-03-16 17:43:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 17:43:53,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:53,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:53,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 17:43:54,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:54,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:54,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:54,053 INFO L85 PathProgramCache]: Analyzing trace with hash -368572553, now seen corresponding path program 4 times [2025-03-16 17:43:54,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:54,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174919063] [2025-03-16 17:43:54,053 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:43:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:54,063 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-16 17:43:54,067 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 28 of 30 statements. [2025-03-16 17:43:54,067 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 17:43:54,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:43:54,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:54,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174919063] [2025-03-16 17:43:54,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174919063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:54,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478506951] [2025-03-16 17:43:54,112 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:43:54,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:54,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:54,114 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:54,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:43:54,184 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-16 17:43:54,207 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 28 of 30 statements. [2025-03-16 17:43:54,207 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 17:43:54,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:54,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 17:43:54,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:43:54,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 17:43:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478506951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:43:54,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:43:54,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-16 17:43:54,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686526423] [2025-03-16 17:43:54,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:54,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:43:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:54,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:43:54,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:43:54,265 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:54,319 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2025-03-16 17:43:54,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:43:54,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-16 17:43:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:54,320 INFO L225 Difference]: With dead ends: 57 [2025-03-16 17:43:54,320 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 17:43:54,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-16 17:43:54,321 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:54,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 89 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 17:43:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-03-16 17:43:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2025-03-16 17:43:54,327 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 30 [2025-03-16 17:43:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:54,327 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2025-03-16 17:43:54,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2025-03-16 17:43:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 17:43:54,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:54,327 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:54,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 17:43:54,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:54,528 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:54,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash 237023317, now seen corresponding path program 5 times [2025-03-16 17:43:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:54,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699394513] [2025-03-16 17:43:54,529 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 17:43:54,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:54,540 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-03-16 17:43:54,555 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 17 of 32 statements. [2025-03-16 17:43:54,555 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-16 17:43:54,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:43:54,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:54,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699394513] [2025-03-16 17:43:54,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699394513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:54,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888843716] [2025-03-16 17:43:54,599 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 17:43:54,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:54,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:54,601 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:54,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 17:43:54,683 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-03-16 17:43:54,701 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 17 of 32 statements. [2025-03-16 17:43:54,701 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-16 17:43:54,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:54,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 17:43:54,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:43:54,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 17:43:54,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888843716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:43:54,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:43:54,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-16 17:43:54,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625451092] [2025-03-16 17:43:54,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:54,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 17:43:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:54,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 17:43:54,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:43:54,756 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:54,789 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2025-03-16 17:43:54,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:43:54,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-16 17:43:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:54,790 INFO L225 Difference]: With dead ends: 58 [2025-03-16 17:43:54,790 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 17:43:54,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 17:43:54,790 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:54,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 17:43:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-16 17:43:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2025-03-16 17:43:54,800 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 32 [2025-03-16 17:43:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:54,801 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2025-03-16 17:43:54,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 17:43:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2025-03-16 17:43:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:43:54,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:54,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:54,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 17:43:55,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:55,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:55,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1121886026, now seen corresponding path program 1 times [2025-03-16 17:43:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773097584] [2025-03-16 17:43:55,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:55,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:43:55,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:43:55,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:55,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 17:43:55,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773097584] [2025-03-16 17:43:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773097584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66179109] [2025-03-16 17:43:55,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:43:55,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:55,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:55,487 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:55,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 17:43:55,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 17:43:55,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 17:43:55,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:55,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:55,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-16 17:43:55,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:55,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-16 17:43:55,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-16 17:43:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 17:43:55,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:55,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-03-16 17:43:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 17:43:55,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66179109] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:43:55,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:43:55,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 28 [2025-03-16 17:43:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249920072] [2025-03-16 17:43:55,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:55,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 17:43:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:55,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 17:43:55,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2025-03-16 17:43:55,875 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:43:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:56,289 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2025-03-16 17:43:56,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 17:43:56,290 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-03-16 17:43:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:56,290 INFO L225 Difference]: With dead ends: 63 [2025-03-16 17:43:56,292 INFO L226 Difference]: Without dead ends: 61 [2025-03-16 17:43:56,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1281, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 17:43:56,293 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 84 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:56,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 237 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:43:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-16 17:43:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2025-03-16 17:43:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-03-16 17:43:56,300 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 33 [2025-03-16 17:43:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:56,300 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-03-16 17:43:56,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 27 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:43:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2025-03-16 17:43:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 17:43:56,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:56,301 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:56,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 17:43:56,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:56,502 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:56,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash 904211621, now seen corresponding path program 6 times [2025-03-16 17:43:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:56,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928141904] [2025-03-16 17:43:56,502 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 17:43:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:56,513 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 5 equivalence classes. [2025-03-16 17:43:56,532 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 33 statements. [2025-03-16 17:43:56,532 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-16 17:43:56,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:43:56,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:56,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928141904] [2025-03-16 17:43:56,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928141904] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:56,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716649887] [2025-03-16 17:43:56,576 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 17:43:56,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:56,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:56,578 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:56,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 17:43:56,666 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 5 equivalence classes. [2025-03-16 17:43:56,767 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 33 statements. [2025-03-16 17:43:56,767 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-16 17:43:56,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:56,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:43:56,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:43:56,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:43:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716649887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:43:56,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:43:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-16 17:43:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964972123] [2025-03-16 17:43:56,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:56,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 17:43:56,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:56,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 17:43:56,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:43:56,821 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:43:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:56,863 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2025-03-16 17:43:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:43:56,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-03-16 17:43:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:56,864 INFO L225 Difference]: With dead ends: 70 [2025-03-16 17:43:56,864 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 17:43:56,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-16 17:43:56,864 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:56,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 101 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 17:43:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2025-03-16 17:43:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2025-03-16 17:43:56,870 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 33 [2025-03-16 17:43:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:56,871 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2025-03-16 17:43:56,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:43:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2025-03-16 17:43:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 17:43:56,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:56,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:56,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 17:43:57,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 17:43:57,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:57,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash 419744528, now seen corresponding path program 2 times [2025-03-16 17:43:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:57,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273915301] [2025-03-16 17:43:57,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:43:57,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:57,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-16 17:43:57,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:43:57,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:43:57,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 17:43:57,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273915301] [2025-03-16 17:43:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273915301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334047591] [2025-03-16 17:43:57,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:43:57,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:57,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:57,142 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:57,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 17:43:57,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-16 17:43:57,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 17:43:57,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:43:57,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:57,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:43:57,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 17:43:57,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:43:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 17:43:57,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334047591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:43:57,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:43:57,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-16 17:43:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979511511] [2025-03-16 17:43:57,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:43:57,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 17:43:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:57,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 17:43:57,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:43:57,341 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:43:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:57,395 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-03-16 17:43:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:43:57,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-16 17:43:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:57,396 INFO L225 Difference]: With dead ends: 52 [2025-03-16 17:43:57,396 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 17:43:57,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-16 17:43:57,397 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:57,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 86 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:57,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 17:43:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-16 17:43:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 17:43:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-03-16 17:43:57,401 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 34 [2025-03-16 17:43:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:57,401 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-16 17:43:57,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 17:43:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-03-16 17:43:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 17:43:57,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:43:57,401 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:43:57,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 17:43:57,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 17:43:57,602 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:43:57,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:43:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1203710629, now seen corresponding path program 7 times [2025-03-16 17:43:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:43:57,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949293169] [2025-03-16 17:43:57,603 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 17:43:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:43:57,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:43:57,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:43:57,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:57,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 17:43:57,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:43:57,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949293169] [2025-03-16 17:43:57,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949293169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:43:57,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266910431] [2025-03-16 17:43:57,653 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 17:43:57,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:43:57,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:43:57,655 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:43:57,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 17:43:57,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 17:43:57,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 17:43:57,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:43:57,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:43:57,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:43:57,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:43:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 17:43:57,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 17:43:57,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266910431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:43:57,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 17:43:57,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-16 17:43:57,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938049562] [2025-03-16 17:43:57,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:43:57,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:43:57,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:43:57,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:43:57,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:43:57,807 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:43:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:43:57,815 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-03-16 17:43:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:43:57,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-03-16 17:43:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:43:57,816 INFO L225 Difference]: With dead ends: 33 [2025-03-16 17:43:57,816 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 17:43:57,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-03-16 17:43:57,816 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:43:57,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:43:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 17:43:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 17:43:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-03-16 17:43:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 17:43:57,817 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2025-03-16 17:43:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:43:57,817 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 17:43:57,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 17:43:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 17:43:57,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 17:43:57,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 17:43:57,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-16 17:43:58,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 17:43:58,023 INFO L422 BasicCegarLoop]: Path program histogram: [7, 2, 2, 1, 1, 1] [2025-03-16 17:43:58,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 17:43:58,324 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 17:43:58,331 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-16 17:43:58,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-16 17:43:58,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-16 17:43:58,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,332 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-03-16 17:43:58,333 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-16 17:43:58,334 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-16 17:43:58,334 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,335 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,336 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-03-16 17:43:58,337 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-16 17:43:58,337 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-16 17:43:58,337 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-16 17:43:58,337 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-16 17:43:58,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-16 17:43:58,339 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!base [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-16 17:43:58,340 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-16 17:43:58,341 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IdentifierExpression[~head!offset,]]]]] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!base [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-16 17:43:58,342 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-16 17:43:58,343 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,343 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-16 17:43:58,343 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,343 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,343 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] [2025-03-16 17:43:58,343 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~expected~0 [2025-03-16 17:43:58,343 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] [2025-03-16 17:43:58,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head!offset [2025-03-16 17:43:58,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~len~0 [2025-03-16 17:43:58,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-16 17:43:58,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-16 17:43:58,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] [2025-03-16 17:43:58,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-03-16 17:43:58,345 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2025-03-16 17:43:58,346 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-03-16 17:43:58,346 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2025-03-16 17:43:58,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:43:58 BoogieIcfgContainer [2025-03-16 17:43:58,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 17:43:58,347 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 17:43:58,347 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 17:43:58,347 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 17:43:58,347 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:43:47" (3/4) ... [2025-03-16 17:43:58,349 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 17:43:58,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure node_create [2025-03-16 17:43:58,355 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-16 17:43:58,356 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-16 17:43:58,356 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 17:43:58,356 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 17:43:58,431 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 17:43:58,431 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 17:43:58,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 17:43:58,431 INFO L158 Benchmark]: Toolchain (without parser) took 11688.63ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 153.5MB in the beginning and 85.4MB in the end (delta: 68.1MB). Peak memory consumption was 109.4MB. Max. memory is 16.1GB. [2025-03-16 17:43:58,431 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:43:58,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.44ms. Allocated memory is still 201.3MB. Free memory was 153.5MB in the beginning and 135.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:43:58,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.58ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 133.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:43:58,432 INFO L158 Benchmark]: Boogie Preprocessor took 40.23ms. Allocated memory is still 201.3MB. Free memory was 133.8MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:43:58,432 INFO L158 Benchmark]: IcfgBuilder took 273.39ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 115.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 17:43:58,432 INFO L158 Benchmark]: TraceAbstraction took 10961.66ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 114.6MB in the beginning and 91.0MB in the end (delta: 23.6MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2025-03-16 17:43:58,432 INFO L158 Benchmark]: Witness Printer took 84.28ms. Allocated memory is still 243.3MB. Free memory was 91.0MB in the beginning and 85.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:43:58,434 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.25ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.44ms. Allocated memory is still 201.3MB. Free memory was 153.5MB in the beginning and 135.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.58ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 133.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.23ms. Allocated memory is still 201.3MB. Free memory was 133.8MB in the beginning and 131.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 273.39ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 115.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10961.66ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 114.6MB in the beginning and 91.0MB in the end (delta: 23.6MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * Witness Printer took 84.28ms. Allocated memory is still 243.3MB. Free memory was 91.0MB in the beginning and 85.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]],[IdentifierExpression[~head!offset,]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~expected~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~len~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base * 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 - PositiveResult [Line: 637]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 37 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 447 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 1295 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 175 IncrementalHoareTripleChecker+Unchecked, 1031 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1476 IncrementalHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 264 mSDtfsCounter, 1476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 687 GetRequests, 492 SyntacticMatches, 18 SemanticMatches, 177 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=11, InterpolantAutomatonStates: 102, 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, 14 MinimizatonAttempts, 74 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 714 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 929 ConstructedInterpolants, 5 QuantifiedInterpolants, 3006 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2925 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 32 InterpolantComputations, 7 PerfectInterpolantSequences, 420/530 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 629]: Location Invariant Derived location invariant: (((i <= 0) && (len == 2)) || ((i == 1) && (len == 2))) - InvariantResult [Line: 625]: Location Invariant Derived location invariant: ((((i == 1) && (len == 2)) || ((i <= 0) && (len == 2))) || ((i == 0) && (len == 2))) - InvariantResult [Line: 614]: Location Invariant Derived location invariant: ((((2 == data) && (index == 0)) || ((3 == data) && (index == 0))) || ((3 == data) && (index == 1))) - InvariantResult [Line: 607]: Location Invariant Derived location invariant: (((index <= 0) || (index == 1)) || (index <= 0)) - InvariantResult [Line: 586]: Location Invariant Derived location invariant: (((2 == len) && (len == 2)) || ((len <= 1) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2025-03-16 17:43:58,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing output log to file Ultimate.log Result: TRUE