./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/scopes3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/scopes3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8b4bb9a8f404cd020a4d6119f922da096d098a1547934faf4c16f394bfab92c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:58:59,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:58:59,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:58:59,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:58:59,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:58:59,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:58:59,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:58:59,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:58:59,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:58:59,554 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:58:59,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:58:59,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:58:59,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:58:59,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:58:59,557 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:58:59,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:58:59,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:58:59,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:58:59,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:58:59,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:58:59,558 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:58:59,561 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:58:59,561 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:58:59,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:58:59,562 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:58:59,562 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:58:59,562 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:58:59,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:58:59,563 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:58:59,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:58:59,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:58:59,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:58:59,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:58:59,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:58:59,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:58:59,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:58:59,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:58:59,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:58:59,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:58:59,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:58:59,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:58:59,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:58:59,568 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8b4bb9a8f404cd020a4d6119f922da096d098a1547934faf4c16f394bfab92c [2024-10-14 17:58:59,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:58:59,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:58:59,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:58:59,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:58:59,853 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:58:59,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/scopes3.c [2024-10-14 17:59:01,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:59:01,413 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:59:01,414 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/scopes3.c [2024-10-14 17:59:01,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/929c6dfdb/1d47817fe98a43929d241ac3b216debc/FLAG9c576c987 [2024-10-14 17:59:01,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/929c6dfdb/1d47817fe98a43929d241ac3b216debc [2024-10-14 17:59:01,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:59:01,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:59:01,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:59:01,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:59:01,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:59:01,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d68b3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01, skipping insertion in model container [2024-10-14 17:59:01,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:59:01,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:59:01,628 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:59:01,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:59:01,661 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:59:01,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01 WrapperNode [2024-10-14 17:59:01,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:59:01,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:59:01,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:59:01,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:59:01,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,692 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2024-10-14 17:59:01,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:59:01,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:59:01,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:59:01,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:59:01,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,712 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-10-14 17:59:01,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:59:01,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:59:01,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:59:01,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:59:01,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (1/1) ... [2024-10-14 17:59:01,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:59:01,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:01,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:59:01,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:59:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 17:59:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:59:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:59:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:59:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:59:01,849 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:59:01,851 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:59:01,953 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 17:59:01,953 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:59:01,979 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:59:01,979 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 17:59:01,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:59:01 BoogieIcfgContainer [2024-10-14 17:59:01,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:59:01,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:59:01,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:59:01,989 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:59:01,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:59:01" (1/3) ... [2024-10-14 17:59:01,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9a1634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:59:01, skipping insertion in model container [2024-10-14 17:59:01,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:01" (2/3) ... [2024-10-14 17:59:01,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9a1634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:59:01, skipping insertion in model container [2024-10-14 17:59:01,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:59:01" (3/3) ... [2024-10-14 17:59:01,992 INFO L112 eAbstractionObserver]: Analyzing ICFG scopes3.c [2024-10-14 17:59:02,008 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:59:02,008 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-14 17:59:02,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:59:02,057 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;@1fdf2617, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:59:02,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-14 17:59:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 11 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-10-14 17:59:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:59:02,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:02,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:59:02,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-14 17:59:02,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash 58943, now seen corresponding path program 1 times [2024-10-14 17:59:02,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:02,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423205853] [2024-10-14 17:59:02,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:02,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:02,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:02,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423205853] [2024-10-14 17:59:02,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423205853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:02,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:02,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:59:02,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349377321] [2024-10-14 17:59:02,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:02,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:02,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:02,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:59:02,315 INFO L87 Difference]: Start difference. First operand has 12 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 11 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:02,355 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2024-10-14 17:59:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:02,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 17:59:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:02,367 INFO L225 Difference]: With dead ends: 11 [2024-10-14 17:59:02,367 INFO L226 Difference]: Without dead ends: 10 [2024-10-14 17:59:02,369 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-10-14 17:59:02,372 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:02,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-10-14 17:59:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-14 17:59:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-10-14 17:59:02,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 3 [2024-10-14 17:59:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:02,399 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-10-14 17:59:02,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-10-14 17:59:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:59:02,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:02,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:59:02,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:59:02,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-14 17:59:02,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:02,402 INFO L85 PathProgramCache]: Analyzing trace with hash 58944, now seen corresponding path program 1 times [2024-10-14 17:59:02,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:02,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795219704] [2024-10-14 17:59:02,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:02,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:02,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:02,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795219704] [2024-10-14 17:59:02,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795219704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:02,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:02,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:59:02,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191143582] [2024-10-14 17:59:02,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:02,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:02,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:02,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:02,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:59:02,523 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:02,554 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2024-10-14 17:59:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:02,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 17:59:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:02,555 INFO L225 Difference]: With dead ends: 12 [2024-10-14 17:59:02,556 INFO L226 Difference]: Without dead ends: 12 [2024-10-14 17:59:02,556 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-10-14 17:59:02,558 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:02,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-14 17:59:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-14 17:59:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 11 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-10-14 17:59:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2024-10-14 17:59:02,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 3 [2024-10-14 17:59:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:02,565 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2024-10-14 17:59:02,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2024-10-14 17:59:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 17:59:02,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:02,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 17:59:02,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:59:02,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-14 17:59:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1825581, now seen corresponding path program 1 times [2024-10-14 17:59:02,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:02,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664354192] [2024-10-14 17:59:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:02,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:02,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:02,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664354192] [2024-10-14 17:59:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664354192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:59:02,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:59:02,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:59:02,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434081584] [2024-10-14 17:59:02,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:59:02,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:59:02,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:02,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:59:02,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:59:02,622 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:02,645 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2024-10-14 17:59:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:59:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-10-14 17:59:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:02,647 INFO L225 Difference]: With dead ends: 10 [2024-10-14 17:59:02,647 INFO L226 Difference]: Without dead ends: 10 [2024-10-14 17:59:02,647 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-10-14 17:59:02,648 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:02,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:02,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-10-14 17:59:02,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-10-14 17:59:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-10-14 17:59:02,670 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2024-10-14 17:59:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:02,670 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-10-14 17:59:02,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:02,671 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-10-14 17:59:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:59:02,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:02,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:59:02,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:59:02,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-14 17:59:02,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1756604854, now seen corresponding path program 1 times [2024-10-14 17:59:02,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:02,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762545580] [2024-10-14 17:59:02,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:02,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:02,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:02,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762545580] [2024-10-14 17:59:02,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762545580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:02,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788713605] [2024-10-14 17:59:02,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:02,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:02,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:59:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:02,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:59:02,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:02,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788713605] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:02,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:59:02,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-14 17:59:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540315733] [2024-10-14 17:59:02,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:02,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:59:02,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:02,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:59:02,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:59:02,887 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-10-14 17:59:02,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:02,926 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-10-14 17:59:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:59:02,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 6 [2024-10-14 17:59:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:02,928 INFO L225 Difference]: With dead ends: 15 [2024-10-14 17:59:02,928 INFO L226 Difference]: Without dead ends: 15 [2024-10-14 17:59:02,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:59:02,929 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:02,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-14 17:59:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-14 17:59:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-10-14 17:59:02,935 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 6 [2024-10-14 17:59:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:02,936 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-10-14 17:59:02,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-10-14 17:59:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-10-14 17:59:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 17:59:02,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:02,937 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2024-10-14 17:59:02,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:59:03,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:03,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-14 17:59:03,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:03,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1671929903, now seen corresponding path program 2 times [2024-10-14 17:59:03,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:03,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648964913] [2024-10-14 17:59:03,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:03,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:59:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:03,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:59:03,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648964913] [2024-10-14 17:59:03,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648964913] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:59:03,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232948780] [2024-10-14 17:59:03,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:59:03,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:03,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:59:03,345 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:59:03,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:59:03,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:59:03,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:59:03,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:59:03,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:59:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:03,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:59:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:59:03,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232948780] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:59:03,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:59:03,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-14 17:59:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367782991] [2024-10-14 17:59:03,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:59:03,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 17:59:03,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:59:03,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 17:59:03,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:59:03,553 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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-10-14 17:59:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:59:03,606 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-10-14 17:59:03,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:59:03,606 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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) Word has length 12 [2024-10-14 17:59:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:59:03,607 INFO L225 Difference]: With dead ends: 27 [2024-10-14 17:59:03,607 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 17:59:03,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:59:03,609 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:59:03,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:59:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 17:59:03,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 17:59:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:59:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-10-14 17:59:03,615 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 12 [2024-10-14 17:59:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:59:03,615 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-10-14 17:59:03,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 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-10-14 17:59:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-10-14 17:59:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 17:59:03,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:59:03,617 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2024-10-14 17:59:03,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:59:03,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:59:03,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-14 17:59:03,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:59:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash -210093241, now seen corresponding path program 3 times [2024-10-14 17:59:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:59:03,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365533039] [2024-10-14 17:59:03,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:59:03,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:59:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:59:03,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:59:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:59:03,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 17:59:03,990 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:59:03,991 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 5 remaining) [2024-10-14 17:59:03,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2024-10-14 17:59:03,993 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2024-10-14 17:59:03,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2024-10-14 17:59:03,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-10-14 17:59:03,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:59:03,997 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-10-14 17:59:04,034 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:59:04,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:59:04 BoogieIcfgContainer [2024-10-14 17:59:04,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:59:04,041 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:59:04,041 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:59:04,041 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:59:04,042 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:59:01" (3/4) ... [2024-10-14 17:59:04,043 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 17:59:04,096 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:59:04,098 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:59:04,099 INFO L158 Benchmark]: Toolchain (without parser) took 2659.71ms. Allocated memory is still 161.5MB. Free memory was 132.6MB in the beginning and 65.3MB in the end (delta: 67.3MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2024-10-14 17:59:04,099 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:59:04,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.01ms. Allocated memory is still 161.5MB. Free memory was 131.9MB in the beginning and 121.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 17:59:04,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.95ms. Allocated memory is still 161.5MB. Free memory was 121.4MB in the beginning and 120.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:59:04,100 INFO L158 Benchmark]: Boogie Preprocessor took 26.54ms. Allocated memory is still 161.5MB. Free memory was 120.0MB in the beginning and 118.7MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:59:04,100 INFO L158 Benchmark]: RCFGBuilder took 259.11ms. Allocated memory is still 161.5MB. Free memory was 118.7MB in the beginning and 107.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 17:59:04,101 INFO L158 Benchmark]: TraceAbstraction took 2054.94ms. Allocated memory is still 161.5MB. Free memory was 106.7MB in the beginning and 68.5MB in the end (delta: 38.3MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2024-10-14 17:59:04,101 INFO L158 Benchmark]: Witness Printer took 57.48ms. Allocated memory is still 161.5MB. Free memory was 68.5MB in the beginning and 65.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:59:04,102 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.15ms. Allocated memory is still 125.8MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.01ms. Allocated memory is still 161.5MB. Free memory was 131.9MB in the beginning and 121.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.95ms. Allocated memory is still 161.5MB. Free memory was 121.4MB in the beginning and 120.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.54ms. Allocated memory is still 161.5MB. Free memory was 120.0MB in the beginning and 118.7MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 259.11ms. Allocated memory is still 161.5MB. Free memory was 118.7MB in the beginning and 107.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2054.94ms. Allocated memory is still 161.5MB. Free memory was 106.7MB in the beginning and 68.5MB in the end (delta: 38.3MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 57.48ms. Allocated memory is still 161.5MB. Free memory was 68.5MB in the beginning and 65.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=0, p={3:0}] [L6] p[0] = 1 [L3] i++ VAL [i=1, p={3:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=1, p={4:0}] [L6] p[0] = 1 [L3] i++ VAL [i=2, p={4:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=2, p={5:0}] [L6] p[0] = 1 [L3] i++ VAL [i=3, p={5:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=3, p={6:0}] [L6] p[0] = 1 [L3] i++ VAL [i=4, p={6:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=4, p={7:0}] [L6] p[0] = 1 [L3] i++ VAL [i=5, p={7:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=5, p={8:0}] [L6] p[0] = 1 [L3] i++ VAL [i=6, p={8:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=6, p={9:0}] [L6] p[0] = 1 [L3] i++ VAL [i=7, p={9:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=7, p={10:0}] [L6] p[0] = 1 [L3] i++ VAL [i=8, p={10:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=8, p={11:0}] [L6] p[0] = 1 [L3] i++ VAL [i=9, p={11:0}] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [i=9, p={2:0}] [L6] p[0] = 1 [L3] i++ VAL [i=10, p={2:0}] [L3] COND FALSE !(i < 10) VAL [p={2:0}] [L8] p[0] = 2 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 26 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=5, InterpolantAutomatonStates: 27, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 141 SizeOfPredicates, 0 NumberOfNonLiveVariables, 172 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 0/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 17:59:04,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)