./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.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 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:31:17,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:31:17,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:31:17,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:31:17,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:31:17,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:31:17,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:31:17,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:31:17,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:31:17,992 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:31:17,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:31:17,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:31:17,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:31:17,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:31:17,995 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:31:17,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:31:17,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:31:17,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:31:17,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:31:17,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:31:17,998 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:31:18,002 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:31:18,002 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:31:18,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:31:18,003 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:31:18,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:31:18,003 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:31:18,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:31:18,004 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:31:18,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:31:18,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:31:18,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:31:18,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:31:18,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:31:18,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:31:18,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:31:18,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:31:18,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:31:18,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:31:18,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:31:18,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:31:18,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:31:18,010 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 -> 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac [2024-11-17 00:31:18,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:31:18,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:31:18,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:31:18,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:31:18,246 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:31:18,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2024-11-17 00:31:19,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:31:19,886 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:31:19,887 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2024-11-17 00:31:19,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4726572/bbef4e1e54694f4eb6e362a970a93d62/FLAG85f712571 [2024-11-17 00:31:19,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4726572/bbef4e1e54694f4eb6e362a970a93d62 [2024-11-17 00:31:19,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:31:19,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:31:19,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:31:19,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:31:19,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:31:19,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:31:19" (1/1) ... [2024-11-17 00:31:19,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fa4e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:19, skipping insertion in model container [2024-11-17 00:31:19,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:31:19" (1/1) ... [2024-11-17 00:31:19,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:31:20,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:31:20,243 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:31:20,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:31:20,297 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:31:20,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20 WrapperNode [2024-11-17 00:31:20,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:31:20,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:31:20,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:31:20,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:31:20,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,360 INFO L138 Inliner]: procedures = 14, calls = 50, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2024-11-17 00:31:20,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:31:20,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:31:20,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:31:20,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:31:20,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,396 INFO L175 MemorySlicer]: Split 38 memory accesses to 4 slices as follows [12, 12, 12, 2]. 32 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [10, 10, 10, 0]. The 4 writes are split as follows [1, 1, 1, 1]. [2024-11-17 00:31:20,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:31:20,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:31:20,415 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:31:20,415 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:31:20,416 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (1/1) ... [2024-11-17 00:31:20,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:31:20,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:20,450 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-11-17 00:31:20,453 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-11-17 00:31:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:31:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:31:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:31:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:31:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-17 00:31:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:31:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:31:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:31:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 00:31:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-17 00:31:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:31:20,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:31:20,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:31:20,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:31:20,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 00:31:20,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-17 00:31:20,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:31:20,608 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:31:20,611 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:31:20,844 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: call ULTIMATE.dealloc(getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset);havoc getNumbers3_~#numbers3~0#1.base, getNumbers3_~#numbers3~0#1.offset; [2024-11-17 00:31:20,866 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-17 00:31:20,870 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:31:20,883 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:31:20,884 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:31:20,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:31:20 BoogieIcfgContainer [2024-11-17 00:31:20,884 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:31:20,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:31:20,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:31:20,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:31:20,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:31:19" (1/3) ... [2024-11-17 00:31:20,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b64b90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:31:20, skipping insertion in model container [2024-11-17 00:31:20,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:31:20" (2/3) ... [2024-11-17 00:31:20,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b64b90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:31:20, skipping insertion in model container [2024-11-17 00:31:20,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:31:20" (3/3) ... [2024-11-17 00:31:20,894 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2024-11-17 00:31:20,911 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:31:20,911 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-11-17 00:31:20,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:31:20,962 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;@7c0c579b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:31:20,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-17 00:31:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 55 states have internal predecessors, (65), 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-11-17 00:31:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 00:31:20,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:20,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 00:31:20,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:20,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:20,975 INFO L85 PathProgramCache]: Analyzing trace with hash 96352001, now seen corresponding path program 1 times [2024-11-17 00:31:20,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:20,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508846265] [2024-11-17 00:31:20,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:31:21,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508846265] [2024-11-17 00:31:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508846265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:21,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:31:21,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 00:31:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143074204] [2024-11-17 00:31:21,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:21,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:31:21,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:21,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:31:21,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:31:21,298 INFO L87 Difference]: Start difference. First operand has 56 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 55 states have internal predecessors, (65), 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 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:31:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:21,362 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-11-17 00:31:21,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:31:21,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-17 00:31:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:21,373 INFO L225 Difference]: With dead ends: 55 [2024-11-17 00:31:21,373 INFO L226 Difference]: Without dead ends: 52 [2024-11-17 00:31:21,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:31:21,379 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:21,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 62 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-17 00:31:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-17 00:31:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 51 states have internal predecessors, (56), 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-11-17 00:31:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-11-17 00:31:21,412 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 5 [2024-11-17 00:31:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:21,413 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-11-17 00:31:21,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:31:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-11-17 00:31:21,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 00:31:21,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:21,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 00:31:21,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:31:21,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:21,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash 96352002, now seen corresponding path program 1 times [2024-11-17 00:31:21,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:21,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859969949] [2024-11-17 00:31:21,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:31:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859969949] [2024-11-17 00:31:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859969949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:21,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:31:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:31:21,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529985216] [2024-11-17 00:31:21,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:21,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:31:21,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:21,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:31:21,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:31:21,652 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:31:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:21,748 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-11-17 00:31:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:31:21,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-17 00:31:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:21,750 INFO L225 Difference]: With dead ends: 56 [2024-11-17 00:31:21,750 INFO L226 Difference]: Without dead ends: 56 [2024-11-17 00:31:21,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:31:21,752 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:21,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 68 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-17 00:31:21,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-17 00:31:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 54 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-11-17 00:31:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-11-17 00:31:21,763 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 5 [2024-11-17 00:31:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:21,764 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-11-17 00:31:21,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:31:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-11-17 00:31:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 00:31:21,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:21,765 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-17 00:31:21,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:31:21,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:21,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:21,767 INFO L85 PathProgramCache]: Analyzing trace with hash -35131996, now seen corresponding path program 1 times [2024-11-17 00:31:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:21,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528025065] [2024-11-17 00:31:21,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:21,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:31:22,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:22,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528025065] [2024-11-17 00:31:22,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528025065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:22,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119684992] [2024-11-17 00:31:22,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:22,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:22,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:22,008 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-11-17 00:31:22,009 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-11-17 00:31:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:22,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 00:31:22,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:31:22,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:31:22,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119684992] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:22,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:22,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-17 00:31:22,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674496903] [2024-11-17 00:31:22,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:22,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:31:22,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:22,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:31:22,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:31:22,442 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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-11-17 00:31:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:22,700 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-11-17 00:31:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:31:22,701 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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 9 [2024-11-17 00:31:22,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:22,702 INFO L225 Difference]: With dead ends: 65 [2024-11-17 00:31:22,702 INFO L226 Difference]: Without dead ends: 65 [2024-11-17 00:31:22,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-17 00:31:22,704 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 136 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:22,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 231 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-17 00:31:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-17 00:31:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 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-11-17 00:31:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-11-17 00:31:22,714 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 9 [2024-11-17 00:31:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:22,715 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-11-17 00:31:22,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 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-11-17 00:31:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-11-17 00:31:22,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:31:22,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:22,716 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:22,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:31:22,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:22,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:22,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1819274946, now seen corresponding path program 1 times [2024-11-17 00:31:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017887775] [2024-11-17 00:31:22,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:22,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-17 00:31:23,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:23,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017887775] [2024-11-17 00:31:23,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017887775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:23,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:31:23,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:31:23,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260572658] [2024-11-17 00:31:23,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:23,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:31:23,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:23,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:31:23,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:31:23,020 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:31:23,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:23,079 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2024-11-17 00:31:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:31:23,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-17 00:31:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:23,080 INFO L225 Difference]: With dead ends: 64 [2024-11-17 00:31:23,081 INFO L226 Difference]: Without dead ends: 64 [2024-11-17 00:31:23,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:31:23,082 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:23,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 114 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-17 00:31:23,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-17 00:31:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 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-11-17 00:31:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-11-17 00:31:23,087 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 25 [2024-11-17 00:31:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:23,087 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-11-17 00:31:23,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:31:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-11-17 00:31:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:31:23,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:23,090 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:23,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:31:23,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:23,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:23,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1819274947, now seen corresponding path program 1 times [2024-11-17 00:31:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:23,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428551366] [2024-11-17 00:31:23,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:23,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:31:23,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:23,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428551366] [2024-11-17 00:31:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428551366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591388439] [2024-11-17 00:31:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:23,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:23,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:23,265 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-11-17 00:31:23,267 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-11-17 00:31:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:23,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:31:23,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:31:23,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:31:23,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591388439] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:23,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:23,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-17 00:31:23,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576893294] [2024-11-17 00:31:23,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:23,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:31:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:23,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:31:23,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:31:23,461 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 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-11-17 00:31:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:23,511 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-17 00:31:23,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:31:23,512 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 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 25 [2024-11-17 00:31:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:23,512 INFO L225 Difference]: With dead ends: 88 [2024-11-17 00:31:23,512 INFO L226 Difference]: Without dead ends: 88 [2024-11-17 00:31:23,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:31:23,514 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:23,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 200 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-17 00:31:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-17 00:31:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 87 states have internal predecessors, (92), 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-11-17 00:31:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-11-17 00:31:23,519 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 25 [2024-11-17 00:31:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:23,520 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-11-17 00:31:23,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 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-11-17 00:31:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-11-17 00:31:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-17 00:31:23,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:23,522 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:23,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:31:23,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:23,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:23,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:23,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1623594609, now seen corresponding path program 2 times [2024-11-17 00:31:23,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:23,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602551418] [2024-11-17 00:31:23,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:23,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602551418] [2024-11-17 00:31:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602551418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:24,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:31:24,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:31:24,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173979152] [2024-11-17 00:31:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:24,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:31:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:24,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:31:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:31:24,003 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-17 00:31:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:24,089 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-11-17 00:31:24,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:31:24,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-17 00:31:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:24,091 INFO L225 Difference]: With dead ends: 94 [2024-11-17 00:31:24,091 INFO L226 Difference]: Without dead ends: 94 [2024-11-17 00:31:24,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:31:24,092 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 56 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:24,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 96 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-17 00:31:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-11-17 00:31:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 90 states have internal predecessors, (95), 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-11-17 00:31:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-17 00:31:24,097 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 49 [2024-11-17 00:31:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:24,098 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-17 00:31:24,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-17 00:31:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-17 00:31:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:31:24,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:24,099 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:24,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:31:24,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:24,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1208174661, now seen corresponding path program 1 times [2024-11-17 00:31:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:24,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343504954] [2024-11-17 00:31:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:24,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:24,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343504954] [2024-11-17 00:31:24,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343504954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:24,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:31:24,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 00:31:24,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399167940] [2024-11-17 00:31:24,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:24,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:31:24,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:24,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:31:24,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:31:24,207 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-11-17 00:31:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:24,233 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2024-11-17 00:31:24,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:31:24,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 50 [2024-11-17 00:31:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:24,236 INFO L225 Difference]: With dead ends: 90 [2024-11-17 00:31:24,236 INFO L226 Difference]: Without dead ends: 90 [2024-11-17 00:31:24,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:31:24,237 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:24,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 57 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-17 00:31:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-17 00:31:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 89 states have internal predecessors, (94), 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-11-17 00:31:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2024-11-17 00:31:24,246 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 50 [2024-11-17 00:31:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:24,246 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2024-11-17 00:31:24,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-11-17 00:31:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2024-11-17 00:31:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-17 00:31:24,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:24,250 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:24,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:31:24,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:24,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:24,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1208174662, now seen corresponding path program 1 times [2024-11-17 00:31:24,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:24,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4591325] [2024-11-17 00:31:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:24,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:24,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:24,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4591325] [2024-11-17 00:31:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4591325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:24,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:31:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:31:24,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864761188] [2024-11-17 00:31:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:24,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:31:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:24,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:31:24,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:31:24,418 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11-17 00:31:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:24,467 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-17 00:31:24,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:31:24,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 50 [2024-11-17 00:31:24,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:24,472 INFO L225 Difference]: With dead ends: 92 [2024-11-17 00:31:24,472 INFO L226 Difference]: Without dead ends: 92 [2024-11-17 00:31:24,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:31:24,473 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 45 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:24,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 64 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-17 00:31:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-17 00:31:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 90 states have internal predecessors, (95), 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-11-17 00:31:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2024-11-17 00:31:24,480 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 50 [2024-11-17 00:31:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:24,480 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2024-11-17 00:31:24,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11-17 00:31:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2024-11-17 00:31:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-17 00:31:24,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:24,485 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:24,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:31:24,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:24,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:24,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1997261557, now seen corresponding path program 1 times [2024-11-17 00:31:24,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:24,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772102439] [2024-11-17 00:31:24,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:24,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772102439] [2024-11-17 00:31:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772102439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:24,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151844943] [2024-11-17 00:31:24,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:24,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:24,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:24,724 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-11-17 00:31:24,726 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-11-17 00:31:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:24,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 00:31:24,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:25,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:25,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151844943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:25,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:25,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-17 00:31:25,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244781642] [2024-11-17 00:31:25,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:25,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 00:31:25,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:25,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 00:31:25,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:31:25,447 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 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-11-17 00:31:25,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:25,693 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2024-11-17 00:31:25,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:31:25,694 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 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 54 [2024-11-17 00:31:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:25,695 INFO L225 Difference]: With dead ends: 105 [2024-11-17 00:31:25,695 INFO L226 Difference]: Without dead ends: 105 [2024-11-17 00:31:25,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:31:25,696 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 211 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:25,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 273 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-17 00:31:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-17 00:31:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 104 states have internal predecessors, (113), 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-11-17 00:31:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2024-11-17 00:31:25,704 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 54 [2024-11-17 00:31:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:25,705 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2024-11-17 00:31:25,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 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-11-17 00:31:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2024-11-17 00:31:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-17 00:31:25,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:25,709 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:25,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:25,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:25,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:25,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1785566134, now seen corresponding path program 1 times [2024-11-17 00:31:25,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:25,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457015313] [2024-11-17 00:31:25,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:25,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:26,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457015313] [2024-11-17 00:31:26,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457015313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:26,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473267045] [2024-11-17 00:31:26,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:26,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:26,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:26,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:26,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-17 00:31:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:26,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 00:31:26,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:26,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:26,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473267045] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:26,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:26,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-17 00:31:26,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398781877] [2024-11-17 00:31:26,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:26,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-17 00:31:26,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:26,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 00:31:26,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:31:26,724 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-11-17 00:31:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:26,855 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2024-11-17 00:31:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:31:26,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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 55 [2024-11-17 00:31:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:26,856 INFO L225 Difference]: With dead ends: 106 [2024-11-17 00:31:26,856 INFO L226 Difference]: Without dead ends: 106 [2024-11-17 00:31:26,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:31:26,857 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 170 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:26,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 99 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:26,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-17 00:31:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-17 00:31:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 105 states have internal predecessors, (110), 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-11-17 00:31:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2024-11-17 00:31:26,864 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 55 [2024-11-17 00:31:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:26,864 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2024-11-17 00:31:26,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-11-17 00:31:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2024-11-17 00:31:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-17 00:31:26,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:26,865 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:26,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:27,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:27,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:27,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1150723215, now seen corresponding path program 2 times [2024-11-17 00:31:27,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:27,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009656215] [2024-11-17 00:31:27,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:27,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:27,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009656215] [2024-11-17 00:31:27,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009656215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:27,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050015429] [2024-11-17 00:31:27,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:31:27,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:27,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:27,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:27,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-17 00:31:27,467 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:31:27,468 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:31:27,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 00:31:27,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:27,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:28,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050015429] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:28,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:28,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2024-11-17 00:31:28,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224940819] [2024-11-17 00:31:28,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:28,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 00:31:28,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:28,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 00:31:28,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-17 00:31:28,374 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 23 states have internal predecessors, (96), 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-11-17 00:31:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:28,922 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2024-11-17 00:31:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 00:31:28,923 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 23 states have internal predecessors, (96), 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 69 [2024-11-17 00:31:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:28,924 INFO L225 Difference]: With dead ends: 135 [2024-11-17 00:31:28,924 INFO L226 Difference]: Without dead ends: 135 [2024-11-17 00:31:28,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=1002, Unknown=0, NotChecked=0, Total=1260 [2024-11-17 00:31:28,925 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 222 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:28,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 407 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:31:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-17 00:31:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-17 00:31:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 122 states have (on average 1.221311475409836) internal successors, (149), 134 states have internal predecessors, (149), 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-11-17 00:31:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2024-11-17 00:31:28,929 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 69 [2024-11-17 00:31:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:28,930 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2024-11-17 00:31:28,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.173913043478261) internal successors, (96), 23 states have internal predecessors, (96), 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-11-17 00:31:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2024-11-17 00:31:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-17 00:31:28,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:28,931 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:28,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:29,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-17 00:31:29,132 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1312681286, now seen corresponding path program 2 times [2024-11-17 00:31:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087211620] [2024-11-17 00:31:29,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-17 00:31:29,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087211620] [2024-11-17 00:31:29,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087211620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:29,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726421733] [2024-11-17 00:31:29,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:31:29,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:29,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:29,366 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:29,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-17 00:31:29,443 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:31:29,443 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:31:29,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 00:31:29,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-17 00:31:29,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-17 00:31:30,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726421733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:30,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:30,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2024-11-17 00:31:30,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232437652] [2024-11-17 00:31:30,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:30,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 00:31:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:30,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 00:31:30,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:31:30,790 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 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-11-17 00:31:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:30,945 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2024-11-17 00:31:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:31:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 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 70 [2024-11-17 00:31:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:30,946 INFO L225 Difference]: With dead ends: 134 [2024-11-17 00:31:30,946 INFO L226 Difference]: Without dead ends: 134 [2024-11-17 00:31:30,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-11-17 00:31:30,947 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 115 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:30,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 177 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-17 00:31:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-17 00:31:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 122 states have (on average 1.1721311475409837) internal successors, (143), 133 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-11-17 00:31:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2024-11-17 00:31:30,954 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 70 [2024-11-17 00:31:30,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:30,955 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2024-11-17 00:31:30,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 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-11-17 00:31:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2024-11-17 00:31:30,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 00:31:30,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:30,956 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:30,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-17 00:31:31,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:31,161 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:31,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:31,162 INFO L85 PathProgramCache]: Analyzing trace with hash 540015296, now seen corresponding path program 1 times [2024-11-17 00:31:31,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:31,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526980024] [2024-11-17 00:31:31,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:31,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526980024] [2024-11-17 00:31:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526980024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358319078] [2024-11-17 00:31:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:31,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:31,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:31,301 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:31,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-17 00:31:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:31,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:31:31,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:31,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:31,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358319078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:31,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:31,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-17 00:31:31,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494937734] [2024-11-17 00:31:31,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:31,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:31:31,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:31,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:31:31,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:31:31,545 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 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-11-17 00:31:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:31,588 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2024-11-17 00:31:31,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:31:31,588 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 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 78 [2024-11-17 00:31:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:31,589 INFO L225 Difference]: With dead ends: 134 [2024-11-17 00:31:31,589 INFO L226 Difference]: Without dead ends: 134 [2024-11-17 00:31:31,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:31:31,590 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:31,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 180 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-17 00:31:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-17 00:31:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 122 states have (on average 1.1311475409836065) internal successors, (138), 133 states have internal predecessors, (138), 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-11-17 00:31:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2024-11-17 00:31:31,593 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 78 [2024-11-17 00:31:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:31,594 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2024-11-17 00:31:31,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 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-11-17 00:31:31,594 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2024-11-17 00:31:31,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 00:31:31,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:31,595 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:31,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:31,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:31,796 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:31,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:31,796 INFO L85 PathProgramCache]: Analyzing trace with hash 169618703, now seen corresponding path program 3 times [2024-11-17 00:31:31,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:31,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007893342] [2024-11-17 00:31:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:31,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 208 proven. 47 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-17 00:31:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:32,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007893342] [2024-11-17 00:31:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007893342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:32,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921730467] [2024-11-17 00:31:32,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:31:32,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:32,025 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:32,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-17 00:31:32,112 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:31:32,112 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:31:32,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 00:31:32,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2024-11-17 00:31:32,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:31:32,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921730467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:32,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:31:32,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 19 [2024-11-17 00:31:32,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658164182] [2024-11-17 00:31:32,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:32,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:31:32,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:32,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:31:32,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:31:32,650 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-11-17 00:31:32,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:32,766 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2024-11-17 00:31:32,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:31:32,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 99 [2024-11-17 00:31:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:32,767 INFO L225 Difference]: With dead ends: 133 [2024-11-17 00:31:32,768 INFO L226 Difference]: Without dead ends: 133 [2024-11-17 00:31:32,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2024-11-17 00:31:32,769 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:32,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 98 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-17 00:31:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2024-11-17 00:31:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.1239669421487604) internal successors, (136), 131 states have internal predecessors, (136), 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-11-17 00:31:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2024-11-17 00:31:32,772 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 99 [2024-11-17 00:31:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:32,772 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2024-11-17 00:31:32,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-11-17 00:31:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2024-11-17 00:31:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-17 00:31:32,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:32,773 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:32,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-17 00:31:32,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-17 00:31:32,974 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:32,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:32,974 INFO L85 PathProgramCache]: Analyzing trace with hash 353283012, now seen corresponding path program 2 times [2024-11-17 00:31:32,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:32,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961172974] [2024-11-17 00:31:32,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:32,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961172974] [2024-11-17 00:31:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961172974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:33,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:31:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:31:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115448948] [2024-11-17 00:31:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:33,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:31:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:31:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:31:33,193 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-17 00:31:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:33,240 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2024-11-17 00:31:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:31:33,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 103 [2024-11-17 00:31:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:33,241 INFO L225 Difference]: With dead ends: 131 [2024-11-17 00:31:33,241 INFO L226 Difference]: Without dead ends: 131 [2024-11-17 00:31:33,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:31:33,242 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:33,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 111 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-17 00:31:33,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-17 00:31:33,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 121 states have (on average 1.115702479338843) internal successors, (135), 130 states have internal predecessors, (135), 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-11-17 00:31:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2024-11-17 00:31:33,246 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 103 [2024-11-17 00:31:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:33,247 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2024-11-17 00:31:33,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-17 00:31:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2024-11-17 00:31:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-17 00:31:33,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:33,249 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:33,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:31:33,249 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:33,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:33,249 INFO L85 PathProgramCache]: Analyzing trace with hash 353283013, now seen corresponding path program 1 times [2024-11-17 00:31:33,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:33,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427088472] [2024-11-17 00:31:33,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:33,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:33,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:33,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427088472] [2024-11-17 00:31:33,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427088472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:33,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:31:33,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:31:33,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090126981] [2024-11-17 00:31:33,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:33,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:31:33,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:33,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:31:33,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:31:33,544 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-17 00:31:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:33,608 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2024-11-17 00:31:33,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:31:33,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 103 [2024-11-17 00:31:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:33,609 INFO L225 Difference]: With dead ends: 137 [2024-11-17 00:31:33,609 INFO L226 Difference]: Without dead ends: 137 [2024-11-17 00:31:33,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:31:33,610 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 44 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:33,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 92 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-17 00:31:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-17 00:31:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 124 states have (on average 1.1129032258064515) internal successors, (138), 133 states have internal predecessors, (138), 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-11-17 00:31:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2024-11-17 00:31:33,614 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 103 [2024-11-17 00:31:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:33,614 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2024-11-17 00:31:33,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-17 00:31:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2024-11-17 00:31:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-17 00:31:33,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:33,617 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:33,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:31:33,617 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:33,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1933128511, now seen corresponding path program 1 times [2024-11-17 00:31:33,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:33,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15404135] [2024-11-17 00:31:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:33,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:33,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15404135] [2024-11-17 00:31:33,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15404135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:33,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:31:33,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:31:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137765727] [2024-11-17 00:31:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:33,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:31:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:33,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:31:33,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:31:33,711 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-11-17 00:31:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:33,731 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2024-11-17 00:31:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:31:33,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 104 [2024-11-17 00:31:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:33,732 INFO L225 Difference]: With dead ends: 133 [2024-11-17 00:31:33,733 INFO L226 Difference]: Without dead ends: 133 [2024-11-17 00:31:33,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:31:33,733 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:33,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-17 00:31:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-17 00:31:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 124 states have (on average 1.1048387096774193) internal successors, (137), 132 states have internal predecessors, (137), 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-11-17 00:31:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2024-11-17 00:31:33,736 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 104 [2024-11-17 00:31:33,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:33,736 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2024-11-17 00:31:33,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-11-17 00:31:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2024-11-17 00:31:33,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-17 00:31:33,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:33,737 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:33,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:31:33,738 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:33,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1933128510, now seen corresponding path program 1 times [2024-11-17 00:31:33,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912887952] [2024-11-17 00:31:33,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:33,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:33,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:33,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912887952] [2024-11-17 00:31:33,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912887952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:33,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:31:33,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:31:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958401642] [2024-11-17 00:31:33,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:33,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:31:33,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:33,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:31:33,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:31:33,917 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-11-17 00:31:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:33,946 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2024-11-17 00:31:33,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:31:33,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 104 [2024-11-17 00:31:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:33,947 INFO L225 Difference]: With dead ends: 135 [2024-11-17 00:31:33,947 INFO L226 Difference]: Without dead ends: 135 [2024-11-17 00:31:33,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:31:33,948 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:33,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-17 00:31:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-17 00:31:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.104) internal successors, (138), 133 states have internal predecessors, (138), 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-11-17 00:31:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2024-11-17 00:31:33,952 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 104 [2024-11-17 00:31:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:33,952 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2024-11-17 00:31:33,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-11-17 00:31:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2024-11-17 00:31:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-17 00:31:33,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:33,953 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:33,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:31:33,954 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:33,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash -14514169, now seen corresponding path program 1 times [2024-11-17 00:31:33,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:33,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061901245] [2024-11-17 00:31:33,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:33,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:34,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:34,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061901245] [2024-11-17 00:31:34,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061901245] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:34,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010004122] [2024-11-17 00:31:34,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:34,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:34,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:34,338 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:34,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 00:31:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:34,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 00:31:34,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:35,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:31:35,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:31:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:35,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:36,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010004122] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:36,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:36,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-17 00:31:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847370830] [2024-11-17 00:31:36,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:36,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 00:31:36,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:36,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 00:31:36,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:31:36,474 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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-11-17 00:31:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:36,723 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2024-11-17 00:31:36,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:31:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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 108 [2024-11-17 00:31:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:36,724 INFO L225 Difference]: With dead ends: 148 [2024-11-17 00:31:36,724 INFO L226 Difference]: Without dead ends: 148 [2024-11-17 00:31:36,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:31:36,725 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 96 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:36,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 246 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-17 00:31:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-17 00:31:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 139 states have (on average 1.1223021582733812) internal successors, (156), 147 states have internal predecessors, (156), 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-11-17 00:31:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2024-11-17 00:31:36,730 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 108 [2024-11-17 00:31:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:36,731 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2024-11-17 00:31:36,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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-11-17 00:31:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2024-11-17 00:31:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-17 00:31:36,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:36,733 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:36,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-17 00:31:36,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:36,934 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:36,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:36,934 INFO L85 PathProgramCache]: Analyzing trace with hash -449939264, now seen corresponding path program 1 times [2024-11-17 00:31:36,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:36,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210774477] [2024-11-17 00:31:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:36,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:37,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210774477] [2024-11-17 00:31:37,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210774477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178750409] [2024-11-17 00:31:37,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:37,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:37,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:37,135 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:37,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-17 00:31:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:31:37,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:37,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:31:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:37,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178750409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:37,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:37,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-17 00:31:37,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883137088] [2024-11-17 00:31:37,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:37,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:31:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:31:37,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:31:37,406 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:31:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:37,480 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2024-11-17 00:31:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:31:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-17 00:31:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:37,481 INFO L225 Difference]: With dead ends: 149 [2024-11-17 00:31:37,481 INFO L226 Difference]: Without dead ends: 149 [2024-11-17 00:31:37,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:31:37,482 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:37,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 104 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-17 00:31:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-17 00:31:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 140 states have (on average 1.1071428571428572) internal successors, (155), 148 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-11-17 00:31:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2024-11-17 00:31:37,485 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 109 [2024-11-17 00:31:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:37,486 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2024-11-17 00:31:37,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:31:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2024-11-17 00:31:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-17 00:31:37,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:37,487 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:37,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:37,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:37,688 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:37,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash -328561414, now seen corresponding path program 1 times [2024-11-17 00:31:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:37,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174528443] [2024-11-17 00:31:37,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:37,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:37,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174528443] [2024-11-17 00:31:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174528443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:37,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333673899] [2024-11-17 00:31:37,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:37,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:37,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:37,803 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:37,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-17 00:31:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:37,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:31:37,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:37,976 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:37,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:38,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333673899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:38,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:38,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-17 00:31:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503501627] [2024-11-17 00:31:38,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:38,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:31:38,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:38,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:31:38,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:31:38,012 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-11-17 00:31:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:38,063 INFO L93 Difference]: Finished difference Result 157 states and 163 transitions. [2024-11-17 00:31:38,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:31:38,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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 117 [2024-11-17 00:31:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:38,064 INFO L225 Difference]: With dead ends: 157 [2024-11-17 00:31:38,064 INFO L226 Difference]: Without dead ends: 157 [2024-11-17 00:31:38,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:31:38,065 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:38,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 235 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-17 00:31:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-17 00:31:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 148 states have (on average 1.1013513513513513) internal successors, (163), 156 states have internal predecessors, (163), 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-11-17 00:31:38,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 163 transitions. [2024-11-17 00:31:38,070 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 163 transitions. Word has length 117 [2024-11-17 00:31:38,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:38,070 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 163 transitions. [2024-11-17 00:31:38,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-11-17 00:31:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 163 transitions. [2024-11-17 00:31:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-17 00:31:38,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:38,071 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:38,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:38,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-17 00:31:38,272 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:38,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:38,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1368207803, now seen corresponding path program 2 times [2024-11-17 00:31:38,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:38,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371605617] [2024-11-17 00:31:38,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:38,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371605617] [2024-11-17 00:31:38,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371605617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821012149] [2024-11-17 00:31:38,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:31:38,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:38,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:38,675 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:38,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-17 00:31:38,830 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:31:38,830 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:31:38,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 00:31:38,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:39,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:31:39,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:31:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:39,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821012149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:40,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:40,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2024-11-17 00:31:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823841128] [2024-11-17 00:31:40,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:40,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 00:31:40,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:40,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 00:31:40,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-17 00:31:40,836 INFO L87 Difference]: Start difference. First operand 157 states and 163 transitions. Second operand has 24 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 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-11-17 00:31:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:41,350 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2024-11-17 00:31:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:31:41,352 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 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 123 [2024-11-17 00:31:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:41,353 INFO L225 Difference]: With dead ends: 178 [2024-11-17 00:31:41,353 INFO L226 Difference]: Without dead ends: 178 [2024-11-17 00:31:41,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=1002, Unknown=0, NotChecked=0, Total=1260 [2024-11-17 00:31:41,354 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 172 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:41,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 404 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:31:41,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-17 00:31:41,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-17 00:31:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 169 states have (on average 1.1301775147928994) internal successors, (191), 177 states have internal predecessors, (191), 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-11-17 00:31:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2024-11-17 00:31:41,359 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 123 [2024-11-17 00:31:41,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:41,360 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2024-11-17 00:31:41,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.217391304347826) internal successors, (120), 23 states have internal predecessors, (120), 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-11-17 00:31:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2024-11-17 00:31:41,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-17 00:31:41,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:41,361 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:41,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:41,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-17 00:31:41,566 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:41,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash 535231042, now seen corresponding path program 2 times [2024-11-17 00:31:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:41,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946021679] [2024-11-17 00:31:41,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:41,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:41,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946021679] [2024-11-17 00:31:41,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946021679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:41,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840291904] [2024-11-17 00:31:41,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:31:41,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:41,812 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:41,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-17 00:31:41,925 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:31:41,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:31:41,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 00:31:41,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:42,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:31:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2024-11-17 00:31:42,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2024-11-17 00:31:42,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840291904] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:42,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:42,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2024-11-17 00:31:42,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663699283] [2024-11-17 00:31:42,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:42,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-17 00:31:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:42,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 00:31:42,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-17 00:31:42,555 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand has 17 states, 16 states have (on average 5.6875) internal successors, (91), 17 states have internal predecessors, (91), 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-11-17 00:31:42,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:42,775 INFO L93 Difference]: Finished difference Result 177 states and 185 transitions. [2024-11-17 00:31:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:31:42,776 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.6875) internal successors, (91), 17 states have internal predecessors, (91), 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 124 [2024-11-17 00:31:42,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:42,776 INFO L225 Difference]: With dead ends: 177 [2024-11-17 00:31:42,776 INFO L226 Difference]: Without dead ends: 177 [2024-11-17 00:31:42,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:31:42,777 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 86 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:42,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 342 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:31:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-17 00:31:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-17 00:31:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 169 states have (on average 1.0946745562130178) internal successors, (185), 176 states have internal predecessors, (185), 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-11-17 00:31:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 185 transitions. [2024-11-17 00:31:42,781 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 185 transitions. Word has length 124 [2024-11-17 00:31:42,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:42,781 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 185 transitions. [2024-11-17 00:31:42,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.6875) internal successors, (91), 17 states have internal predecessors, (91), 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-11-17 00:31:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 185 transitions. [2024-11-17 00:31:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-17 00:31:42,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:42,782 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:42,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-17 00:31:42,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-17 00:31:42,983 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:42,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1486901114, now seen corresponding path program 2 times [2024-11-17 00:31:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412537343] [2024-11-17 00:31:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:43,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:43,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412537343] [2024-11-17 00:31:43,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412537343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:43,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131147888] [2024-11-17 00:31:43,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:31:43,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:43,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:43,149 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:43,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-17 00:31:43,324 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:31:43,324 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:31:43,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:31:43,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:43,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:31:43,462 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:43,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131147888] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:31:43,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:31:43,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-17 00:31:43,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560573504] [2024-11-17 00:31:43,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:31:43,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:31:43,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:43,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:31:43,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:31:43,464 INFO L87 Difference]: Start difference. First operand 177 states and 185 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 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-11-17 00:31:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:43,517 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2024-11-17 00:31:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:31:43,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 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 137 [2024-11-17 00:31:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:43,518 INFO L225 Difference]: With dead ends: 177 [2024-11-17 00:31:43,518 INFO L226 Difference]: Without dead ends: 177 [2024-11-17 00:31:43,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 266 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:31:43,519 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:43,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 128 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-17 00:31:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-17 00:31:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 169 states have (on average 1.0710059171597632) internal successors, (181), 176 states have internal predecessors, (181), 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-11-17 00:31:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 181 transitions. [2024-11-17 00:31:43,523 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 181 transitions. Word has length 137 [2024-11-17 00:31:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:43,524 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 181 transitions. [2024-11-17 00:31:43,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 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-11-17 00:31:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2024-11-17 00:31:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-17 00:31:43,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:43,525 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:43,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-17 00:31:43,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:43,730 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:43,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:43,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1282160123, now seen corresponding path program 3 times [2024-11-17 00:31:43,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:43,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533347981] [2024-11-17 00:31:43,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:43,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:31:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 208 proven. 47 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-17 00:31:44,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:31:44,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533347981] [2024-11-17 00:31:44,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533347981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:31:44,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100984673] [2024-11-17 00:31:44,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:31:44,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:44,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:31:44,024 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 00:31:44,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-17 00:31:44,169 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:31:44,169 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:31:44,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-17 00:31:44,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:31:44,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:31:44,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:31:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-17 00:31:45,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:31:45,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100984673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:31:45,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 00:31:45,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 19 [2024-11-17 00:31:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162823317] [2024-11-17 00:31:45,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:31:45,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:31:45,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:31:45,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:31:45,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:31:45,069 INFO L87 Difference]: Start difference. First operand 177 states and 181 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-11-17 00:31:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:31:45,172 INFO L93 Difference]: Finished difference Result 176 states and 180 transitions. [2024-11-17 00:31:45,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:31:45,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 153 [2024-11-17 00:31:45,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:31:45,173 INFO L225 Difference]: With dead ends: 176 [2024-11-17 00:31:45,173 INFO L226 Difference]: Without dead ends: 176 [2024-11-17 00:31:45,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2024-11-17 00:31:45,174 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:31:45,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:31:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-17 00:31:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2024-11-17 00:31:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 168 states have (on average 1.0654761904761905) internal successors, (179), 174 states have internal predecessors, (179), 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-11-17 00:31:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 179 transitions. [2024-11-17 00:31:45,177 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 179 transitions. Word has length 153 [2024-11-17 00:31:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:31:45,177 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 179 transitions. [2024-11-17 00:31:45,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-11-17 00:31:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2024-11-17 00:31:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-17 00:31:45,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:31:45,178 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:45,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-17 00:31:45,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:31:45,379 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-17 00:31:45,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:31:45,379 INFO L85 PathProgramCache]: Analyzing trace with hash -824454662, now seen corresponding path program 3 times [2024-11-17 00:31:45,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:31:45,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493255770] [2024-11-17 00:31:45,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:31:45,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:31:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:31:45,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 00:31:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:31:45,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 00:31:45,675 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 00:31:45,675 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2024-11-17 00:31:45,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 17 remaining) [2024-11-17 00:31:45,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2024-11-17 00:31:45,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2024-11-17 00:31:45,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2024-11-17 00:31:45,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2024-11-17 00:31:45,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2024-11-17 00:31:45,681 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2024-11-17 00:31:45,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2024-11-17 00:31:45,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2024-11-17 00:31:45,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2024-11-17 00:31:45,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2024-11-17 00:31:45,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2024-11-17 00:31:45,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2024-11-17 00:31:45,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2024-11-17 00:31:45,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2024-11-17 00:31:45,682 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 17 remaining) [2024-11-17 00:31:45,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 00:31:45,689 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:31:45,798 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:31:45,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:31:45 BoogieIcfgContainer [2024-11-17 00:31:45,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:31:45,805 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:31:45,805 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:31:45,805 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:31:45,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:31:20" (3/4) ... [2024-11-17 00:31:45,806 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-17 00:31:45,885 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 00:31:45,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:31:45,886 INFO L158 Benchmark]: Toolchain (without parser) took 25970.36ms. Allocated memory was 174.1MB in the beginning and 383.8MB in the end (delta: 209.7MB). Free memory was 118.3MB in the beginning and 318.7MB in the end (delta: -200.4MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-17 00:31:45,886 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:31:45,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.35ms. Allocated memory is still 174.1MB. Free memory was 117.8MB in the beginning and 140.4MB in the end (delta: -22.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 00:31:45,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.36ms. Allocated memory is still 174.1MB. Free memory was 140.4MB in the beginning and 138.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:31:45,887 INFO L158 Benchmark]: Boogie Preprocessor took 52.53ms. Allocated memory is still 174.1MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:31:45,887 INFO L158 Benchmark]: IcfgBuilder took 469.25ms. Allocated memory is still 174.1MB. Free memory was 136.2MB in the beginning and 117.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-17 00:31:45,887 INFO L158 Benchmark]: TraceAbstraction took 24918.07ms. Allocated memory was 174.1MB in the beginning and 383.8MB in the end (delta: 209.7MB). Free memory was 116.5MB in the beginning and 328.1MB in the end (delta: -211.6MB). Peak memory consumption was 207.5MB. Max. memory is 16.1GB. [2024-11-17 00:31:45,887 INFO L158 Benchmark]: Witness Printer took 81.19ms. Allocated memory is still 383.8MB. Free memory was 328.1MB in the beginning and 318.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-17 00:31:45,888 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.16ms. Allocated memory is still 96.5MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.35ms. Allocated memory is still 174.1MB. Free memory was 117.8MB in the beginning and 140.4MB in the end (delta: -22.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.36ms. Allocated memory is still 174.1MB. Free memory was 140.4MB in the beginning and 138.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.53ms. Allocated memory is still 174.1MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 469.25ms. Allocated memory is still 174.1MB. Free memory was 136.2MB in the beginning and 117.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 24918.07ms. Allocated memory was 174.1MB in the beginning and 383.8MB in the end (delta: 209.7MB). Free memory was 116.5MB in the beginning and 328.1MB in the end (delta: -211.6MB). Peak memory consumption was 207.5MB. Max. memory is 16.1GB. * Witness Printer took 81.19ms. Allocated memory is still 383.8MB. Free memory was 328.1MB in the beginning and 318.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L6] static int array[10]; [L6] static int array[10]; [L6] static int array[10]; [L6] static int array[10]; [L6] static int array[10]; [L6] static int array[10]; [L6] static int array[10]; [L6] static int array[10]; [L6] static int array[10]; [L6] static int array[10]; [L17] static int numbers2[10]; [L17] static int numbers2[10]; [L17] static int numbers2[10]; [L17] static int numbers2[10]; [L17] static int numbers2[10]; [L17] static int numbers2[10]; [L17] static int numbers2[10]; [L17] static int numbers2[10]; [L17] static int numbers2[10]; [L17] static int numbers2[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; [L36] static int numbers4[10]; [L36] static int numbers4[10]; [L36] static int numbers4[10]; [L36] static int numbers4[10]; [L36] static int numbers4[10]; [L36] static int numbers4[10]; [L36] static int numbers4[10]; [L36] static int numbers4[10]; [L36] static int numbers4[10]; [L36] static int numbers4[10]; VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L45] CALL getNumbers4() [L35] CALL, EXPR getNumbers3() [L25] CALL, EXPR getNumbers2() [L16] CALL, EXPR getNumbers() [L8] int i = 0; VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L8] ++i VAL [array={1:0}, i=10, numbers2={2:0}, numbers4={3:0}] [L8] COND FALSE !(i < 10) VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L12] return array; VAL [\result={1:0}, array={1:0}, numbers2={2:0}, numbers4={3:0}] [L16] RET, EXPR getNumbers() [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] ++i VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] ++i VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] ++i VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] ++i VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] ++i VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] ++i VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] ++i VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] ++i VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] ++i VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L18] ++i VAL [array={1:0}, i=10, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND FALSE !(i < 10) VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L21] return numbers2; VAL [\result={2:0}, array={1:0}, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L25] RET, EXPR getNumbers2() [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={1:0}, i=0, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L27] ++i VAL [array={1:0}, i=1, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L27] ++i VAL [array={1:0}, i=2, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L27] ++i VAL [array={1:0}, i=3, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L27] ++i VAL [array={1:0}, i=4, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L27] ++i VAL [array={1:0}, i=5, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L27] ++i VAL [array={1:0}, i=6, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L27] ++i VAL [array={1:0}, i=7, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L27] ++i VAL [array={1:0}, i=8, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L27] ++i VAL [array={1:0}, i=9, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L27] ++i VAL [array={1:0}, i=10, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND FALSE !(i < 10) VAL [array={1:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L31] return numbers3; [L31] return numbers3; VAL [\result={10:0}, array={1:0}, numbers2={2:0}, numbers4={3:0}, numbers={2:0}] [L35] RET, EXPR getNumbers3() [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}, numbers={10:0}] [L37] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}, numbers={10:0}] [L38] numbers[i] - UnprovableResult [Line: 43]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 24.7s, OverallIterations: 26, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1581 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1581 mSDsluCounter, 4037 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3067 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2931 IncrementalHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 970 mSDtfsCounter, 2931 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2585 GetRequests, 2280 SyntacticMatches, 6 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=22, InterpolantAutomatonStates: 187, 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, 25 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 3415 NumberOfCodeBlocks, 3038 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 4283 ConstructedInterpolants, 198 QuantifiedInterpolants, 37352 SizeOfPredicates, 21 NumberOfNonLiveVariables, 4407 ConjunctsInSsa, 202 ConjunctsInUnsatCore, 53 InterpolantComputations, 12 PerfectInterpolantSequences, 15836/16875 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-17 00:31:45,925 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)