./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/cstrcspn-alloca-2.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 f64b3fe201853945f195ec183c791419b294b96abed6f2b53814faca3533a624 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:48:26,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:48:26,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-14 17:48:26,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:48:26,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:48:26,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:48:26,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:48:26,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:48:26,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:48:26,665 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:48:26,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:48:26,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:48:26,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:48:26,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:48:26,672 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:48:26,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:48:26,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:48:26,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:48:26,673 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:48:26,673 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:48:26,673 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:48:26,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:48:26,674 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:48:26,674 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:48:26,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:48:26,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:48:26,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:48:26,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:48:26,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:48:26,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:48:26,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:48:26,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:48:26,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:48:26,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:48:26,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:48:26,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:48:26,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:48:26,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:48:26,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:48:26,677 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 -> f64b3fe201853945f195ec183c791419b294b96abed6f2b53814faca3533a624 [2024-10-14 17:48:26,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:48:26,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:48:26,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:48:26,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:48:26,916 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:48:26,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca-2.i [2024-10-14 17:48:28,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:48:28,516 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:48:28,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca-2.i [2024-10-14 17:48:28,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc16395f9/3b3325ef4252418b89f57a0b76324cd9/FLAGa4bfd76f4 [2024-10-14 17:48:28,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc16395f9/3b3325ef4252418b89f57a0b76324cd9 [2024-10-14 17:48:28,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:48:28,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:48:28,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:48:28,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:48:28,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:48:28,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49cf4905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28, skipping insertion in model container [2024-10-14 17:48:28,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:48:28,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:48:28,850 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:48:28,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:48:28,897 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:48:28,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28 WrapperNode [2024-10-14 17:48:28,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:48:28,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:48:28,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:48:28,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:48:28,904 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:48:28" (1/1) ... [2024-10-14 17:48:28,914 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:48:28" (1/1) ... [2024-10-14 17:48:28,930 INFO L138 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-10-14 17:48:28,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:48:28,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:48:28,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:48:28,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:48:28,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,953 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-10-14 17:48:28,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:48:28,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:48:28,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:48:28,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:48:28,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28" (1/1) ... [2024-10-14 17:48:28,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:48:28,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:48:29,004 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:48:29,008 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:48:29,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 17:48:29,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 17:48:29,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 17:48:29,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 17:48:29,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:48:29,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:48:29,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:48:29,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:48:29,167 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:48:29,169 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:48:29,494 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-10-14 17:48:29,494 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:48:29,533 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:48:29,533 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 17:48:29,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:48:29 BoogieIcfgContainer [2024-10-14 17:48:29,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:48:29,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:48:29,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:48:29,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:48:29,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:48:28" (1/3) ... [2024-10-14 17:48:29,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3ff5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:48:29, skipping insertion in model container [2024-10-14 17:48:29,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:28" (2/3) ... [2024-10-14 17:48:29,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3ff5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:48:29, skipping insertion in model container [2024-10-14 17:48:29,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:48:29" (3/3) ... [2024-10-14 17:48:29,541 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca-2.i [2024-10-14 17:48:29,557 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:48:29,558 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-10-14 17:48:29,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:48:29,605 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;@629208c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:48:29,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-14 17:48:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 33 states have internal predecessors, (41), 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:48:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:48:29,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:29,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:48:29,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:29,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash 107288444, now seen corresponding path program 1 times [2024-10-14 17:48:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:29,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672407540] [2024-10-14 17:48:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:29,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:29,855 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:48:29,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:29,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672407540] [2024-10-14 17:48:29,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672407540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:29,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:29,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:48:29,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942010912] [2024-10-14 17:48:29,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:29,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:48:29,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:29,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:48:29,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:29,928 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 33 states have internal predecessors, (41), 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-10-14 17:48:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:30,023 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-10-14 17:48:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:30,026 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-10-14 17:48:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:30,031 INFO L225 Difference]: With dead ends: 33 [2024-10-14 17:48:30,031 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 17:48:30,035 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:48:30,039 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:30,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 17:48:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 17:48:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 31 states have internal predecessors, (37), 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:48:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-10-14 17:48:30,069 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 5 [2024-10-14 17:48:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:30,069 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-10-14 17:48:30,070 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-10-14 17:48:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-10-14 17:48:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:48:30,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:30,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:48:30,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:48:30,071 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:30,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:30,072 INFO L85 PathProgramCache]: Analyzing trace with hash 107288445, now seen corresponding path program 1 times [2024-10-14 17:48:30,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:30,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225702855] [2024-10-14 17:48:30,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:30,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:30,386 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:48:30,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:30,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225702855] [2024-10-14 17:48:30,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225702855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:30,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:30,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:48:30,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354770688] [2024-10-14 17:48:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:30,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:48:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:30,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:48:30,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:30,390 INFO L87 Difference]: Start difference. First operand 32 states and 37 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-10-14 17:48:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:30,425 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-14 17:48:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:48:30,425 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-10-14 17:48:30,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:30,426 INFO L225 Difference]: With dead ends: 35 [2024-10-14 17:48:30,426 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 17:48:30,427 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-10-14 17:48:30,428 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:30,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 57 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 17:48:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-14 17:48:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 34 states have internal predecessors, (41), 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:48:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-14 17:48:30,436 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 5 [2024-10-14 17:48:30,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:30,436 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-14 17:48:30,436 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-10-14 17:48:30,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-14 17:48:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:48:30,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:30,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:48:30,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:48:30,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:30,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash 107348027, now seen corresponding path program 1 times [2024-10-14 17:48:30,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:30,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755427477] [2024-10-14 17:48:30,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:30,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:30,629 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:48:30,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:30,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755427477] [2024-10-14 17:48:30,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755427477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:30,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:30,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:48:30,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637824462] [2024-10-14 17:48:30,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:30,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:48:30,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:30,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:48:30,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:30,635 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 4 states have (on average 1.25) 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-10-14 17:48:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:30,673 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-10-14 17:48:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:48:30,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) 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-10-14 17:48:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:30,674 INFO L225 Difference]: With dead ends: 34 [2024-10-14 17:48:30,674 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 17:48:30,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-10-14 17:48:30,676 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:30,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 17:48:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-10-14 17:48:30,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 2.0) internal successors, (36), 30 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-10-14 17:48:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-14 17:48:30,680 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 5 [2024-10-14 17:48:30,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:30,681 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-14 17:48:30,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) 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-10-14 17:48:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-10-14 17:48:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:48:30,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:30,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:48:30,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:48:30,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:30,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:30,687 INFO L85 PathProgramCache]: Analyzing trace with hash -969025543, now seen corresponding path program 1 times [2024-10-14 17:48:30,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:30,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662248970] [2024-10-14 17:48:30,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:30,720 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:48:30,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:30,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662248970] [2024-10-14 17:48:30,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662248970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:30,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:30,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:48:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675097545] [2024-10-14 17:48:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:30,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:48:30,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:30,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:48:30,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:30,723 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:48:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:30,761 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-10-14 17:48:30,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:30,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:48:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:30,763 INFO L225 Difference]: With dead ends: 30 [2024-10-14 17:48:30,763 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 17:48:30,764 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:48:30,765 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:30,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 17:48:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 17:48:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 29 states have internal predecessors, (35), 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:48:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-14 17:48:30,774 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 6 [2024-10-14 17:48:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:30,775 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-14 17:48:30,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:48:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-14 17:48:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:48:30,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:30,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:48:30,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:48:30,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:30,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:30,779 INFO L85 PathProgramCache]: Analyzing trace with hash -969025542, now seen corresponding path program 1 times [2024-10-14 17:48:30,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:30,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137076291] [2024-10-14 17:48:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:30,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:30,943 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:48:30,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:30,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137076291] [2024-10-14 17:48:30,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137076291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:30,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:30,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:48:30,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118557672] [2024-10-14 17:48:30,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:30,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:48:30,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:30,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:48:30,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:30,947 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:48:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:31,013 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-10-14 17:48:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:48:31,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:48:31,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:31,015 INFO L225 Difference]: With dead ends: 33 [2024-10-14 17:48:31,015 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 17:48:31,015 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-10-14 17:48:31,016 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:31,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:31,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 17:48:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-14 17:48:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 32 states have internal predecessors, (38), 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:48:31,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-10-14 17:48:31,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 6 [2024-10-14 17:48:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:31,028 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-10-14 17:48:31,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:48:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-10-14 17:48:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:48:31,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:31,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:48:31,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:48:31,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:31,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:31,033 INFO L85 PathProgramCache]: Analyzing trace with hash -968965960, now seen corresponding path program 1 times [2024-10-14 17:48:31,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:31,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899907476] [2024-10-14 17:48:31,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:31,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:31,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:31,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899907476] [2024-10-14 17:48:31,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899907476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:31,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:31,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:48:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442915259] [2024-10-14 17:48:31,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:31,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:48:31,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:31,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:48:31,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:31,169 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:48:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:31,190 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-10-14 17:48:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:48:31,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:48:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:31,191 INFO L225 Difference]: With dead ends: 32 [2024-10-14 17:48:31,191 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 17:48:31,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-10-14 17:48:31,192 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:31,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 17:48:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-10-14 17:48:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 28 states have internal predecessors, (34), 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:48:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-10-14 17:48:31,195 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 6 [2024-10-14 17:48:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:31,195 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-10-14 17:48:31,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:48:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-10-14 17:48:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:48:31,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:31,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:31,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:48:31,196 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:31,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash 24981343, now seen corresponding path program 1 times [2024-10-14 17:48:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555227615] [2024-10-14 17:48:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:31,250 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:48:31,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:31,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555227615] [2024-10-14 17:48:31,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555227615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:31,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:31,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:48:31,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406727577] [2024-10-14 17:48:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:31,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:48:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:31,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:48:31,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:31,254 INFO L87 Difference]: Start difference. First operand 29 states and 34 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-10-14 17:48:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:31,305 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-10-14 17:48:31,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:48:31,306 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-10-14 17:48:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:31,306 INFO L225 Difference]: With dead ends: 27 [2024-10-14 17:48:31,306 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 17:48:31,306 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-10-14 17:48:31,307 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:31,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 36 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 17:48:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 17:48:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 26 states have internal predecessors, (32), 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:48:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-14 17:48:31,309 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 7 [2024-10-14 17:48:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:31,313 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-14 17:48:31,314 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-10-14 17:48:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-14 17:48:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:48:31,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:31,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:31,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:48:31,315 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:31,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash 24981344, now seen corresponding path program 1 times [2024-10-14 17:48:31,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:31,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902192875] [2024-10-14 17:48:31,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:31,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:31,460 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:48:31,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:31,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902192875] [2024-10-14 17:48:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902192875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:31,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:48:31,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731016187] [2024-10-14 17:48:31,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:31,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:48:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:31,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:48:31,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:48:31,466 INFO L87 Difference]: Start difference. First operand 27 states and 32 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-10-14 17:48:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:31,551 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-10-14 17:48:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:48:31,551 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-10-14 17:48:31,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:31,553 INFO L225 Difference]: With dead ends: 43 [2024-10-14 17:48:31,553 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 17:48:31,553 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-10-14 17:48:31,554 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:31,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:31,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 17:48:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2024-10-14 17:48:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 29 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-10-14 17:48:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-10-14 17:48:31,557 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 7 [2024-10-14 17:48:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:31,557 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-14 17:48:31,557 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-10-14 17:48:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-10-14 17:48:31,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:48:31,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:31,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:31,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:48:31,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:31,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:31,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1189851798, now seen corresponding path program 1 times [2024-10-14 17:48:31,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:31,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380486844] [2024-10-14 17:48:31,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:31,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:31,600 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:48:31,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:31,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380486844] [2024-10-14 17:48:31,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380486844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:31,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:31,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:48:31,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562521421] [2024-10-14 17:48:31,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:31,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:48:31,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:31,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:48:31,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:31,602 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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:48:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:31,635 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2024-10-14 17:48:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:48:31,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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) Word has length 10 [2024-10-14 17:48:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:31,636 INFO L225 Difference]: With dead ends: 27 [2024-10-14 17:48:31,636 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 17:48:31,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:31,637 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:31,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 27 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 17:48:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 17:48:31,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 26 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-10-14 17:48:31,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-10-14 17:48:31,639 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2024-10-14 17:48:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:31,639 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-10-14 17:48:31,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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:48:31,639 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-10-14 17:48:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:48:31,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:31,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:31,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:48:31,640 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1189851799, now seen corresponding path program 1 times [2024-10-14 17:48:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258235574] [2024-10-14 17:48:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:31,782 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:48:31,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:31,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258235574] [2024-10-14 17:48:31,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258235574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:31,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:31,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:48:31,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34191987] [2024-10-14 17:48:31,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:31,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:48:31,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:31,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:48:31,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:48:31,787 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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:48:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:31,870 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-14 17:48:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:48:31,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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) Word has length 10 [2024-10-14 17:48:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:31,871 INFO L225 Difference]: With dead ends: 32 [2024-10-14 17:48:31,871 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 17:48:31,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:48:31,875 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:31,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 48 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 17:48:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 17:48:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 31 states have internal predecessors, (40), 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:48:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-14 17:48:31,877 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 10 [2024-10-14 17:48:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:31,878 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-14 17:48:31,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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:48:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-14 17:48:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 17:48:31,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:31,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:31,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:48:31,879 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1769368882, now seen corresponding path program 1 times [2024-10-14 17:48:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634658283] [2024-10-14 17:48:31,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:31,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:32,006 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:48:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:32,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634658283] [2024-10-14 17:48:32,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634658283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:32,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:32,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:48:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216471517] [2024-10-14 17:48:32,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:32,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:48:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:48:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:32,008 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 4 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-10-14 17:48:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:32,025 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-10-14 17:48:32,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:48:32,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-10-14 17:48:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:32,026 INFO L225 Difference]: With dead ends: 31 [2024-10-14 17:48:32,026 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 17:48:32,026 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-10-14 17:48:32,027 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:32,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 34 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 17:48:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 17:48:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 27 states have internal predecessors, (34), 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:48:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-14 17:48:32,029 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2024-10-14 17:48:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:32,029 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-14 17:48:32,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-10-14 17:48:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-14 17:48:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:48:32,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:32,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:32,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:48:32,030 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:32,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash 511244514, now seen corresponding path program 1 times [2024-10-14 17:48:32,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:32,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068528843] [2024-10-14 17:48:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:32,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:32,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068528843] [2024-10-14 17:48:32,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068528843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:32,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:32,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:48:32,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482839458] [2024-10-14 17:48:32,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:32,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:48:32,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:32,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:48:32,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:32,047 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:32,058 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-10-14 17:48:32,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:32,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-10-14 17:48:32,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:32,059 INFO L225 Difference]: With dead ends: 30 [2024-10-14 17:48:32,059 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 17:48:32,059 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-10-14 17:48:32,059 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 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-10-14 17:48:32,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 17:48:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 17:48:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 29 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-10-14 17:48:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-10-14 17:48:32,061 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 13 [2024-10-14 17:48:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:32,061 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-10-14 17:48:32,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:48:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-10-14 17:48:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:48:32,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:32,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:32,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:48:32,062 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:32,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:32,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1331438626, now seen corresponding path program 1 times [2024-10-14 17:48:32,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:32,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586702539] [2024-10-14 17:48:32,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:32,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:48:32,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:32,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586702539] [2024-10-14 17:48:32,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586702539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:32,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:32,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:48:32,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694484689] [2024-10-14 17:48:32,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:32,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:48:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:32,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:48:32,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:48:32,187 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:48:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:32,229 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-14 17:48:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:48:32,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-10-14 17:48:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:32,229 INFO L225 Difference]: With dead ends: 36 [2024-10-14 17:48:32,230 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 17:48:32,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:48:32,230 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:32,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 17:48:32,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 17:48:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 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:48:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-14 17:48:32,232 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 14 [2024-10-14 17:48:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:32,232 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-14 17:48:32,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:48:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-14 17:48:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:48:32,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:32,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:32,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:48:32,232 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:32,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1918244640, now seen corresponding path program 1 times [2024-10-14 17:48:32,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:32,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107166727] [2024-10-14 17:48:32,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:32,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:32,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107166727] [2024-10-14 17:48:32,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107166727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:32,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:32,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:48:32,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692836122] [2024-10-14 17:48:32,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:32,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:48:32,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:32,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:48:32,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:48:32,379 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:48:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:32,427 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-10-14 17:48:32,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:48:32,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-10-14 17:48:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:32,427 INFO L225 Difference]: With dead ends: 46 [2024-10-14 17:48:32,427 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 17:48:32,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:48:32,428 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:32,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 54 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 17:48:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-10-14 17:48:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-10-14 17:48:32,431 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 14 [2024-10-14 17:48:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:32,431 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-14 17:48:32,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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:48:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-10-14 17:48:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:48:32,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:32,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:32,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:48:32,432 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:32,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1660079202, now seen corresponding path program 1 times [2024-10-14 17:48:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797779053] [2024-10-14 17:48:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:32,636 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:48:32,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:32,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797779053] [2024-10-14 17:48:32,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797779053] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:48:32,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587919769] [2024-10-14 17:48:32,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:32,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:48:32,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:48:32,640 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:48:32,650 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:48:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:32,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 17:48:32,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:48:32,786 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-10-14 17:48:32,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:48:32,904 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 32 treesize of output 25 [2024-10-14 17:48:33,004 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:48:33,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:48:33,200 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-10-14 17:48:33,209 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-10-14 17:48:33,214 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 14 treesize of output 12 [2024-10-14 17:48:33,253 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:48:33,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587919769] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:48:33,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:48:33,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-10-14 17:48:33,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767742930] [2024-10-14 17:48:33,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:48:33,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 17:48:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:33,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 17:48:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:48:33,257 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 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:48:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:33,616 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-10-14 17:48:33,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 17:48:33,617 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 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-10-14 17:48:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:33,618 INFO L225 Difference]: With dead ends: 49 [2024-10-14 17:48:33,618 INFO L226 Difference]: Without dead ends: 49 [2024-10-14 17:48:33,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2024-10-14 17:48:33,619 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 83 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:33,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 52 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-14 17:48:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2024-10-14 17:48:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 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:48:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-14 17:48:33,625 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 14 [2024-10-14 17:48:33,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:33,625 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-14 17:48:33,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 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:48:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-10-14 17:48:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:48:33,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:33,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:33,641 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:48:33,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 17:48:33,832 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:33,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash 668551230, now seen corresponding path program 1 times [2024-10-14 17:48:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:33,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707517880] [2024-10-14 17:48:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:33,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:34,057 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:48:34,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:34,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707517880] [2024-10-14 17:48:34,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707517880] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:48:34,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040321963] [2024-10-14 17:48:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:34,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:48:34,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:48:34,060 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:48:34,067 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:48:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:34,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 17:48:34,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:48:34,135 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-10-14 17:48:34,287 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:48:34,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2024-10-14 17:48:34,374 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:48:34,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:48:34,538 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-10-14 17:48:34,543 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-10-14 17:48:34,549 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 5 treesize of output 3 [2024-10-14 17:48:34,555 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:48:34,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040321963] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:48:34,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:48:34,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 21 [2024-10-14 17:48:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649481878] [2024-10-14 17:48:34,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:48:34,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 17:48:34,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 17:48:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2024-10-14 17:48:34,557 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 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:48:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:35,073 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-10-14 17:48:35,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 17:48:35,074 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 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 15 [2024-10-14 17:48:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:35,074 INFO L225 Difference]: With dead ends: 59 [2024-10-14 17:48:35,074 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 17:48:35,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 17:48:35,075 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 51 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:35,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 63 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:48:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 17:48:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2024-10-14 17:48:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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-10-14 17:48:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-14 17:48:35,080 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2024-10-14 17:48:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:35,080 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-14 17:48:35,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 22 states have internal predecessors, (37), 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:48:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-14 17:48:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 17:48:35,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:35,081 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:35,107 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:48:35,281 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,SelfDestructingSolverStorable15 [2024-10-14 17:48:35,282 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-14 17:48:35,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:35,282 INFO L85 PathProgramCache]: Analyzing trace with hash 679444837, now seen corresponding path program 2 times [2024-10-14 17:48:35,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:35,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561429993] [2024-10-14 17:48:35,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:35,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:35,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561429993] [2024-10-14 17:48:35,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561429993] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:48:35,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057992146] [2024-10-14 17:48:35,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:48:35,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:48:35,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:48:35,843 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:48:35,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:48:35,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:48:35,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:48:35,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-14 17:48:35,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:48:35,967 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-10-14 17:48:36,361 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-10-14 17:48:36,361 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 42 treesize of output 33 [2024-10-14 17:48:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:36,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:48:36,639 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-10-14 17:48:36,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:48:36,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2024-10-14 17:48:36,652 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-10-14 17:48:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:36,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057992146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:48:36,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:48:36,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-10-14 17:48:36,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068330979] [2024-10-14 17:48:36,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:48:36,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 17:48:36,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:36,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 17:48:36,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2024-10-14 17:48:36,702 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:38,191 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-10-14 17:48:38,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 17:48:38,192 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-14 17:48:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:38,192 INFO L225 Difference]: With dead ends: 31 [2024-10-14 17:48:38,192 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 17:48:38,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2024-10-14 17:48:38,193 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 88 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:38,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 52 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 17:48:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 17:48:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 17:48:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 17:48:38,193 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2024-10-14 17:48:38,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:38,194 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 17:48:38,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 17:48:38,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 17:48:38,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2024-10-14 17:48:38,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2024-10-14 17:48:38,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2024-10-14 17:48:38,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2024-10-14 17:48:38,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-10-14 17:48:38,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-10-14 17:48:38,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2024-10-14 17:48:38,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-10-14 17:48:38,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-10-14 17:48:38,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2024-10-14 17:48:38,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-10-14 17:48:38,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-10-14 17:48:38,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2024-10-14 17:48:38,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-10-14 17:48:38,197 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2024-10-14 17:48:38,210 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-10-14 17:48:38,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:48:38,400 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:38,402 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:48:38,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:48:38 BoogieIcfgContainer [2024-10-14 17:48:38,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:48:38,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:48:38,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:48:38,404 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:48:38,404 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:48:29" (3/4) ... [2024-10-14 17:48:38,405 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:48:38,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-14 17:48:38,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 17:48:38,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 17:48:38,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:48:38,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:48:38,478 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:48:38,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:48:38,479 INFO L158 Benchmark]: Toolchain (without parser) took 9930.28ms. Allocated memory was 176.2MB in the beginning and 312.5MB in the end (delta: 136.3MB). Free memory was 106.3MB in the beginning and 137.1MB in the end (delta: -30.8MB). Peak memory consumption was 107.5MB. Max. memory is 16.1GB. [2024-10-14 17:48:38,479 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory was 134.5MB in the beginning and 134.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:48:38,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.44ms. Allocated memory is still 176.2MB. Free memory was 106.0MB in the beginning and 139.9MB in the end (delta: -33.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-10-14 17:48:38,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.82ms. Allocated memory is still 176.2MB. Free memory was 139.9MB in the beginning and 137.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:48:38,480 INFO L158 Benchmark]: Boogie Preprocessor took 33.17ms. Allocated memory is still 176.2MB. Free memory was 137.8MB in the beginning and 135.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:48:38,480 INFO L158 Benchmark]: RCFGBuilder took 568.83ms. Allocated memory is still 176.2MB. Free memory was 135.7MB in the beginning and 117.7MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 17:48:38,480 INFO L158 Benchmark]: TraceAbstraction took 8868.12ms. Allocated memory was 176.2MB in the beginning and 312.5MB in the end (delta: 136.3MB). Free memory was 116.8MB in the beginning and 141.8MB in the end (delta: -25.0MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2024-10-14 17:48:38,480 INFO L158 Benchmark]: Witness Printer took 74.34ms. Allocated memory is still 312.5MB. Free memory was 141.8MB in the beginning and 137.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:48:38,486 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.14ms. Allocated memory is still 176.2MB. Free memory was 134.5MB in the beginning and 134.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.44ms. Allocated memory is still 176.2MB. Free memory was 106.0MB in the beginning and 139.9MB in the end (delta: -33.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.82ms. Allocated memory is still 176.2MB. Free memory was 139.9MB in the beginning and 137.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.17ms. Allocated memory is still 176.2MB. Free memory was 137.8MB in the beginning and 135.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 568.83ms. Allocated memory is still 176.2MB. Free memory was 135.7MB in the beginning and 117.7MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8868.12ms. Allocated memory was 176.2MB in the beginning and 312.5MB in the end (delta: 136.3MB). Free memory was 116.8MB in the beginning and 141.8MB in the end (delta: -25.0MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. * Witness Printer took 74.34ms. Allocated memory is still 312.5MB. Free memory was 141.8MB in the beginning and 137.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: 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, 34 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 898 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 599 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1430 IncrementalHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 299 mSDtfsCounter, 1430 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=14, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 237 ConstructedInterpolants, 17 QuantifiedInterpolants, 2477 SizeOfPredicates, 25 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 23 InterpolantComputations, 14 PerfectInterpolantSequences, 4/27 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 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:48:38,511 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