./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-15/cstrlen_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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-15/cstrlen_reverse_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 168748c0c54c019ef253d55ab380d3a197e2401ba990ef8210cb41b73a41cb13 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:35:45,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:35:45,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-13 10:35:45,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:35:45,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:35:45,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:35:45,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:35:45,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:35:45,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:35:45,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:35:45,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:35:45,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:35:45,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:35:45,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:35:45,746 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:35:45,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:35:45,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:35:45,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:35:45,748 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:35:45,748 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:35:45,748 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:35:45,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:35:45,749 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:35:45,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:35:45,750 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:35:45,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:35:45,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:35:45,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:35:45,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:35:45,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:35:45,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:35:45,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:35:45,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:35:45,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:35:45,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:35:45,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:35:45,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:35:45,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:35:45,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:35:45,754 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 -> 168748c0c54c019ef253d55ab380d3a197e2401ba990ef8210cb41b73a41cb13 [2024-10-13 10:35:46,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:35:46,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:35:46,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:35:46,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:35:46,046 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:35:46,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrlen_reverse_alloca.i [2024-10-13 10:35:47,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:35:47,795 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:35:47,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrlen_reverse_alloca.i [2024-10-13 10:35:47,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31c24289/97ff2f51bf1045dba0721f6ad31a1de3/FLAG7a3bd2771 [2024-10-13 10:35:47,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e31c24289/97ff2f51bf1045dba0721f6ad31a1de3 [2024-10-13 10:35:47,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:35:47,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:35:47,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:35:47,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:35:47,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:35:47,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:35:47" (1/1) ... [2024-10-13 10:35:47,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5488c484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:47, skipping insertion in model container [2024-10-13 10:35:47,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:35:47" (1/1) ... [2024-10-13 10:35:47,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:35:48,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:35:48,206 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:35:48,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:35:48,292 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:35:48,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48 WrapperNode [2024-10-13 10:35:48,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:35:48,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:35:48,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:35:48,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:35:48,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,315 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,340 INFO L138 Inliner]: procedures = 152, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37 [2024-10-13 10:35:48,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:35:48,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:35:48,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:35:48,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:35:48,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,367 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-10-13 10:35:48,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:35:48,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:35:48,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:35:48,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:35:48,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (1/1) ... [2024-10-13 10:35:48,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:35:48,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:35:48,422 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-13 10:35:48,428 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-13 10:35:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:35:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:35:48,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:35:48,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:35:48,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:35:48,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:35:48,542 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:35:48,544 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:35:48,678 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-13 10:35:48,678 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:35:48,712 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:35:48,712 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 10:35:48,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:35:48 BoogieIcfgContainer [2024-10-13 10:35:48,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:35:48,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:35:48,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:35:48,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:35:48,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:35:47" (1/3) ... [2024-10-13 10:35:48,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62242fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:35:48, skipping insertion in model container [2024-10-13 10:35:48,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:35:48" (2/3) ... [2024-10-13 10:35:48,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62242fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:35:48, skipping insertion in model container [2024-10-13 10:35:48,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:35:48" (3/3) ... [2024-10-13 10:35:48,722 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrlen_reverse_alloca.i [2024-10-13 10:35:48,737 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:35:48,738 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-13 10:35:48,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:35:48,789 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;@b4899ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:35:48,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-13 10:35:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 8 states have (on average 2.0) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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-13 10:35:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:35:48,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:48,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:35:48,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:48,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2001092, now seen corresponding path program 1 times [2024-10-13 10:35:48,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:48,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281559641] [2024-10-13 10:35:48,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:48,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:49,023 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-13 10:35:49,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:49,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281559641] [2024-10-13 10:35:49,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281559641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:49,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:49,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:35:49,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009956936] [2024-10-13 10:35:49,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:49,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:35:49,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:49,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:35:49,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:35:49,057 INFO L87 Difference]: Start difference. First operand has 14 states, 8 states have (on average 2.0) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:49,086 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-10-13 10:35:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:35:49,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 10:35:49,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:49,096 INFO L225 Difference]: With dead ends: 13 [2024-10-13 10:35:49,096 INFO L226 Difference]: Without dead ends: 12 [2024-10-13 10:35:49,098 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-13 10:35:49,103 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:49,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-13 10:35:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-13 10:35:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.625) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-10-13 10:35:49,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 4 [2024-10-13 10:35:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:49,154 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-10-13 10:35:49,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-10-13 10:35:49,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:35:49,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:49,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:35:49,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:35:49,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:49,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2001093, now seen corresponding path program 1 times [2024-10-13 10:35:49,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:49,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496752885] [2024-10-13 10:35:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:49,433 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-13 10:35:49,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:49,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496752885] [2024-10-13 10:35:49,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496752885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:49,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:49,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:35:49,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376130447] [2024-10-13 10:35:49,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:49,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:35:49,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:49,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:35:49,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:35:49,437 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:49,486 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-10-13 10:35:49,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:35:49,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 10:35:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:49,487 INFO L225 Difference]: With dead ends: 14 [2024-10-13 10:35:49,487 INFO L226 Difference]: Without dead ends: 14 [2024-10-13 10:35:49,488 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-13 10:35:49,489 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 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-13 10:35:49,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:49,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-13 10:35:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-13 10:35:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-13 10:35:49,493 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 4 [2024-10-13 10:35:49,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:49,493 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-13 10:35:49,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-13 10:35:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:35:49,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:49,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:35:49,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:35:49,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:49,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:49,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2003015, now seen corresponding path program 1 times [2024-10-13 10:35:49,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:49,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064268480] [2024-10-13 10:35:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:49,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:49,697 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-13 10:35:49,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:49,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064268480] [2024-10-13 10:35:49,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064268480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:49,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:49,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:35:49,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719668091] [2024-10-13 10:35:49,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:49,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:35:49,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:49,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:35:49,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:35:49,701 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:49,750 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-10-13 10:35:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:35:49,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 10:35:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:49,751 INFO L225 Difference]: With dead ends: 13 [2024-10-13 10:35:49,751 INFO L226 Difference]: Without dead ends: 13 [2024-10-13 10:35:49,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:35:49,752 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:49,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-13 10:35:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2024-10-13 10:35:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-10-13 10:35:49,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 4 [2024-10-13 10:35:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:49,758 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-10-13 10:35:49,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-10-13 10:35:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:35:49,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:49,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:35:49,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:35:49,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:49,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:49,763 INFO L85 PathProgramCache]: Analyzing trace with hash 62034708, now seen corresponding path program 1 times [2024-10-13 10:35:49,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:49,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267946385] [2024-10-13 10:35:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:49,810 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-13 10:35:49,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:49,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267946385] [2024-10-13 10:35:49,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267946385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:49,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:49,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:35:49,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350038348] [2024-10-13 10:35:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:49,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:35:49,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:49,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:35:49,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:35:49,813 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. 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-13 10:35:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:49,838 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2024-10-13 10:35:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:35:49,838 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-13 10:35:49,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:49,839 INFO L225 Difference]: With dead ends: 10 [2024-10-13 10:35:49,840 INFO L226 Difference]: Without dead ends: 10 [2024-10-13 10:35:49,840 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-13 10:35:49,841 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:49,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:49,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-10-13 10:35:49,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-13 10:35:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-13 10:35:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-10-13 10:35:49,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2024-10-13 10:35:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:49,847 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-10-13 10:35:49,847 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-13 10:35:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2024-10-13 10:35:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:35:49,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:49,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:35:49,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:35:49,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:49,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash 62034709, now seen corresponding path program 1 times [2024-10-13 10:35:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:49,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540909011] [2024-10-13 10:35:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:49,959 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-13 10:35:49,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:49,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540909011] [2024-10-13 10:35:49,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540909011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:49,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:49,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:35:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051010571] [2024-10-13 10:35:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:49,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:35:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:35:49,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:35:49,962 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:49,997 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-10-13 10:35:49,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:35:49,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 10:35:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:49,999 INFO L225 Difference]: With dead ends: 13 [2024-10-13 10:35:49,999 INFO L226 Difference]: Without dead ends: 13 [2024-10-13 10:35:49,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:35:50,000 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:50,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-13 10:35:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-13 10:35:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 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-13 10:35:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-10-13 10:35:50,007 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 5 [2024-10-13 10:35:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:50,007 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-13 10:35:50,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-10-13 10:35:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:35:50,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:50,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:35:50,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:35:50,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:50,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash 62094291, now seen corresponding path program 1 times [2024-10-13 10:35:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:50,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921759843] [2024-10-13 10:35:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:50,220 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-13 10:35:50,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:50,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921759843] [2024-10-13 10:35:50,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921759843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:50,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:50,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:35:50,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972068666] [2024-10-13 10:35:50,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:50,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:35:50,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:50,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:35:50,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:35:50,222 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:50,256 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-10-13 10:35:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:35:50,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 10:35:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:50,257 INFO L225 Difference]: With dead ends: 14 [2024-10-13 10:35:50,257 INFO L226 Difference]: Without dead ends: 14 [2024-10-13 10:35:50,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:35:50,259 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:50,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-13 10:35:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2024-10-13 10:35:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-10-13 10:35:50,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 5 [2024-10-13 10:35:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:50,262 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-10-13 10:35:50,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-10-13 10:35:50,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:35:50,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:50,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:35:50,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:35:50,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:50,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash -514187922, now seen corresponding path program 1 times [2024-10-13 10:35:50,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:50,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819250871] [2024-10-13 10:35:50,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:50,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:50,502 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-13 10:35:50,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:50,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819250871] [2024-10-13 10:35:50,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819250871] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:35:50,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190783264] [2024-10-13 10:35:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:50,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:35:50,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:35:50,517 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-13 10:35:50,518 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-13 10:35:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:50,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:35:50,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:35:50,647 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 11 treesize of output 7 [2024-10-13 10:35:50,680 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-13 10:35:50,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:35:50,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190783264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:50,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:35:50,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-13 10:35:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759440026] [2024-10-13 10:35:50,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:50,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:35:50,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:50,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:35:50,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:35:50,683 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-13 10:35:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:50,726 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2024-10-13 10:35:50,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:35:50,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-13 10:35:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:50,730 INFO L225 Difference]: With dead ends: 16 [2024-10-13 10:35:50,730 INFO L226 Difference]: Without dead ends: 16 [2024-10-13 10:35:50,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:35:50,731 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 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.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:50,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-13 10:35:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-10-13 10:35:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 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-13 10:35:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-10-13 10:35:50,735 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 7 [2024-10-13 10:35:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:50,735 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-13 10:35:50,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-13 10:35:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-10-13 10:35:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:35:50,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:50,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:35:50,757 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-13 10:35:50,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:35:50,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:50,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:50,944 INFO L85 PathProgramCache]: Analyzing trace with hash -456929620, now seen corresponding path program 1 times [2024-10-13 10:35:50,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:50,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086925452] [2024-10-13 10:35:50,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:50,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:51,103 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-13 10:35:51,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:51,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086925452] [2024-10-13 10:35:51,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086925452] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:35:51,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966284990] [2024-10-13 10:35:51,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:51,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:35:51,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:35:51,107 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-13 10:35:51,108 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-13 10:35:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:51,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 10:35:51,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:35:51,172 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 11 treesize of output 7 [2024-10-13 10:35:51,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:35:51,216 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 15 treesize of output 15 [2024-10-13 10:35:51,246 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-13 10:35:51,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:35:51,308 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-13 10:35:51,317 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 10 treesize of output 8 [2024-10-13 10:35:51,322 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-13 10:35:51,326 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-13 10:35:51,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966284990] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:35:51,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:35:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-13 10:35:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405524830] [2024-10-13 10:35:51,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:35:51,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:35:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:51,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:35:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:35:51,331 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:51,449 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-10-13 10:35:51,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:35:51,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 10:35:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:51,450 INFO L225 Difference]: With dead ends: 16 [2024-10-13 10:35:51,451 INFO L226 Difference]: Without dead ends: 16 [2024-10-13 10:35:51,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:35:51,454 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:51,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 24 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-13 10:35:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2024-10-13 10:35:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-13 10:35:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-10-13 10:35:51,458 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 7 [2024-10-13 10:35:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:51,460 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-13 10:35:51,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:35:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-10-13 10:35:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:35:51,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:35:51,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:35:51,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:35:51,661 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,SelfDestructingSolverStorable7 [2024-10-13 10:35:51,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2024-10-13 10:35:51,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:35:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1240042302, now seen corresponding path program 1 times [2024-10-13 10:35:51,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:35:51,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075617329] [2024-10-13 10:35:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:35:51,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:35:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:35:51,749 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-13 10:35:51,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:35:51,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075617329] [2024-10-13 10:35:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075617329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:35:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:35:51,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:35:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145945189] [2024-10-13 10:35:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:35:51,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:35:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:35:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:35:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:35:51,754 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-13 10:35:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:35:51,764 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2024-10-13 10:35:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:35:51,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-13 10:35:51,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:35:51,765 INFO L225 Difference]: With dead ends: 12 [2024-10-13 10:35:51,765 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 10:35:51,765 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-13 10:35:51,765 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:35:51,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:35:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 10:35:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 10:35:51,766 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-13 10:35:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 10:35:51,766 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2024-10-13 10:35:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:35:51,767 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 10:35:51,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-13 10:35:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 10:35:51,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 10:35:51,770 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 5 remaining) [2024-10-13 10:35:51,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2024-10-13 10:35:51,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2024-10-13 10:35:51,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2024-10-13 10:35:51,771 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-10-13 10:35:51,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:35:51,775 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:35:51,777 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:35:51,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:35:51 BoogieIcfgContainer [2024-10-13 10:35:51,780 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:35:51,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:35:51,781 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:35:51,781 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:35:51,782 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:35:48" (3/4) ... [2024-10-13 10:35:51,784 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:35:51,791 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 10:35:51,791 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 10:35:51,791 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 10:35:51,791 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 10:35:51,880 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:35:51,881 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:35:51,881 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:35:51,882 INFO L158 Benchmark]: Toolchain (without parser) took 4060.03ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 101.7MB in the beginning and 103.0MB in the end (delta: -1.3MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2024-10-13 10:35:51,882 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:35:51,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.21ms. Allocated memory is still 159.4MB. Free memory was 101.7MB in the beginning and 82.1MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 10:35:51,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.74ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 80.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:35:51,882 INFO L158 Benchmark]: Boogie Preprocessor took 39.71ms. Allocated memory is still 159.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:35:51,883 INFO L158 Benchmark]: RCFGBuilder took 330.44ms. Allocated memory is still 159.4MB. Free memory was 78.0MB in the beginning and 65.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 10:35:51,883 INFO L158 Benchmark]: TraceAbstraction took 3065.80ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 64.6MB in the beginning and 107.2MB in the end (delta: -42.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-10-13 10:35:51,883 INFO L158 Benchmark]: Witness Printer took 99.99ms. Allocated memory is still 222.3MB. Free memory was 107.2MB in the beginning and 103.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:35:51,884 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.21ms. Allocated memory is still 159.4MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.21ms. Allocated memory is still 159.4MB. Free memory was 101.7MB in the beginning and 82.1MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.74ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 80.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.71ms. Allocated memory is still 159.4MB. Free memory was 80.1MB in the beginning and 78.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 330.44ms. Allocated memory is still 159.4MB. Free memory was 78.0MB in the beginning and 65.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3065.80ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 64.6MB in the beginning and 107.2MB in the end (delta: -42.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Witness Printer took 99.99ms. Allocated memory is still 222.3MB. Free memory was 107.2MB in the beginning and 103.0MB in the end (delta: 4.2MB). 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: 371]: 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, 14 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 196 IncrementalHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 50 mSDtfsCounter, 196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 360 SizeOfPredicates, 9 NumberOfNonLiveVariables, 112 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 1/5 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 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 10:35:51,914 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