./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d18364cf74a7e83a7d0637d6dc5303d99591a287435332871b1650f13e39eb3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:40:27,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:40:27,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:40:27,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:40:27,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:40:27,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:40:27,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:40:27,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:40:27,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:40:27,796 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:40:27,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:40:27,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:40:27,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:40:27,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:40:27,799 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:40:27,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:40:27,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:40:27,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:40:27,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:40:27,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:40:27,801 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:40:27,805 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:40:27,805 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:40:27,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:40:27,806 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:40:27,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:40:27,806 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:40:27,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:40:27,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:40:27,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:40:27,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:40:27,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:40:27,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:40:27,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:40:27,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:40:27,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:40:27,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:40:27,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:40:27,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:40:27,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:40:27,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:40:27,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:40:27,811 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7d18364cf74a7e83a7d0637d6dc5303d99591a287435332871b1650f13e39eb3 [2024-10-24 16:40:28,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:40:28,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:40:28,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:40:28,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:40:28,065 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:40:28,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c [2024-10-24 16:40:29,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:40:29,715 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:40:29,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+cfa-reducer.c [2024-10-24 16:40:29,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/297d0a1b2/5bafadfaf73549beb2f912584a08ce46/FLAG8a21b3b03 [2024-10-24 16:40:29,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/297d0a1b2/5bafadfaf73549beb2f912584a08ce46 [2024-10-24 16:40:29,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:40:29,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:40:29,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:40:29,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:40:29,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:40:29,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:40:29" (1/1) ... [2024-10-24 16:40:29,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b634d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:29, skipping insertion in model container [2024-10-24 16:40:29,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:40:29" (1/1) ... [2024-10-24 16:40:29,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:40:30,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:40:30,073 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:40:30,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:40:30,171 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:40:30,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30 WrapperNode [2024-10-24 16:40:30,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:40:30,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:40:30,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:40:30,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:40:30,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,235 INFO L138 Inliner]: procedures = 17, calls = 199, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 360 [2024-10-24 16:40:30,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:40:30,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:40:30,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:40:30,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:40:30,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,292 INFO L175 MemorySlicer]: Split 179 memory accesses to 5 slices as follows [2, 7, 41, 2, 127]. 71 percent of accesses are in the largest equivalence class. The 137 initializations are split as follows [2, 7, 0, 2, 126]. The 0 writes are split as follows [0, 0, 0, 0, 0]. [2024-10-24 16:40:30,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:40:30,330 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:40:30,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:40:30,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:40:30,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (1/1) ... [2024-10-24 16:40:30,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:40:30,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:40:30,376 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) [2024-10-24 16:40:30,382 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 [2024-10-24 16:40:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:40:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:40:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 16:40:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 16:40:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 16:40:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:40:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:40:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 16:40:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 16:40:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 16:40:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 16:40:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 16:40:30,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:40:30,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:40:30,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:40:30,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:40:30,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 16:40:30,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 16:40:30,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 16:40:30,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:40:30,587 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:40:30,589 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:40:31,174 INFO L? ?]: Removed 230 outVars from TransFormulas that were not future-live. [2024-10-24 16:40:31,174 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:40:31,279 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:40:31,280 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 16:40:31,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:40:31 BoogieIcfgContainer [2024-10-24 16:40:31,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:40:31,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:40:31,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:40:31,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:40:31,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:40:29" (1/3) ... [2024-10-24 16:40:31,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36172599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:40:31, skipping insertion in model container [2024-10-24 16:40:31,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:30" (2/3) ... [2024-10-24 16:40:31,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36172599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:40:31, skipping insertion in model container [2024-10-24 16:40:31,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:40:31" (3/3) ... [2024-10-24 16:40:31,290 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+cfa-reducer.c [2024-10-24 16:40:31,304 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:40:31,304 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2024-10-24 16:40:31,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:40:31,358 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=None, 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;@8b51215, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:40:31,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2024-10-24 16:40:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 52 states have (on average 2.75) internal successors, (143), 138 states have internal predecessors, (143), 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) [2024-10-24 16:40:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:40:31,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:31,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:40:31,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-10-24 16:40:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 270400, now seen corresponding path program 1 times [2024-10-24 16:40:31,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:31,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553929118] [2024-10-24 16:40:31,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:31,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:31,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:31,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553929118] [2024-10-24 16:40:31,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553929118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:31,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:31,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:40:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429426782] [2024-10-24 16:40:31,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:31,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:40:31,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:40:31,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:31,727 INFO L87 Difference]: Start difference. First operand has 139 states, 52 states have (on average 2.75) internal successors, (143), 138 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-10-24 16:40:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:31,992 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2024-10-24 16:40:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:40:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 16:40:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:32,003 INFO L225 Difference]: With dead ends: 140 [2024-10-24 16:40:32,003 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 16:40:32,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:32,008 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 123 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:32,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 116 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 16:40:32,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-24 16:40:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 52 states have (on average 2.673076923076923) internal successors, (139), 137 states have internal predecessors, (139), 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) [2024-10-24 16:40:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2024-10-24 16:40:32,051 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 3 [2024-10-24 16:40:32,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:32,051 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2024-10-24 16:40:32,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-10-24 16:40:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2024-10-24 16:40:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:40:32,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:32,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:40:32,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:40:32,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-10-24 16:40:32,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash 270267, now seen corresponding path program 1 times [2024-10-24 16:40:32,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:32,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555644188] [2024-10-24 16:40:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:32,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555644188] [2024-10-24 16:40:32,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555644188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:32,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:32,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:40:32,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649035956] [2024-10-24 16:40:32,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:32,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:40:32,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:32,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:40:32,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:32,172 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-10-24 16:40:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:32,411 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2024-10-24 16:40:32,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:40:32,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 16:40:32,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:32,413 INFO L225 Difference]: With dead ends: 97 [2024-10-24 16:40:32,413 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 16:40:32,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:32,415 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 134 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:32,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 21 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 16:40:32,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-24 16:40:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 96 states have internal predecessors, (98), 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) [2024-10-24 16:40:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2024-10-24 16:40:32,426 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 3 [2024-10-24 16:40:32,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:32,426 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2024-10-24 16:40:32,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-10-24 16:40:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2024-10-24 16:40:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:40:32,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:32,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:40:32,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:40:32,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-10-24 16:40:32,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:32,430 INFO L85 PathProgramCache]: Analyzing trace with hash 270268, now seen corresponding path program 1 times [2024-10-24 16:40:32,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:32,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253803070] [2024-10-24 16:40:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:32,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:32,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253803070] [2024-10-24 16:40:32,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253803070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:32,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:32,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:40:32,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926786069] [2024-10-24 16:40:32,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:32,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:40:32,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:32,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:40:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:32,575 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-10-24 16:40:32,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:32,766 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2024-10-24 16:40:32,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:40:32,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-24 16:40:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:32,768 INFO L225 Difference]: With dead ends: 56 [2024-10-24 16:40:32,768 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 16:40:32,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:32,769 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 40 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:32,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 37 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 16:40:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 16:40:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 55 states have internal predecessors, (57), 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) [2024-10-24 16:40:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2024-10-24 16:40:32,777 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 3 [2024-10-24 16:40:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:32,777 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2024-10-24 16:40:32,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-10-24 16:40:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2024-10-24 16:40:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:40:32,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:32,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:32,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:40:32,779 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-10-24 16:40:32,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1782445668, now seen corresponding path program 1 times [2024-10-24 16:40:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:32,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269615497] [2024-10-24 16:40:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:33,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:33,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269615497] [2024-10-24 16:40:33,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269615497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:33,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:33,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023845669] [2024-10-24 16:40:33,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:33,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:40:33,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:33,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:40:33,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:33,058 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2024-10-24 16:40:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:33,174 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2024-10-24 16:40:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:40:33,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-24 16:40:33,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:33,176 INFO L225 Difference]: With dead ends: 58 [2024-10-24 16:40:33,176 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 16:40:33,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:33,177 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:33,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 16:40:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-24 16:40:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 57 states have internal predecessors, (59), 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) [2024-10-24 16:40:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2024-10-24 16:40:33,185 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 49 [2024-10-24 16:40:33,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:33,185 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2024-10-24 16:40:33,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2024-10-24 16:40:33,186 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2024-10-24 16:40:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:40:33,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:33,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:33,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:40:33,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-10-24 16:40:33,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:33,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1782445475, now seen corresponding path program 1 times [2024-10-24 16:40:33,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:33,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989524700] [2024-10-24 16:40:33,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:33,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:33,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:33,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989524700] [2024-10-24 16:40:33,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989524700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:33,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:33,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:40:33,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151245645] [2024-10-24 16:40:33,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:33,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:40:33,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:40:33,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:33,444 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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) [2024-10-24 16:40:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:33,574 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2024-10-24 16:40:33,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:40:33,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-24 16:40:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:33,576 INFO L225 Difference]: With dead ends: 57 [2024-10-24 16:40:33,576 INFO L226 Difference]: Without dead ends: 57 [2024-10-24 16:40:33,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:33,578 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:33,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:33,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-24 16:40:33,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-24 16:40:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 56 states have internal predecessors, (58), 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) [2024-10-24 16:40:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-10-24 16:40:33,587 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 49 [2024-10-24 16:40:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:33,587 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-10-24 16:40:33,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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) [2024-10-24 16:40:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-10-24 16:40:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:40:33,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:33,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:33,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:40:33,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-10-24 16:40:33,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1782445474, now seen corresponding path program 1 times [2024-10-24 16:40:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:33,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082081891] [2024-10-24 16:40:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:34,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:34,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082081891] [2024-10-24 16:40:34,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082081891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:34,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:34,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:34,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152407981] [2024-10-24 16:40:34,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:34,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:34,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:34,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:34,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:34,100 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 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) [2024-10-24 16:40:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:34,288 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2024-10-24 16:40:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:34,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-24 16:40:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:34,290 INFO L225 Difference]: With dead ends: 60 [2024-10-24 16:40:34,291 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 16:40:34,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:34,292 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:34,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 16:40:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-10-24 16:40:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 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) [2024-10-24 16:40:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2024-10-24 16:40:34,299 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 49 [2024-10-24 16:40:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:34,300 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2024-10-24 16:40:34,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 5 states have internal predecessors, (49), 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) [2024-10-24 16:40:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2024-10-24 16:40:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:40:34,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:34,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:34,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:40:34,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-10-24 16:40:34,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1781820057, now seen corresponding path program 1 times [2024-10-24 16:40:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:34,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810483080] [2024-10-24 16:40:34,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:34,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:34,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810483080] [2024-10-24 16:40:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810483080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:34,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:34,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079934131] [2024-10-24 16:40:34,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:34,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:40:34,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:34,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:40:34,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:34,478 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2024-10-24 16:40:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:34,586 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2024-10-24 16:40:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:40:34,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-24 16:40:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:34,588 INFO L225 Difference]: With dead ends: 68 [2024-10-24 16:40:34,588 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 16:40:34,589 INFO L431 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 [2024-10-24 16:40:34,590 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:34,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 31 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 16:40:34,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2024-10-24 16:40:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 60 states have internal predecessors, (62), 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) [2024-10-24 16:40:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2024-10-24 16:40:34,599 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 49 [2024-10-24 16:40:34,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:34,600 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2024-10-24 16:40:34,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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) [2024-10-24 16:40:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2024-10-24 16:40:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 16:40:34,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:34,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:34,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:40:34,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-10-24 16:40:34,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash 761855010, now seen corresponding path program 1 times [2024-10-24 16:40:34,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:34,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077773361] [2024-10-24 16:40:34,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:34,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:35,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:35,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077773361] [2024-10-24 16:40:35,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077773361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:35,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:35,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:40:35,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512197645] [2024-10-24 16:40:35,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:35,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:40:35,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:35,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:40:35,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:35,216 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) [2024-10-24 16:40:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:35,362 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2024-10-24 16:40:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:35,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-24 16:40:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:35,363 INFO L225 Difference]: With dead ends: 60 [2024-10-24 16:40:35,363 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 16:40:35,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:35,364 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:35,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 16:40:35,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-24 16:40:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 58 states have internal predecessors, (60), 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) [2024-10-24 16:40:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2024-10-24 16:40:35,367 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 51 [2024-10-24 16:40:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:35,367 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2024-10-24 16:40:35,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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) [2024-10-24 16:40:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2024-10-24 16:40:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 16:40:35,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:35,368 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:35,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 16:40:35,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-10-24 16:40:35,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1640732487, now seen corresponding path program 1 times [2024-10-24 16:40:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:35,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530527638] [2024-10-24 16:40:35,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:35,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:35,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:35,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530527638] [2024-10-24 16:40:35,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530527638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:40:35,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012812988] [2024-10-24 16:40:35,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:35,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:40:35,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:40:35,557 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) [2024-10-24 16:40:35,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 16:40:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:35,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:40:35,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:40:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:35,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:40:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:35,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012812988] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:40:35,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:40:35,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-24 16:40:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667227881] [2024-10-24 16:40:35,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:40:35,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:40:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:35,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:40:35,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:40:35,960 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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) [2024-10-24 16:40:36,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:36,192 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2024-10-24 16:40:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:40:36,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-24 16:40:36,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:36,193 INFO L225 Difference]: With dead ends: 86 [2024-10-24 16:40:36,193 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 16:40:36,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:40:36,194 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 95 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:36,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 51 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 16:40:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-10-24 16:40:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 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) [2024-10-24 16:40:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2024-10-24 16:40:36,198 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 56 [2024-10-24 16:40:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:36,198 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2024-10-24 16:40:36,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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) [2024-10-24 16:40:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2024-10-24 16:40:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 16:40:36,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:36,200 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:36,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:40:36,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:40:36,402 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-10-24 16:40:36,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1704262425, now seen corresponding path program 2 times [2024-10-24 16:40:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:36,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289672100] [2024-10-24 16:40:36,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:36,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289672100] [2024-10-24 16:40:36,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289672100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:40:36,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002424898] [2024-10-24 16:40:36,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:40:36,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:40:36,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:40:36,716 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) [2024-10-24 16:40:36,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 16:40:37,074 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:40:37,074 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:40:37,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:40:37,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:40:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:37,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:40:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:37,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002424898] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:40:37,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:40:37,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-24 16:40:37,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218942578] [2024-10-24 16:40:37,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:40:37,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:40:37,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:37,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:40:37,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:40:37,314 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 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) [2024-10-24 16:40:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:37,920 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2024-10-24 16:40:37,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 16:40:37,920 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-24 16:40:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:37,921 INFO L225 Difference]: With dead ends: 128 [2024-10-24 16:40:37,921 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 16:40:37,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=499, Unknown=0, NotChecked=0, Total=702 [2024-10-24 16:40:37,922 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 199 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:37,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 144 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:40:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 16:40:37,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2024-10-24 16:40:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.025) internal successors, (123), 121 states have internal predecessors, (123), 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) [2024-10-24 16:40:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2024-10-24 16:40:37,927 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 77 [2024-10-24 16:40:37,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:37,928 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2024-10-24 16:40:37,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 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) [2024-10-24 16:40:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2024-10-24 16:40:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 16:40:37,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:37,930 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:37,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 16:40:38,133 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,SelfDestructingSolverStorable9 [2024-10-24 16:40:38,134 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2024-10-24 16:40:38,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:38,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1884621785, now seen corresponding path program 3 times [2024-10-24 16:40:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:38,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997926033] [2024-10-24 16:40:38,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:38,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 20 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:38,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:38,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997926033] [2024-10-24 16:40:38,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997926033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:40:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452514596] [2024-10-24 16:40:38,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:40:38,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:40:38,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:40:38,769 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) [2024-10-24 16:40:38,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 16:40:39,152 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-24 16:40:39,152 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:40:39,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 16:40:39,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:40:39,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:40:39,593 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 19 treesize of output 17 [2024-10-24 16:40:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 56 proven. 48 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-10-24 16:40:39,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:40:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 20 proven. 84 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-10-24 16:40:41,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452514596] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:40:41,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:40:41,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2024-10-24 16:40:41,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310471920] [2024-10-24 16:40:41,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:40:41,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 16:40:41,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:41,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 16:40:41,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2024-10-24 16:40:41,902 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand has 28 states, 28 states have (on average 5.535714285714286) internal successors, (155), 28 states have internal predecessors, (155), 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) [2024-10-24 16:40:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:43,757 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2024-10-24 16:40:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-24 16:40:43,757 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.535714285714286) internal successors, (155), 28 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-10-24 16:40:43,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:43,758 INFO L225 Difference]: With dead ends: 133 [2024-10-24 16:40:43,758 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 16:40:43,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=930, Invalid=3492, Unknown=0, NotChecked=0, Total=4422 [2024-10-24 16:40:43,762 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 274 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:43,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 275 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:40:43,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 16:40:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 16:40:43,764 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) [2024-10-24 16:40:43,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 16:40:43,764 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2024-10-24 16:40:43,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:43,764 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 16:40:43,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.535714285714286) internal successors, (155), 28 states have internal predecessors, (155), 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) [2024-10-24 16:40:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 16:40:43,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 16:40:43,768 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 86 remaining) [2024-10-24 16:40:43,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 86 remaining) [2024-10-24 16:40:43,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 86 remaining) [2024-10-24 16:40:43,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 86 remaining) [2024-10-24 16:40:43,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 86 remaining) [2024-10-24 16:40:43,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 86 remaining) [2024-10-24 16:40:43,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 86 remaining) [2024-10-24 16:40:43,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 86 remaining) [2024-10-24 16:40:43,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 86 remaining) [2024-10-24 16:40:43,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 86 remaining) [2024-10-24 16:40:43,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 86 remaining) [2024-10-24 16:40:43,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 86 remaining) [2024-10-24 16:40:43,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 86 remaining) [2024-10-24 16:40:43,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 86 remaining) [2024-10-24 16:40:43,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 86 remaining) [2024-10-24 16:40:43,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 86 remaining) [2024-10-24 16:40:43,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 86 remaining) [2024-10-24 16:40:43,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 86 remaining) [2024-10-24 16:40:43,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 86 remaining) [2024-10-24 16:40:43,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 86 remaining) [2024-10-24 16:40:43,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 86 remaining) [2024-10-24 16:40:43,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 86 remaining) [2024-10-24 16:40:43,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 86 remaining) [2024-10-24 16:40:43,772 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 86 remaining) [2024-10-24 16:40:43,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 86 remaining) [2024-10-24 16:40:43,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 86 remaining) [2024-10-24 16:40:43,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 86 remaining) [2024-10-24 16:40:43,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 86 remaining) [2024-10-24 16:40:43,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 86 remaining) [2024-10-24 16:40:43,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 86 remaining) [2024-10-24 16:40:43,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 86 remaining) [2024-10-24 16:40:43,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 86 remaining) [2024-10-24 16:40:43,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 86 remaining) [2024-10-24 16:40:43,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 86 remaining) [2024-10-24 16:40:43,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 86 remaining) [2024-10-24 16:40:43,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 86 remaining) [2024-10-24 16:40:43,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 86 remaining) [2024-10-24 16:40:43,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 86 remaining) [2024-10-24 16:40:43,775 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 86 remaining) [2024-10-24 16:40:43,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 86 remaining) [2024-10-24 16:40:43,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 86 remaining) [2024-10-24 16:40:43,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 86 remaining) [2024-10-24 16:40:43,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 86 remaining) [2024-10-24 16:40:43,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 86 remaining) [2024-10-24 16:40:43,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 86 remaining) [2024-10-24 16:40:43,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 86 remaining) [2024-10-24 16:40:43,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 86 remaining) [2024-10-24 16:40:43,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 86 remaining) [2024-10-24 16:40:43,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 86 remaining) [2024-10-24 16:40:43,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 86 remaining) [2024-10-24 16:40:43,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 86 remaining) [2024-10-24 16:40:43,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 86 remaining) [2024-10-24 16:40:43,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 86 remaining) [2024-10-24 16:40:43,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 86 remaining) [2024-10-24 16:40:43,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 86 remaining) [2024-10-24 16:40:43,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 86 remaining) [2024-10-24 16:40:43,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 86 remaining) [2024-10-24 16:40:43,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 86 remaining) [2024-10-24 16:40:43,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 86 remaining) [2024-10-24 16:40:43,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 86 remaining) [2024-10-24 16:40:43,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 86 remaining) [2024-10-24 16:40:43,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 86 remaining) [2024-10-24 16:40:43,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 86 remaining) [2024-10-24 16:40:43,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 86 remaining) [2024-10-24 16:40:43,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 86 remaining) [2024-10-24 16:40:43,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 86 remaining) [2024-10-24 16:40:43,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 86 remaining) [2024-10-24 16:40:43,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 86 remaining) [2024-10-24 16:40:43,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 86 remaining) [2024-10-24 16:40:43,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 86 remaining) [2024-10-24 16:40:43,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 86 remaining) [2024-10-24 16:40:43,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 86 remaining) [2024-10-24 16:40:43,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 86 remaining) [2024-10-24 16:40:43,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 86 remaining) [2024-10-24 16:40:43,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 86 remaining) [2024-10-24 16:40:43,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 86 remaining) [2024-10-24 16:40:43,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 86 remaining) [2024-10-24 16:40:43,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 86 remaining) [2024-10-24 16:40:43,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 86 remaining) [2024-10-24 16:40:43,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 86 remaining) [2024-10-24 16:40:43,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 86 remaining) [2024-10-24 16:40:43,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 86 remaining) [2024-10-24 16:40:43,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_LEAK (3 of 86 remaining) [2024-10-24 16:40:43,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 86 remaining) [2024-10-24 16:40:43,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 86 remaining) [2024-10-24 16:40:43,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK (0 of 86 remaining) [2024-10-24 16:40:43,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 16:40:43,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:40:43,986 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:43,988 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:40:43,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:40:43 BoogieIcfgContainer [2024-10-24 16:40:43,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:40:43,992 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:40:43,993 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:40:43,993 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:40:43,993 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:40:31" (3/4) ... [2024-10-24 16:40:43,995 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 16:40:44,005 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 62 nodes and edges [2024-10-24 16:40:44,006 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 16:40:44,006 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 16:40:44,007 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 16:40:44,007 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 16:40:44,200 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 16:40:44,200 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 16:40:44,200 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:40:44,201 INFO L158 Benchmark]: Toolchain (without parser) took 14457.13ms. Allocated memory was 148.9MB in the beginning and 390.1MB in the end (delta: 241.2MB). Free memory was 101.1MB in the beginning and 344.7MB in the end (delta: -243.5MB). Peak memory consumption was 218.5MB. Max. memory is 16.1GB. [2024-10-24 16:40:44,201 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 148.9MB. Free memory is still 111.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:40:44,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.72ms. Allocated memory is still 148.9MB. Free memory was 100.7MB in the beginning and 82.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 16:40:44,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.26ms. Allocated memory is still 148.9MB. Free memory was 82.3MB in the beginning and 78.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 16:40:44,202 INFO L158 Benchmark]: Boogie Preprocessor took 92.80ms. Allocated memory is still 148.9MB. Free memory was 78.9MB in the beginning and 73.9MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 16:40:44,202 INFO L158 Benchmark]: RCFGBuilder took 951.75ms. Allocated memory is still 148.9MB. Free memory was 73.9MB in the beginning and 69.6MB in the end (delta: 4.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-10-24 16:40:44,202 INFO L158 Benchmark]: TraceAbstraction took 12708.64ms. Allocated memory was 148.9MB in the beginning and 390.1MB in the end (delta: 241.2MB). Free memory was 68.9MB in the beginning and 131.6MB in the end (delta: -62.7MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. [2024-10-24 16:40:44,203 INFO L158 Benchmark]: Witness Printer took 207.76ms. Allocated memory is still 390.1MB. Free memory was 131.6MB in the beginning and 344.7MB in the end (delta: -213.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 16:40:44,205 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 148.9MB. Free memory is still 111.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.72ms. Allocated memory is still 148.9MB. Free memory was 100.7MB in the beginning and 82.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.26ms. Allocated memory is still 148.9MB. Free memory was 82.3MB in the beginning and 78.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.80ms. Allocated memory is still 148.9MB. Free memory was 78.9MB in the beginning and 73.9MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 951.75ms. Allocated memory is still 148.9MB. Free memory was 73.9MB in the beginning and 69.6MB in the end (delta: 4.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12708.64ms. Allocated memory was 148.9MB in the beginning and 390.1MB in the end (delta: 241.2MB). Free memory was 68.9MB in the beginning and 131.6MB in the end (delta: -62.7MB). Peak memory consumption was 178.2MB. Max. memory is 16.1GB. * Witness Printer took 207.76ms. Allocated memory is still 390.1MB. Free memory was 131.6MB in the beginning and 344.7MB in the end (delta: -213.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 4]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 130]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 139 locations, 86 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 785 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 598 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2838 IncrementalHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 187 mSDtfsCounter, 2838 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=0, 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, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 760 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 995 ConstructedInterpolants, 64 QuantifiedInterpolants, 6356 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2462 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 648/1296 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 - AllSpecificationsHoldResult: All specifications hold 86 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-24 16:40:44,241 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