./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-15/cstrchr_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/termination-15/cstrchr_diffterm_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash f27f7de04bee74889a56bbf881837a58685d2698bd59f8238a4f64af197ab581 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:38:13,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:38:13,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:38:13,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:38:13,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:38:14,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:38:14,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:38:14,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:38:14,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:38:14,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:38:14,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:38:14,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:38:14,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:38:14,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:38:14,007 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:38:14,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:38:14,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:38:14,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:38:14,008 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:38:14,009 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:38:14,009 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:38:14,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:38:14,010 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:38:14,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:38:14,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:38:14,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:38:14,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:38:14,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:38:14,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:38:14,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:38:14,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:38:14,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:38:14,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:38:14,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:38:14,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:38:14,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:38:14,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:38:14,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:38:14,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:38:14,015 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f27f7de04bee74889a56bbf881837a58685d2698bd59f8238a4f64af197ab581 [2024-11-09 07:38:14,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:38:14,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:38:14,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:38:14,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:38:14,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:38:14,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrchr_diffterm_alloca.i [2024-11-09 07:38:15,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:38:15,863 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:38:15,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrchr_diffterm_alloca.i [2024-11-09 07:38:15,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1469ba96/d12e7fe119fa4ef4a4a2c80edba6441f/FLAGead34a990 [2024-11-09 07:38:15,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1469ba96/d12e7fe119fa4ef4a4a2c80edba6441f [2024-11-09 07:38:15,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:38:15,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:38:15,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:38:15,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:38:15,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:38:15,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:38:15" (1/1) ... [2024-11-09 07:38:15,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3cb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:15, skipping insertion in model container [2024-11-09 07:38:15,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:38:15" (1/1) ... [2024-11-09 07:38:15,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:38:16,205 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:38:16,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:38:16,216 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:38:16,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:38:16,335 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:38:16,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16 WrapperNode [2024-11-09 07:38:16,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:38:16,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:38:16,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:38:16,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:38:16,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,396 INFO L138 Inliner]: procedures = 152, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2024-11-09 07:38:16,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:38:16,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:38:16,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:38:16,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:38:16,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,420 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-11-09 07:38:16,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:38:16,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:38:16,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:38:16,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:38:16,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (1/1) ... [2024-11-09 07:38:16,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:38:16,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:16,465 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-09 07:38:16,467 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-09 07:38:16,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:38:16,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:38:16,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:38:16,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:38:16,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:38:16,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:38:16,560 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:38:16,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:38:16,679 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-09 07:38:16,681 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:38:16,691 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:38:16,692 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:38:16,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:38:16 BoogieIcfgContainer [2024-11-09 07:38:16,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:38:16,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:38:16,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:38:16,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:38:16,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:38:15" (1/3) ... [2024-11-09 07:38:16,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2e90bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:38:16, skipping insertion in model container [2024-11-09 07:38:16,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:38:16" (2/3) ... [2024-11-09 07:38:16,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2e90bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:38:16, skipping insertion in model container [2024-11-09 07:38:16,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:38:16" (3/3) ... [2024-11-09 07:38:16,699 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrchr_diffterm_alloca.i [2024-11-09 07:38:16,713 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:38:16,713 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-09 07:38:16,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:38:16,758 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;@5e634246, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:38:16,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 07:38:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 26 states have internal predecessors, (30), 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-09 07:38:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:38:16,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:16,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:38:16,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:16,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:16,772 INFO L85 PathProgramCache]: Analyzing trace with hash 28693828, now seen corresponding path program 1 times [2024-11-09 07:38:16,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:16,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622644688] [2024-11-09 07:38:16,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:17,015 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-09 07:38:17,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622644688] [2024-11-09 07:38:17,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622644688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:17,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:17,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:38:17,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807435469] [2024-11-09 07:38:17,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:17,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:38:17,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:17,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:38:17,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:38:17,050 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 26 states have internal predecessors, (30), 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), 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-09 07:38:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:17,100 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-09 07:38:17,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:38:17,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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-09 07:38:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:17,108 INFO L225 Difference]: With dead ends: 26 [2024-11-09 07:38:17,108 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 07:38:17,110 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-09 07:38:17,113 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:17,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 07:38:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 07:38:17,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 23 states have internal predecessors, (26), 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-09 07:38:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-09 07:38:17,138 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 5 [2024-11-09 07:38:17,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:17,138 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-09 07:38:17,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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-09 07:38:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-09 07:38:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:38:17,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:17,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:38:17,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:38:17,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:17,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:17,142 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2024-11-09 07:38:17,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:17,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859464017] [2024-11-09 07:38:17,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:17,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:17,324 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-09 07:38:17,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:17,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859464017] [2024-11-09 07:38:17,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859464017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:17,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:17,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:38:17,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055203955] [2024-11-09 07:38:17,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:17,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:38:17,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:38:17,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:38:17,329 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:17,344 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-09 07:38:17,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:38:17,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:38:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:17,346 INFO L225 Difference]: With dead ends: 26 [2024-11-09 07:38:17,347 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 07:38:17,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-09 07:38:17,348 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:17,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:17,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 07:38:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 07:38:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 25 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-09 07:38:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-09 07:38:17,354 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 5 [2024-11-09 07:38:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:17,355 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 07:38:17,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-09 07:38:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:38:17,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:17,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:38:17,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:38:17,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:17,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:17,358 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2024-11-09 07:38:17,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:17,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458667693] [2024-11-09 07:38:17,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:17,488 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-09 07:38:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:17,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458667693] [2024-11-09 07:38:17,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458667693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:17,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:17,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:38:17,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032622190] [2024-11-09 07:38:17,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:17,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:38:17,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:17,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:38:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:38:17,491 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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-09 07:38:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:17,508 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-09 07:38:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:38:17,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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-09 07:38:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:17,509 INFO L225 Difference]: With dead ends: 25 [2024-11-09 07:38:17,509 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 07:38:17,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:38:17,510 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:17,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 07:38:17,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-11-09 07:38:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 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-09 07:38:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-11-09 07:38:17,515 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 5 [2024-11-09 07:38:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:17,515 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-11-09 07:38:17,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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-09 07:38:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-11-09 07:38:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:38:17,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:17,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:17,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:38:17,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:17,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1804964393, now seen corresponding path program 1 times [2024-11-09 07:38:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:17,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087719720] [2024-11-09 07:38:17,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:17,560 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-09 07:38:17,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:17,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087719720] [2024-11-09 07:38:17,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087719720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:17,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:17,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:38:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424438373] [2024-11-09 07:38:17,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:17,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:38:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:17,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:38:17,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:38:17,565 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-09 07:38:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:17,596 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-09 07:38:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:38:17,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-09 07:38:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:17,597 INFO L225 Difference]: With dead ends: 20 [2024-11-09 07:38:17,597 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 07:38:17,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:38:17,598 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:17,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 07:38:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 07:38:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 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-09 07:38:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-09 07:38:17,601 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 7 [2024-11-09 07:38:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:17,604 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-09 07:38:17,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-09 07:38:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-09 07:38:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:38:17,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:17,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:17,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:38:17,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:17,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1804964394, now seen corresponding path program 1 times [2024-11-09 07:38:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:17,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974386604] [2024-11-09 07:38:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:17,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:17,701 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-09 07:38:17,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:17,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974386604] [2024-11-09 07:38:17,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974386604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:17,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:17,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:38:17,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076871508] [2024-11-09 07:38:17,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:17,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:38:17,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:17,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:38:17,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:38:17,705 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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-09 07:38:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:17,786 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-09 07:38:17,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:38:17,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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 7 [2024-11-09 07:38:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:17,787 INFO L225 Difference]: With dead ends: 28 [2024-11-09 07:38:17,787 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 07:38:17,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:38:17,788 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:17,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:38:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 07:38:17,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-09 07:38:17,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 26 states have internal predecessors, (31), 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-09 07:38:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-09 07:38:17,793 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 7 [2024-11-09 07:38:17,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:17,793 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-09 07:38:17,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 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-09 07:38:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-09 07:38:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:38:17,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:17,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:17,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:38:17,794 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:17,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1531298047, now seen corresponding path program 1 times [2024-11-09 07:38:17,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:17,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244125964] [2024-11-09 07:38:17,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:17,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:17,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:17,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244125964] [2024-11-09 07:38:17,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244125964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:17,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:17,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:38:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774635031] [2024-11-09 07:38:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:17,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:38:17,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:17,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:38:17,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:38:17,832 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:17,842 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-09 07:38:17,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:38:17,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:38:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:17,844 INFO L225 Difference]: With dead ends: 29 [2024-11-09 07:38:17,844 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 07:38:17,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:38:17,845 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:17,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 07:38:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 07:38:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 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-09 07:38:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 07:38:17,851 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2024-11-09 07:38:17,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:17,851 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 07:38:17,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 07:38:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:38:17,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:17,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:17,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:38:17,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:17,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:17,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1590499358, now seen corresponding path program 1 times [2024-11-09 07:38:17,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:17,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181587088] [2024-11-09 07:38:17,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:17,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:18,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:18,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181587088] [2024-11-09 07:38:18,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181587088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:18,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:18,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:38:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344060381] [2024-11-09 07:38:18,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:18,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:38:18,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:18,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:38:18,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:38:18,071 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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-09 07:38:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:18,141 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-09 07:38:18,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:38:18,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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 13 [2024-11-09 07:38:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:18,142 INFO L225 Difference]: With dead ends: 38 [2024-11-09 07:38:18,143 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 07:38:18,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:38:18,144 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:18,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:38:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 07:38:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-11-09 07:38:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 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-09 07:38:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-09 07:38:18,149 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 13 [2024-11-09 07:38:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:18,150 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-09 07:38:18,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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-09 07:38:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-09 07:38:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:38:18,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:18,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:18,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:38:18,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:18,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2003403360, now seen corresponding path program 1 times [2024-11-09 07:38:18,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:18,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20260463] [2024-11-09 07:38:18,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:18,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:18,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20260463] [2024-11-09 07:38:18,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20260463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:18,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35182711] [2024-11-09 07:38:18,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:18,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:18,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:18,409 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-09 07:38:18,414 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-09 07:38:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:18,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 07:38:18,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:18,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 07:38:18,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:38:18,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-09 07:38:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:18,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:19,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-09 07:38:19,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 07:38:19,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:38:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:19,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35182711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:19,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:19,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2024-11-09 07:38:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394719597] [2024-11-09 07:38:19,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:19,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:38:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:19,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:38:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:38:19,042 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 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-09 07:38:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:19,386 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-09 07:38:19,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:38:19,387 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 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 13 [2024-11-09 07:38:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:19,388 INFO L225 Difference]: With dead ends: 45 [2024-11-09 07:38:19,388 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 07:38:19,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:38:19,389 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:19,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 136 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:38:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 07:38:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2024-11-09 07:38:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 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-09 07:38:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 07:38:19,392 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 13 [2024-11-09 07:38:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:19,392 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 07:38:19,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 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-09 07:38:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 07:38:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:38:19,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:19,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:19,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:38:19,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:19,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:19,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:19,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2053675818, now seen corresponding path program 1 times [2024-11-09 07:38:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:19,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283088480] [2024-11-09 07:38:19,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:19,642 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-09 07:38:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283088480] [2024-11-09 07:38:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283088480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:38:19,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:38:19,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:38:19,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778624098] [2024-11-09 07:38:19,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:38:19,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:38:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:19,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:38:19,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:38:19,644 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:19,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:19,655 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-09 07:38:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:38:19,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:38:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:19,656 INFO L225 Difference]: With dead ends: 31 [2024-11-09 07:38:19,656 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 07:38:19,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:38:19,657 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:19,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:38:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 07:38:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 07:38:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-09 07:38:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-11-09 07:38:19,658 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 14 [2024-11-09 07:38:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:19,658 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-11-09 07:38:19,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-11-09 07:38:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:38:19,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:19,659 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:38:19,659 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:19,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1985024788, now seen corresponding path program 2 times [2024-11-09 07:38:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:19,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626288134] [2024-11-09 07:38:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:20,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626288134] [2024-11-09 07:38:20,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626288134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555785522] [2024-11-09 07:38:20,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:38:20,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:20,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:20,047 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-09 07:38:20,049 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-09 07:38:20,097 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:38:20,098 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:38:20,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 07:38:20,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:20,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 07:38:37,513 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 07:38:37,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 20 [2024-11-09 07:38:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:37,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:37,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-09 07:38:37,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-09 07:38:37,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-09 07:38:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555785522] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:37,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:37,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 13] total 33 [2024-11-09 07:38:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866428667] [2024-11-09 07:38:37,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:37,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 07:38:37,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:37,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 07:38:37,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=965, Unknown=7, NotChecked=0, Total=1122 [2024-11-09 07:38:37,936 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 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-09 07:38:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:57,501 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2024-11-09 07:38:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 07:38:57,502 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 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 19 [2024-11-09 07:38:57,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:57,502 INFO L225 Difference]: With dead ends: 49 [2024-11-09 07:38:57,502 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 07:38:57,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=432, Invalid=2620, Unknown=28, NotChecked=0, Total=3080 [2024-11-09 07:38:57,504 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 51 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 5 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:57,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 87 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 304 Invalid, 13 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 07:38:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 07:38:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2024-11-09 07:38:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2024-11-09 07:38:57,510 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 19 [2024-11-09 07:38:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:57,510 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2024-11-09 07:38:57,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 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-09 07:38:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2024-11-09 07:38:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:38:57,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:57,511 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:57,528 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-09 07:38:57,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:38:57,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:57,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash 402580196, now seen corresponding path program 3 times [2024-11-09 07:38:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:57,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604767352] [2024-11-09 07:38:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:58,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:58,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604767352] [2024-11-09 07:38:58,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604767352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:58,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941987721] [2024-11-09 07:38:58,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:38:58,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:58,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:58,701 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-09 07:38:58,711 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-09 07:38:58,781 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 07:38:58,781 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:38:58,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-09 07:38:58,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:58,824 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-09 07:38:58,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 07:39:00,240 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-11-09 07:39:00,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2024-11-09 07:39:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-09 07:39:00,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:39:03,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2024-11-09 07:39:03,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:39:03,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 127 treesize of output 235 [2024-11-09 07:39:03,517 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-09 07:39:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:39:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941987721] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:39:03,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:39:03,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 30] total 56 [2024-11-09 07:39:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095081709] [2024-11-09 07:39:03,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:39:03,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-09 07:39:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:39:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-09 07:39:03,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2835, Unknown=0, NotChecked=0, Total=3192 [2024-11-09 07:39:03,953 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 57 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 57 states have internal predecessors, (103), 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-09 07:39:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:39:05,775 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2024-11-09 07:39:05,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 07:39:05,776 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 57 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-09 07:39:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:39:05,776 INFO L225 Difference]: With dead ends: 48 [2024-11-09 07:39:05,776 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:39:05,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1059, Invalid=6423, Unknown=0, NotChecked=0, Total=7482 [2024-11-09 07:39:05,779 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 46 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:39:05,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 178 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:39:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:39:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:39:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:39:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:39:05,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2024-11-09 07:39:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:39:05,780 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:39:05,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.8392857142857142) internal successors, (103), 57 states have internal predecessors, (103), 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-09 07:39:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:39:05,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:39:05,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2024-11-09 07:39:05,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2024-11-09 07:39:05,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2024-11-09 07:39:05,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2024-11-09 07:39:05,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2024-11-09 07:39:05,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2024-11-09 07:39:05,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2024-11-09 07:39:05,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2024-11-09 07:39:05,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-11-09 07:39:05,798 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-09 07:39:05,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:39:05,987 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:39:05,989 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:39:05,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:39:05 BoogieIcfgContainer [2024-11-09 07:39:05,991 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:39:05,992 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:39:05,992 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:39:05,992 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:39:05,992 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:38:16" (3/4) ... [2024-11-09 07:39:05,994 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:39:06,001 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 07:39:06,001 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 07:39:06,001 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 07:39:06,001 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:39:06,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:39:06,069 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:39:06,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:39:06,070 INFO L158 Benchmark]: Toolchain (without parser) took 50173.31ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 105.4MB in the beginning and 200.5MB in the end (delta: -95.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:39:06,070 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 176.2MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:39:06,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.50ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 145.8MB in the end (delta: -40.6MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-11-09 07:39:06,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.09ms. Allocated memory is still 176.2MB. Free memory was 145.2MB in the beginning and 143.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:39:06,073 INFO L158 Benchmark]: Boogie Preprocessor took 31.84ms. Allocated memory is still 176.2MB. Free memory was 143.7MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:39:06,073 INFO L158 Benchmark]: RCFGBuilder took 262.51ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 129.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:39:06,073 INFO L158 Benchmark]: TraceAbstraction took 49297.87ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 128.4MB in the beginning and 205.7MB in the end (delta: -77.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-11-09 07:39:06,073 INFO L158 Benchmark]: Witness Printer took 77.76ms. Allocated memory is still 268.4MB. Free memory was 205.7MB in the beginning and 200.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 07:39:06,074 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.35ms. Allocated memory is still 176.2MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.50ms. Allocated memory is still 176.2MB. Free memory was 105.2MB in the beginning and 145.8MB in the end (delta: -40.6MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.09ms. Allocated memory is still 176.2MB. Free memory was 145.2MB in the beginning and 143.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.84ms. Allocated memory is still 176.2MB. Free memory was 143.7MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 262.51ms. Allocated memory is still 176.2MB. Free memory was 141.6MB in the beginning and 129.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49297.87ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 128.4MB in the beginning and 205.7MB in the end (delta: -77.3MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Witness Printer took 77.76ms. Allocated memory is still 268.4MB. Free memory was 205.7MB in the beginning and 200.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 370]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 49.2s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 722 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 549 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1562 IncrementalHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 173 mSDtfsCounter, 1562 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 71 SyntacticMatches, 11 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2790 ImplicationChecksByTransitivity, 38.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=10, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 24 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 275 ConstructedInterpolants, 77 QuantifiedInterpolants, 5508 SizeOfPredicates, 16 NumberOfNonLiveVariables, 360 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 67/317 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:39:06,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE