./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/cstrcmp_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 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/cstrcmp_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 956a7be0aa4123ddc345c58470e6c6f0d648bcd1784c1fbfd2df8e05f06ac7cd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:32:15,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:32:15,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-20 14:32:15,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:32:15,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:32:15,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:32:15,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:32:15,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:32:15,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:32:15,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:32:15,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:32:15,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:32:15,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:32:15,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:32:15,524 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:32:15,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:32:15,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:32:15,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:32:15,525 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:32:15,525 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:32:15,525 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:32:15,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:32:15,529 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:32:15,529 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:32:15,529 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:32:15,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:32:15,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:32:15,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:32:15,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:32:15,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:32:15,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:32:15,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:32:15,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:32:15,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:32:15,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:32:15,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:32:15,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:32:15,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:32:15,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:32:15,532 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 -> 956a7be0aa4123ddc345c58470e6c6f0d648bcd1784c1fbfd2df8e05f06ac7cd [2024-11-20 14:32:15,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:32:15,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:32:15,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:32:15,834 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:32:15,835 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:32:15,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcmp_reverse_alloca.i [2024-11-20 14:32:17,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:32:17,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:32:17,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcmp_reverse_alloca.i [2024-11-20 14:32:17,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eeabda92/0afdc4b020a9424386c079a47564af9b/FLAG1d304b7b2 [2024-11-20 14:32:17,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eeabda92/0afdc4b020a9424386c079a47564af9b [2024-11-20 14:32:17,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:32:17,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:32:17,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:32:17,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:32:17,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:32:17,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:17,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b742a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17, skipping insertion in model container [2024-11-20 14:32:17,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:17,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:32:17,825 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:32:17,826 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:32:17,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:32:17,843 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:32:17,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:32:17,936 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:32:17,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17 WrapperNode [2024-11-20 14:32:17,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:32:17,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:32:17,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:32:17,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:32:17,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:17,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:17,992 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-11-20 14:32:17,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:32:17,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:32:17,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:32:17,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:32:18,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:18,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:18,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:18,029 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-20 14:32:18,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:18,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:18,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:18,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:18,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:18,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:18,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:32:18,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:32:18,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:32:18,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:32:18,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (1/1) ... [2024-11-20 14:32:18,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:32:18,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:18,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 14:32:18,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 14:32:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 14:32:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 14:32:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 14:32:18,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 14:32:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 14:32:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:32:18,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:32:18,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:32:18,260 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:32:18,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:32:18,481 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-20 14:32:18,482 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:32:18,493 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:32:18,493 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 14:32:18,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:32:18 BoogieIcfgContainer [2024-11-20 14:32:18,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:32:18,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:32:18,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:32:18,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:32:18,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:32:17" (1/3) ... [2024-11-20 14:32:18,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd6eea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:32:18, skipping insertion in model container [2024-11-20 14:32:18,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:17" (2/3) ... [2024-11-20 14:32:18,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd6eea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:32:18, skipping insertion in model container [2024-11-20 14:32:18,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:32:18" (3/3) ... [2024-11-20 14:32:18,501 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcmp_reverse_alloca.i [2024-11-20 14:32:18,515 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:32:18,515 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-20 14:32:18,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:32:18,555 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;@1cfcefc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:32:18,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-20 14:32:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:32:18,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:18,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:32:18,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:18,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2024-11-20 14:32:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317270867] [2024-11-20 14:32:18,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:18,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:18,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317270867] [2024-11-20 14:32:18,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317270867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:18,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:18,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:32:18,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937622528] [2024-11-20 14:32:18,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:18,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:32:18,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:18,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:32:18,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:32:18,968 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 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 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:19,021 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-20 14:32:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:32:19,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:32:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:19,031 INFO L225 Difference]: With dead ends: 37 [2024-11-20 14:32:19,031 INFO L226 Difference]: Without dead ends: 35 [2024-11-20 14:32:19,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:32:19,036 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:19,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 53 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-20 14:32:19,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-20 14:32:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-20 14:32:19,067 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 6 [2024-11-20 14:32:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:19,067 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-20 14:32:19,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-20 14:32:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:32:19,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:19,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:32:19,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:32:19,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:19,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2024-11-20 14:32:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:19,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397883552] [2024-11-20 14:32:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:19,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:19,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397883552] [2024-11-20 14:32:19,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397883552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:19,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:19,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:32:19,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302156948] [2024-11-20 14:32:19,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:19,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:32:19,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:19,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:32:19,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:19,314 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:19,389 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-20 14:32:19,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:32:19,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:32:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:19,391 INFO L225 Difference]: With dead ends: 42 [2024-11-20 14:32:19,391 INFO L226 Difference]: Without dead ends: 42 [2024-11-20 14:32:19,392 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-11-20 14:32:19,393 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:19,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 87 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-20 14:32:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-20 14:32:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.75) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-20 14:32:19,401 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 6 [2024-11-20 14:32:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:19,401 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-20 14:32:19,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-20 14:32:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:32:19,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:19,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:32:19,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:32:19,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:19,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:19,406 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2024-11-20 14:32:19,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:19,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126780482] [2024-11-20 14:32:19,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:19,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:19,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:19,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126780482] [2024-11-20 14:32:19,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126780482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:19,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:19,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:32:19,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046185124] [2024-11-20 14:32:19,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:19,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:32:19,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:19,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:32:19,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:32:19,602 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:19,668 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-20 14:32:19,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:32:19,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:32:19,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:19,669 INFO L225 Difference]: With dead ends: 37 [2024-11-20 14:32:19,669 INFO L226 Difference]: Without dead ends: 37 [2024-11-20 14:32:19,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-20 14:32:19,670 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:19,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 100 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-20 14:32:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-11-20 14:32:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-20 14:32:19,679 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 6 [2024-11-20 14:32:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:19,680 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-20 14:32:19,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-20 14:32:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:32:19,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:19,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:19,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:32:19,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:19,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2024-11-20 14:32:19,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:19,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326344630] [2024-11-20 14:32:19,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:19,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326344630] [2024-11-20 14:32:19,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326344630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:19,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:19,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:32:19,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381675832] [2024-11-20 14:32:19,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:19,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:32:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:19,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:32:19,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:32:19,733 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:19,791 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-20 14:32:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:32:19,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-20 14:32:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:19,793 INFO L225 Difference]: With dead ends: 33 [2024-11-20 14:32:19,794 INFO L226 Difference]: Without dead ends: 33 [2024-11-20 14:32:19,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:32:19,795 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:19,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-20 14:32:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-20 14:32:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-20 14:32:19,802 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 7 [2024-11-20 14:32:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:19,803 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-20 14:32:19,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-20 14:32:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:32:19,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:19,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:19,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:32:19,805 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:19,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:19,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2024-11-20 14:32:19,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:19,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915902183] [2024-11-20 14:32:19,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:19,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:19,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:19,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915902183] [2024-11-20 14:32:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915902183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:19,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:19,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:32:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841380688] [2024-11-20 14:32:19,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:19,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:32:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:32:19,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:19,973 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:20,031 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-20 14:32:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:32:20,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-20 14:32:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:20,032 INFO L225 Difference]: With dead ends: 37 [2024-11-20 14:32:20,033 INFO L226 Difference]: Without dead ends: 37 [2024-11-20 14:32:20,033 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-11-20 14:32:20,034 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:20,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 83 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-20 14:32:20,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-11-20 14:32:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.625) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-20 14:32:20,042 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 7 [2024-11-20 14:32:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:20,042 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-20 14:32:20,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-20 14:32:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:32:20,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:20,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:20,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:32:20,046 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:20,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088457, now seen corresponding path program 1 times [2024-11-20 14:32:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:20,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865627442] [2024-11-20 14:32:20,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:20,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:20,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:20,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865627442] [2024-11-20 14:32:20,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865627442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:20,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:20,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:32:20,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135340757] [2024-11-20 14:32:20,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:20,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:32:20,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:20,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:32:20,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:32:20,153 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 5 states, 4 states have (on average 1.75) 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-11-20 14:32:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:20,201 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-20 14:32:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:32:20,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) 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-11-20 14:32:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:20,204 INFO L225 Difference]: With dead ends: 35 [2024-11-20 14:32:20,204 INFO L226 Difference]: Without dead ends: 35 [2024-11-20 14:32:20,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-20 14:32:20,205 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:20,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 101 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-20 14:32:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-20 14:32:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-20 14:32:20,211 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 7 [2024-11-20 14:32:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:20,211 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-20 14:32:20,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) 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-11-20 14:32:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-20 14:32:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:32:20,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:20,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:20,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:32:20,212 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:20,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash -534039921, now seen corresponding path program 1 times [2024-11-20 14:32:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:20,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17614288] [2024-11-20 14:32:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17614288] [2024-11-20 14:32:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17614288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:32:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428621764] [2024-11-20 14:32:20,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:20,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:32:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:20,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:32:20,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:20,269 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:20,312 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-11-20 14:32:20,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:32:20,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:32:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:20,314 INFO L225 Difference]: With dead ends: 29 [2024-11-20 14:32:20,315 INFO L226 Difference]: Without dead ends: 29 [2024-11-20 14:32:20,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:20,316 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:20,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 40 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-20 14:32:20,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-20 14:32:20,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-20 14:32:20,322 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 9 [2024-11-20 14:32:20,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:20,323 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-20 14:32:20,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-20 14:32:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:32:20,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:20,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:20,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:32:20,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:20,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:20,324 INFO L85 PathProgramCache]: Analyzing trace with hash -534039920, now seen corresponding path program 1 times [2024-11-20 14:32:20,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:20,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391278863] [2024-11-20 14:32:20,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:20,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:20,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:20,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391278863] [2024-11-20 14:32:20,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391278863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:20,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:20,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:32:20,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449276909] [2024-11-20 14:32:20,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:20,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:32:20,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:20,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:32:20,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:32:20,460 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:20,527 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-20 14:32:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:32:20,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:32:20,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:20,529 INFO L225 Difference]: With dead ends: 33 [2024-11-20 14:32:20,529 INFO L226 Difference]: Without dead ends: 33 [2024-11-20 14:32:20,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:32:20,530 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:20,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 81 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:32:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-20 14:32:20,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-20 14:32:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-20 14:32:20,537 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 9 [2024-11-20 14:32:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:20,537 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-20 14:32:20,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-20 14:32:20,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:32:20,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:20,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:20,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:32:20,538 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:20,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1240967442, now seen corresponding path program 1 times [2024-11-20 14:32:20,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:20,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591913650] [2024-11-20 14:32:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:20,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:20,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:20,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591913650] [2024-11-20 14:32:20,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591913650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:20,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:20,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:32:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844434041] [2024-11-20 14:32:20,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:20,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:32:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:20,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:32:20,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:32:20,770 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:20,808 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-20 14:32:20,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:32:20,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:32:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:20,809 INFO L225 Difference]: With dead ends: 34 [2024-11-20 14:32:20,809 INFO L226 Difference]: Without dead ends: 34 [2024-11-20 14:32:20,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:32:20,810 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:20,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:20,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-20 14:32:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2024-11-20 14:32:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-20 14:32:20,813 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 9 [2024-11-20 14:32:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:20,813 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-20 14:32:20,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-20 14:32:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:32:20,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:20,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:20,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:32:20,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:20,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:20,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1692311851, now seen corresponding path program 1 times [2024-11-20 14:32:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:20,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049018907] [2024-11-20 14:32:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:20,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:20,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049018907] [2024-11-20 14:32:20,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049018907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:20,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:20,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:32:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096249549] [2024-11-20 14:32:20,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:20,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:32:20,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:20,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:32:20,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:20,858 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:20,891 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-11-20 14:32:20,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:32:20,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 14:32:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:20,892 INFO L225 Difference]: With dead ends: 26 [2024-11-20 14:32:20,892 INFO L226 Difference]: Without dead ends: 26 [2024-11-20 14:32:20,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:20,893 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:20,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 34 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-20 14:32:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-20 14:32:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-20 14:32:20,898 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 13 [2024-11-20 14:32:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:20,898 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-20 14:32:20,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-20 14:32:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:32:20,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:20,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:20,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:32:20,899 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:20,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:20,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1692311850, now seen corresponding path program 1 times [2024-11-20 14:32:20,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:20,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190906673] [2024-11-20 14:32:20,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:20,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:21,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:21,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190906673] [2024-11-20 14:32:21,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190906673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:21,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:21,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:32:21,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244517102] [2024-11-20 14:32:21,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:21,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:32:21,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:21,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:32:21,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:32:21,063 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:21,124 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-20 14:32:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:32:21,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 14:32:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:21,125 INFO L225 Difference]: With dead ends: 39 [2024-11-20 14:32:21,127 INFO L226 Difference]: Without dead ends: 39 [2024-11-20 14:32:21,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:32:21,128 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:21,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 60 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-20 14:32:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-20 14:32:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-20 14:32:21,133 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2024-11-20 14:32:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:21,135 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-20 14:32:21,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-20 14:32:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:32:21,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:21,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:21,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:32:21,136 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:21,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1692302777, now seen corresponding path program 1 times [2024-11-20 14:32:21,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:21,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748744420] [2024-11-20 14:32:21,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:21,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:21,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:21,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748744420] [2024-11-20 14:32:21,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748744420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:21,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:21,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:32:21,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485019397] [2024-11-20 14:32:21,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:21,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:32:21,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:21,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:32:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:32:21,168 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:21,179 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-20 14:32:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:32:21,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 14:32:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:21,181 INFO L225 Difference]: With dead ends: 40 [2024-11-20 14:32:21,182 INFO L226 Difference]: Without dead ends: 40 [2024-11-20 14:32:21,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:32:21,183 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:21,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-20 14:32:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-20 14:32:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-20 14:32:21,186 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 13 [2024-11-20 14:32:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:21,187 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-20 14:32:21,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-20 14:32:21,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:32:21,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:21,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:21,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 14:32:21,189 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:21,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:21,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2085338860, now seen corresponding path program 1 times [2024-11-20 14:32:21,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:21,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640530370] [2024-11-20 14:32:21,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:21,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:21,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640530370] [2024-11-20 14:32:21,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640530370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:21,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:21,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:32:21,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778650902] [2024-11-20 14:32:21,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:21,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:32:21,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:21,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:32:21,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:32:21,369 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:21,413 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-11-20 14:32:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:32:21,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 14:32:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:21,415 INFO L225 Difference]: With dead ends: 48 [2024-11-20 14:32:21,415 INFO L226 Difference]: Without dead ends: 48 [2024-11-20 14:32:21,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-20 14:32:21,416 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:21,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 55 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-20 14:32:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2024-11-20 14:32:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-20 14:32:21,418 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 13 [2024-11-20 14:32:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:21,419 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-20 14:32:21,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-20 14:32:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:32:21,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:21,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:21,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:32:21,420 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:21,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1336222527, now seen corresponding path program 1 times [2024-11-20 14:32:21,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:21,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565937440] [2024-11-20 14:32:21,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:21,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565937440] [2024-11-20 14:32:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565937440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:32:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120782246] [2024-11-20 14:32:21,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:21,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:21,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:21,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:32:21,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 14:32:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:21,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-20 14:32:21,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:32:21,840 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-11-20 14:32:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:21,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:32:21,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120782246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:21,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:32:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2024-11-20 14:32:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892215523] [2024-11-20 14:32:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:21,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:32:21,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:21,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:32:21,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:32:21,926 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-11-20 14:32:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:21,988 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-11-20 14:32:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:32:21,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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) Word has length 16 [2024-11-20 14:32:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:21,990 INFO L225 Difference]: With dead ends: 45 [2024-11-20 14:32:21,990 INFO L226 Difference]: Without dead ends: 45 [2024-11-20 14:32:21,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:32:21,990 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:21,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 109 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-20 14:32:21,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-11-20 14:32:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-20 14:32:21,993 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 16 [2024-11-20 14:32:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:21,994 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-20 14:32:21,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-11-20 14:32:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-20 14:32:21,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:32:21,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:21,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:22,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 14:32:22,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-20 14:32:22,196 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:22,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:22,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1947627519, now seen corresponding path program 1 times [2024-11-20 14:32:22,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199552158] [2024-11-20 14:32:22,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:22,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:22,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199552158] [2024-11-20 14:32:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199552158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:32:22,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507132860] [2024-11-20 14:32:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:22,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:22,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:22,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:32:22,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 14:32:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:22,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 14:32:22,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:32:22,507 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-11-20 14:32:22,637 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 16 treesize of output 8 [2024-11-20 14:32:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:22,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:32:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507132860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:22,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:32:22,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 18 [2024-11-20 14:32:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734616966] [2024-11-20 14:32:22,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:22,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:32:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:22,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:32:22,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-20 14:32:22,711 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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-11-20 14:32:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:22,870 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-11-20 14:32:22,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:32:22,871 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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) Word has length 16 [2024-11-20 14:32:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:22,872 INFO L225 Difference]: With dead ends: 66 [2024-11-20 14:32:22,872 INFO L226 Difference]: Without dead ends: 66 [2024-11-20 14:32:22,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-11-20 14:32:22,873 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:22,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 126 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:32:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-20 14:32:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2024-11-20 14:32:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-11-20 14:32:22,879 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 16 [2024-11-20 14:32:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:22,879 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-20 14:32:22,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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-11-20 14:32:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-11-20 14:32:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:32:22,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:22,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:22,891 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-11-20 14:32:23,080 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,SelfDestructingSolverStorable14 [2024-11-20 14:32:23,081 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:23,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1360821505, now seen corresponding path program 1 times [2024-11-20 14:32:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:23,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606213618] [2024-11-20 14:32:23,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:23,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:23,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606213618] [2024-11-20 14:32:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606213618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:32:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798953943] [2024-11-20 14:32:23,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:23,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:23,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:23,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:32:23,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 14:32:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:23,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 14:32:23,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:32:23,372 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-11-20 14:32:23,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:32:23,417 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-11-20 14:32:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:23,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:32:23,631 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-11-20 14:32:23,642 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-11-20 14:32:23,645 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-11-20 14:32:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798953943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:32:23,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:32:23,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-11-20 14:32:23,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183685477] [2024-11-20 14:32:23,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:32:23,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 14:32:23,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:23,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 14:32:23,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:32:23,651 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:23,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:23,877 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2024-11-20 14:32:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:32:23,878 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-20 14:32:23,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:23,878 INFO L225 Difference]: With dead ends: 57 [2024-11-20 14:32:23,878 INFO L226 Difference]: Without dead ends: 57 [2024-11-20 14:32:23,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2024-11-20 14:32:23,880 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:23,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 121 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:32:23,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-20 14:32:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2024-11-20 14:32:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-11-20 14:32:23,888 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 16 [2024-11-20 14:32:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:23,888 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-11-20 14:32:23,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-11-20 14:32:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:32:23,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:23,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:23,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 14:32:24,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:24,090 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:24,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:24,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1094465660, now seen corresponding path program 1 times [2024-11-20 14:32:24,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:24,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677103939] [2024-11-20 14:32:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:24,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:24,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677103939] [2024-11-20 14:32:24,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677103939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:24,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:24,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:32:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323802232] [2024-11-20 14:32:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:24,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:32:24,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:24,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:32:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:24,217 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:24,236 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-11-20 14:32:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:32:24,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 14:32:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:24,238 INFO L225 Difference]: With dead ends: 51 [2024-11-20 14:32:24,238 INFO L226 Difference]: Without dead ends: 26 [2024-11-20 14:32:24,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:24,239 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:24,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:24,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-20 14:32:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-20 14:32:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-11-20 14:32:24,241 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 18 [2024-11-20 14:32:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:24,241 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-11-20 14:32:24,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-11-20 14:32:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 14:32:24,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:24,243 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:24,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 14:32:24,243 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:24,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:24,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1150683335, now seen corresponding path program 1 times [2024-11-20 14:32:24,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:24,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883205954] [2024-11-20 14:32:24,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:24,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:24,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883205954] [2024-11-20 14:32:24,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883205954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:32:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931607917] [2024-11-20 14:32:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:24,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:24,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:24,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:32:24,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 14:32:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:24,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-20 14:32:24,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:32:24,694 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-11-20 14:32:24,946 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 16 treesize of output 8 [2024-11-20 14:32:24,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:32:24,997 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-11-20 14:32:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:25,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:32:25,201 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 7 treesize of output 5 [2024-11-20 14:32:25,328 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 20 treesize of output 12 [2024-11-20 14:32:25,406 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-11-20 14:32:25,411 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-11-20 14:32:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:25,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931607917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:32:25,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:32:25,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2024-11-20 14:32:25,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591873866] [2024-11-20 14:32:25,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:32:25,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-20 14:32:25,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:25,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-20 14:32:25,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2024-11-20 14:32:25,474 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:25,817 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2024-11-20 14:32:25,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 14:32:25,818 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 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 20 [2024-11-20 14:32:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:25,818 INFO L225 Difference]: With dead ends: 39 [2024-11-20 14:32:25,818 INFO L226 Difference]: Without dead ends: 35 [2024-11-20 14:32:25,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=1149, Unknown=0, NotChecked=0, Total=1332 [2024-11-20 14:32:25,820 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:25,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 179 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:32:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-20 14:32:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-20 14:32:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.064516129032258) internal successors, (33), 32 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-11-20 14:32:25,827 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2024-11-20 14:32:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:25,827 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2024-11-20 14:32:25,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-11-20 14:32:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:32:25,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:25,828 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:25,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 14:32:26,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 14:32:26,029 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:26,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:26,030 INFO L85 PathProgramCache]: Analyzing trace with hash 398785910, now seen corresponding path program 2 times [2024-11-20 14:32:26,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:26,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89920571] [2024-11-20 14:32:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:26,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:26,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89920571] [2024-11-20 14:32:26,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89920571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:32:26,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096468265] [2024-11-20 14:32:26,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:32:26,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:26,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:26,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:32:26,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 14:32:26,622 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:32:26,622 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:32:26,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-20 14:32:26,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:32:26,635 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-11-20 14:32:26,802 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 16 treesize of output 8 [2024-11-20 14:32:26,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:32:26,842 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-11-20 14:32:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:26,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:32:27,238 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 20 treesize of output 12 [2024-11-20 14:32:27,364 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 43 treesize of output 39 [2024-11-20 14:32:27,386 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-11-20 14:32:27,388 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-11-20 14:32:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096468265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:32:27,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:32:27,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2024-11-20 14:32:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167049805] [2024-11-20 14:32:27,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:32:27,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-20 14:32:27,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:27,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-20 14:32:27,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2024-11-20 14:32:27,397 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:27,817 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2024-11-20 14:32:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 14:32:27,817 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 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 27 [2024-11-20 14:32:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:27,818 INFO L225 Difference]: With dead ends: 33 [2024-11-20 14:32:27,818 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 14:32:27,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=348, Invalid=1458, Unknown=0, NotChecked=0, Total=1806 [2024-11-20 14:32:27,819 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:27,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 131 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:32:27,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 14:32:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 14:32:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 14:32:27,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2024-11-20 14:32:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:27,820 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 14:32:27,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 14:32:27,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 14:32:27,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2024-11-20 14:32:27,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2024-11-20 14:32:27,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2024-11-20 14:32:27,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2024-11-20 14:32:27,824 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-20 14:32:27,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-20 14:32:27,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2024-11-20 14:32:27,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-20 14:32:27,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-20 14:32:27,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2024-11-20 14:32:27,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-20 14:32:27,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-20 14:32:27,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2024-11-20 14:32:27,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-20 14:32:27,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2024-11-20 14:32:27,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 14:32:28,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:28,030 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:28,032 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 14:32:28,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:32:28 BoogieIcfgContainer [2024-11-20 14:32:28,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 14:32:28,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 14:32:28,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 14:32:28,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 14:32:28,036 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:32:18" (3/4) ... [2024-11-20 14:32:28,038 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 14:32:28,046 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-20 14:32:28,046 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-20 14:32:28,046 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-20 14:32:28,046 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 14:32:28,141 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 14:32:28,141 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 14:32:28,141 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 14:32:28,142 INFO L158 Benchmark]: Toolchain (without parser) took 10704.84ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 114.3MB in the beginning and 72.0MB in the end (delta: 42.3MB). Peak memory consumption was 115.4MB. Max. memory is 16.1GB. [2024-11-20 14:32:28,142 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:32:28,142 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.92ms. Allocated memory is still 161.5MB. Free memory was 113.7MB in the beginning and 93.4MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 14:32:28,142 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.53ms. Allocated memory is still 161.5MB. Free memory was 93.4MB in the beginning and 91.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:32:28,142 INFO L158 Benchmark]: Boogie Preprocessor took 58.63ms. Allocated memory is still 161.5MB. Free memory was 91.3MB in the beginning and 89.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:32:28,143 INFO L158 Benchmark]: RCFGBuilder took 441.29ms. Allocated memory is still 161.5MB. Free memory was 89.2MB in the beginning and 120.3MB in the end (delta: -31.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 14:32:28,143 INFO L158 Benchmark]: TraceAbstraction took 9538.88ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 119.3MB in the beginning and 76.9MB in the end (delta: 42.4MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. [2024-11-20 14:32:28,143 INFO L158 Benchmark]: Witness Printer took 106.07ms. Allocated memory is still 234.9MB. Free memory was 76.9MB in the beginning and 72.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 14:32:28,144 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 66.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.92ms. Allocated memory is still 161.5MB. Free memory was 113.7MB in the beginning and 93.4MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.53ms. Allocated memory is still 161.5MB. Free memory was 93.4MB in the beginning and 91.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.63ms. Allocated memory is still 161.5MB. Free memory was 91.3MB in the beginning and 89.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 441.29ms. Allocated memory is still 161.5MB. Free memory was 89.2MB in the beginning and 120.3MB in the end (delta: -31.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9538.88ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 119.3MB in the beginning and 76.9MB in the end (delta: 42.4MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. * Witness Printer took 106.07ms. Allocated memory is still 234.9MB. Free memory was 76.9MB in the beginning and 72.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 375]: 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, 38 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 1531 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1105 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1482 IncrementalHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 426 mSDtfsCounter, 1482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 110 SyntacticMatches, 5 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=15, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 52 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 362 ConstructedInterpolants, 8 QuantifiedInterpolants, 3180 SizeOfPredicates, 38 NumberOfNonLiveVariables, 629 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 8/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-20 14:32:28,177 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