./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:37:00,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:37:00,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:37:00,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:37:00,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:37:00,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:37:00,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:37:00,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:37:00,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:37:00,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:37:00,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:37:00,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:37:00,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:37:00,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:37:00,989 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:37:00,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:37:00,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:37:00,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:37:00,991 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:37:00,991 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:37:00,991 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:37:00,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:37:00,993 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:37:00,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:37:00,993 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:37:00,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:37:00,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:37:00,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:37:00,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:37:00,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:37:00,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:37:00,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:37:00,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:37:00,995 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:37:00,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:37:00,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:37:00,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:37:00,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:37:00,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:37:00,997 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 -> 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e [2024-11-09 07:37:01,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:37:01,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:37:01,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:37:01,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:37:01,304 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:37:01,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i [2024-11-09 07:37:02,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:37:02,934 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:37:02,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i [2024-11-09 07:37:02,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4da61cd1/3c9fe816cda040afbe4e8dcb78934065/FLAGfbccdc20a [2024-11-09 07:37:02,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4da61cd1/3c9fe816cda040afbe4e8dcb78934065 [2024-11-09 07:37:02,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:37:02,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:37:02,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:37:02,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:37:02,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:37:02,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:37:02" (1/1) ... [2024-11-09 07:37:02,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef9fd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:02, skipping insertion in model container [2024-11-09 07:37:02,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:37:02" (1/1) ... [2024-11-09 07:37:03,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:37:03,305 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:37:03,305 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:37:03,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:37:03,325 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:37:03,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:37:03,391 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:37:03,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03 WrapperNode [2024-11-09 07:37:03,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:37:03,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:37:03,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:37:03,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:37:03,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,432 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2024-11-09 07:37:03,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:37:03,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:37:03,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:37:03,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:37:03,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,449 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,471 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [1, 2]. 67 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-09 07:37:03,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:37:03,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:37:03,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:37:03,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:37:03,490 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (1/1) ... [2024-11-09 07:37:03,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:37:03,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:03,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:37:03,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:37:03,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:37:03,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:37:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:37:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:37:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:37:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:37:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:37:03,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:37:03,670 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:37:03,673 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:37:03,852 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-09 07:37:03,853 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:37:03,864 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:37:03,865 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:37:03,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:37:03 BoogieIcfgContainer [2024-11-09 07:37:03,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:37:03,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:37:03,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:37:03,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:37:03,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:37:02" (1/3) ... [2024-11-09 07:37:03,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc2fef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:37:03, skipping insertion in model container [2024-11-09 07:37:03,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:03" (2/3) ... [2024-11-09 07:37:03,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc2fef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:37:03, skipping insertion in model container [2024-11-09 07:37:03,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:37:03" (3/3) ... [2024-11-09 07:37:03,874 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-2.i [2024-11-09 07:37:03,892 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:37:03,892 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-09 07:37:03,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:37:03,937 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;@d0d0455, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:37:03,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 07:37:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:37:03,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:03,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:37:03,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:03,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash 889510823, now seen corresponding path program 1 times [2024-11-09 07:37:03,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:03,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850974539] [2024-11-09 07:37:03,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:04,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850974539] [2024-11-09 07:37:04,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850974539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:04,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:04,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:37:04,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193846837] [2024-11-09 07:37:04,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:04,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:37:04,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:04,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:37:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:37:04,244 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.8) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:04,298 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2024-11-09 07:37:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:37:04,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 07:37:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:04,307 INFO L225 Difference]: With dead ends: 24 [2024-11-09 07:37:04,308 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 07:37:04,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09 07:37:04,313 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:04,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:04,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 07:37:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 07:37:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-09 07:37:04,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 6 [2024-11-09 07:37:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:04,342 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-09 07:37:04,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-09 07:37:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:37:04,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:04,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:37:04,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:37:04,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:04,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:04,345 INFO L85 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2024-11-09 07:37:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:04,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993289173] [2024-11-09 07:37:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:04,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:04,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:04,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993289173] [2024-11-09 07:37:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993289173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:04,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:04,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:37:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170715727] [2024-11-09 07:37:04,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:04,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:37:04,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:04,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:37:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:37:04,742 INFO L87 Difference]: Start difference. First operand 22 states and 25 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-09 07:37:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:04,794 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-09 07:37:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:37:04,795 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-09 07:37:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:04,796 INFO L225 Difference]: With dead ends: 22 [2024-11-09 07:37:04,796 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 07:37:04,796 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-09 07:37:04,797 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:04,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 07:37:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-09 07:37:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.6) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-09 07:37:04,807 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 6 [2024-11-09 07:37:04,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:04,807 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-09 07:37:04,808 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-09 07:37:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-09 07:37:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:37:04,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:04,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:37:04,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:37:04,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:04,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash 889510860, now seen corresponding path program 1 times [2024-11-09 07:37:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:04,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494517999] [2024-11-09 07:37:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:04,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:05,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494517999] [2024-11-09 07:37:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494517999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:05,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:05,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:37:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062022887] [2024-11-09 07:37:05,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:05,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:37:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:05,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:37:05,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:37:05,045 INFO L87 Difference]: Start difference. First operand 21 states and 24 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-09 07:37:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:05,089 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2024-11-09 07:37:05,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:37:05,090 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-09 07:37:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:05,091 INFO L225 Difference]: With dead ends: 22 [2024-11-09 07:37:05,091 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 07:37:05,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:37:05,092 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 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-09 07:37:05,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 07:37:05,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 07:37:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-09 07:37:05,097 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 6 [2024-11-09 07:37:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:05,098 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-09 07:37:05,099 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-09 07:37:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-09 07:37:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:37:05,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:05,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:37:05,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:37:05,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:05,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash 889512745, now seen corresponding path program 1 times [2024-11-09 07:37:05,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627795794] [2024-11-09 07:37:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:05,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:05,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627795794] [2024-11-09 07:37:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627795794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:05,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:05,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:37:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691387777] [2024-11-09 07:37:05,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:05,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:37:05,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:05,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:37:05,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:37:05,134 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:05,155 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-11-09 07:37:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:37:05,156 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-09 07:37:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:05,157 INFO L225 Difference]: With dead ends: 23 [2024-11-09 07:37:05,157 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 07:37:05,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:37:05,158 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:05,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 07:37:05,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 07:37:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-09 07:37:05,162 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 6 [2024-11-09 07:37:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:05,163 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-09 07:37:05,163 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-09 07:37:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-09 07:37:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:37:05,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:05,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:37:05,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:37:05,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:05,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash 889512782, now seen corresponding path program 1 times [2024-11-09 07:37:05,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:05,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525076540] [2024-11-09 07:37:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:05,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:05,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:05,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525076540] [2024-11-09 07:37:05,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525076540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:05,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:05,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:37:05,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634004756] [2024-11-09 07:37:05,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:05,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:37:05,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:05,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:37:05,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:37:05,304 INFO L87 Difference]: Start difference. First operand 22 states and 24 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-09 07:37:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:05,324 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-09 07:37:05,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:37:05,325 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-09 07:37:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:05,326 INFO L225 Difference]: With dead ends: 21 [2024-11-09 07:37:05,326 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 07:37:05,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:37:05,328 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:05,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 07:37:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-09 07:37:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.5) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-09 07:37:05,335 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 6 [2024-11-09 07:37:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:05,335 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-09 07:37:05,335 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-09 07:37:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-09 07:37:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:37:05,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:05,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:05,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:37:05,336 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:05,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash -530222641, now seen corresponding path program 1 times [2024-11-09 07:37:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:05,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084688525] [2024-11-09 07:37:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:05,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:05,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084688525] [2024-11-09 07:37:05,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084688525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:05,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:05,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:37:05,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610445180] [2024-11-09 07:37:05,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:05,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:37:05,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:05,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:37:05,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:37:05,421 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-09 07:37:05,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:05,474 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-09 07:37:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:37:05,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-09 07:37:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:05,478 INFO L225 Difference]: With dead ends: 18 [2024-11-09 07:37:05,478 INFO L226 Difference]: Without dead ends: 18 [2024-11-09 07:37:05,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:37:05,479 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:05,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-09 07:37:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-09 07:37:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-09 07:37:05,486 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2024-11-09 07:37:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:05,487 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-09 07:37:05,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-09 07:37:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-09 07:37:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:37:05,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:05,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:05,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:37:05,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:05,489 INFO L85 PathProgramCache]: Analyzing trace with hash -530222640, now seen corresponding path program 1 times [2024-11-09 07:37:05,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:05,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153359239] [2024-11-09 07:37:05,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:05,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:05,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:05,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153359239] [2024-11-09 07:37:05,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153359239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:05,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:05,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:37:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360278614] [2024-11-09 07:37:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:05,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:37:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:37:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:37:05,701 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-09 07:37:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:05,752 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-09 07:37:05,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:37:05,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-09 07:37:05,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:05,754 INFO L225 Difference]: With dead ends: 20 [2024-11-09 07:37:05,754 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 07:37:05,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:37:05,755 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:05,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 07:37:05,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 07:37:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-09 07:37:05,762 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2024-11-09 07:37:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:05,762 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-09 07:37:05,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-09 07:37:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-09 07:37:05,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:37:05,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:05,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:05,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:37:05,764 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:05,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:05,764 INFO L85 PathProgramCache]: Analyzing trace with hash 742967315, now seen corresponding path program 1 times [2024-11-09 07:37:05,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:05,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683487154] [2024-11-09 07:37:05,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:05,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:05,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:05,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683487154] [2024-11-09 07:37:05,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683487154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:05,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:05,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:37:05,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705537180] [2024-11-09 07:37:05,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:05,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:37:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:05,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:37:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:37:05,879 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:05,918 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-11-09 07:37:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:37:05,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:37:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:05,919 INFO L225 Difference]: With dead ends: 19 [2024-11-09 07:37:05,919 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 07:37:05,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:37:05,921 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:05,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 07:37:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 07:37:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-09 07:37:05,924 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2024-11-09 07:37:05,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:05,924 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-09 07:37:05,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-09 07:37:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:37:05,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:05,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:05,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:37:05,925 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:05,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash 742967316, now seen corresponding path program 1 times [2024-11-09 07:37:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487305947] [2024-11-09 07:37:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:06,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487305947] [2024-11-09 07:37:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487305947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:06,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:37:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992632308] [2024-11-09 07:37:06,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:06,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:37:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:06,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:37:06,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:37:06,135 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:06,183 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-11-09 07:37:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:37:06,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:37:06,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:06,184 INFO L225 Difference]: With dead ends: 26 [2024-11-09 07:37:06,184 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 07:37:06,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:37:06,185 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:06,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 07:37:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 07:37:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.2608695652173914) 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-09 07:37:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-09 07:37:06,191 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2024-11-09 07:37:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:06,192 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-09 07:37:06,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:06,192 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-09 07:37:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:37:06,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:06,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:06,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:37:06,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:06,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash -66379310, now seen corresponding path program 1 times [2024-11-09 07:37:06,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:06,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228746244] [2024-11-09 07:37:06,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:06,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:06,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228746244] [2024-11-09 07:37:06,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228746244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:06,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:06,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:37:06,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786792428] [2024-11-09 07:37:06,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:06,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:37:06,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:06,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:37:06,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:37:06,401 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:06,448 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-09 07:37:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:37:06,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:37:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:06,449 INFO L225 Difference]: With dead ends: 27 [2024-11-09 07:37:06,449 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 07:37:06,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:37:06,450 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:06,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 07:37:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2024-11-09 07:37:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-09 07:37:06,455 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 10 [2024-11-09 07:37:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:06,455 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-09 07:37:06,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-09 07:37:06,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:37:06,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:06,457 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:06,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:37:06,457 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:06,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1772813464, now seen corresponding path program 1 times [2024-11-09 07:37:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:06,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791433541] [2024-11-09 07:37:06,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:06,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:06,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791433541] [2024-11-09 07:37:06,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791433541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:06,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:06,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:37:06,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131333437] [2024-11-09 07:37:06,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:06,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:37:06,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:06,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:37:06,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:37:06,645 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:06,689 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-11-09 07:37:06,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:37:06,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:37:06,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:06,690 INFO L225 Difference]: With dead ends: 27 [2024-11-09 07:37:06,690 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 07:37:06,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:37:06,691 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:06,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 07:37:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 07:37:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 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-09 07:37:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-09 07:37:06,694 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 13 [2024-11-09 07:37:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:06,694 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-09 07:37:06,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-09 07:37:06,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:37:06,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:06,695 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:06,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:37:06,695 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:06,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1379786454, now seen corresponding path program 1 times [2024-11-09 07:37:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636139250] [2024-11-09 07:37:06,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:06,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636139250] [2024-11-09 07:37:06,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636139250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:06,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:06,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:37:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071277546] [2024-11-09 07:37:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:06,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:37:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:06,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:37:06,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:37:06,889 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:06,944 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-09 07:37:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:37:06,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:37:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:06,946 INFO L225 Difference]: With dead ends: 42 [2024-11-09 07:37:06,946 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 07:37:06,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:37:06,947 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:06,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:37:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 07:37:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2024-11-09 07:37:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.24) 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-09 07:37:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-09 07:37:06,953 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 13 [2024-11-09 07:37:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:06,954 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-09 07:37:06,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-09 07:37:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:37:06,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:06,954 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:06,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:37:06,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:06,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:06,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2080851032, now seen corresponding path program 1 times [2024-11-09 07:37:06,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:06,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126163981] [2024-11-09 07:37:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:06,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126163981] [2024-11-09 07:37:07,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126163981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:07,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743860469] [2024-11-09 07:37:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:07,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:07,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:07,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:37:07,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:37:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:07,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:37:07,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:07,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 07:37:07,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:37:07,685 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 20 treesize of output 17 [2024-11-09 07:37:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:07,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:08,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-09 07:37:08,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 07:37:08,085 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-09 07:37:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743860469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:08,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:08,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2024-11-09 07:37:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737762055] [2024-11-09 07:37:08,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:08,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:37:08,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:08,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:37:08,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:37:08,098 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:08,368 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-09 07:37:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:37:08,368 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:37:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:08,369 INFO L225 Difference]: With dead ends: 31 [2024-11-09 07:37:08,369 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 07:37:08,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:37:08,370 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:08,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:37:08,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 07:37:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 07:37:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.25) internal successors, (35), 30 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-09 07:37:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-09 07:37:08,374 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2024-11-09 07:37:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:08,375 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-09 07:37:08,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-09 07:37:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:37:08,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:08,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:08,395 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-09 07:37:08,581 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,SelfDestructingSolverStorable12 [2024-11-09 07:37:08,582 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:08,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:08,583 INFO L85 PathProgramCache]: Analyzing trace with hash -877402150, now seen corresponding path program 1 times [2024-11-09 07:37:08,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:08,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541455554] [2024-11-09 07:37:08,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:08,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:08,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:08,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541455554] [2024-11-09 07:37:08,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541455554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:08,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:08,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:37:08,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702478615] [2024-11-09 07:37:08,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:08,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:37:08,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:08,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:37:08,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:37:08,727 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:08,743 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-09 07:37:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:37:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:37:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:08,744 INFO L225 Difference]: With dead ends: 30 [2024-11-09 07:37:08,744 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 07:37:08,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:37:08,745 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:08,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 24 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 07:37:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 07:37:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2024-11-09 07:37:08,750 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2024-11-09 07:37:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:08,750 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2024-11-09 07:37:08,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:08,752 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2024-11-09 07:37:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:37:08,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:08,752 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:08,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:37:08,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:08,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash 81872524, now seen corresponding path program 1 times [2024-11-09 07:37:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:08,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470741126] [2024-11-09 07:37:08,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:08,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470741126] [2024-11-09 07:37:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470741126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700739449] [2024-11-09 07:37:09,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:09,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:09,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:09,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:37:09,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:37:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:09,332 WARN L253 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-09 07:37:09,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:09,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:37:09,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:37:09,436 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 10 treesize of output 8 [2024-11-09 07:37:09,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-09 07:37:09,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:37:09,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2024-11-09 07:37:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:10,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:10,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-09 07:37:10,520 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-09 07:37:10,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:37:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:10,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700739449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:10,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:10,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2024-11-09 07:37:10,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944877552] [2024-11-09 07:37:10,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:10,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 07:37:10,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:10,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 07:37:10,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2024-11-09 07:37:10,680 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:11,379 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-11-09 07:37:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:37:11,379 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:37:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:11,380 INFO L225 Difference]: With dead ends: 19 [2024-11-09 07:37:11,380 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 07:37:11,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 07:37:11,382 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:11,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:37:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 07:37:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-09 07:37:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 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-09 07:37:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-09 07:37:11,384 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2024-11-09 07:37:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:11,384 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-09 07:37:11,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-09 07:37:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:37:11,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:11,385 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:11,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:37:11,585 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-09 07:37:11,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:11,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash -477082848, now seen corresponding path program 2 times [2024-11-09 07:37:11,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:11,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455256716] [2024-11-09 07:37:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455256716] [2024-11-09 07:37:12,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455256716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514957501] [2024-11-09 07:37:12,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:37:12,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:12,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:12,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:37:12,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:37:12,097 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:37:12,098 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:37:12,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 07:37:12,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:12,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 07:37:13,078 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-09 07:37:13,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 23 [2024-11-09 07:37:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:13,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:13,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-09 07:37:13,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-09 07:37:13,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-09 07:37:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:13,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514957501] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:13,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2024-11-09 07:37:13,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157342229] [2024-11-09 07:37:13,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:13,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 07:37:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:13,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 07:37:13,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=824, Unknown=2, NotChecked=0, Total=930 [2024-11-09 07:37:13,710 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 31 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-09 07:37:17,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:37:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:20,714 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2024-11-09 07:37:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:37:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4) internal successors, (42), 31 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) Word has length 17 [2024-11-09 07:37:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:20,715 INFO L225 Difference]: With dead ends: 30 [2024-11-09 07:37:20,715 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 07:37:20,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=216, Invalid=1671, Unknown=5, NotChecked=0, Total=1892 [2024-11-09 07:37:20,717 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:20,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 5.3s Time] [2024-11-09 07:37:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 07:37:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 07:37:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-11-09 07:37:20,720 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 17 [2024-11-09 07:37:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:20,720 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-11-09 07:37:20,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.4) internal successors, (42), 31 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-09 07:37:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-11-09 07:37:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:37:20,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:20,721 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:20,737 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-09 07:37:20,921 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-09 07:37:20,922 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2024-11-09 07:37:20,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash -951089288, now seen corresponding path program 3 times [2024-11-09 07:37:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:20,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154585665] [2024-11-09 07:37:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:21,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:21,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154585665] [2024-11-09 07:37:21,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154585665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:21,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849723953] [2024-11-09 07:37:21,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:37:21,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:21,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:21,682 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-09 07:37:21,684 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-09 07:37:21,800 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 07:37:21,800 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:37:21,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-09 07:37:21,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:21,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-09 07:37:23,319 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-11-09 07:37:23,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2024-11-09 07:37:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 07:37:23,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:25,293 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 66 treesize of output 56 [2024-11-09 07:37:25,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:37:25,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 176 [2024-11-09 07:37:25,447 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 15 treesize of output 11 [2024-11-09 07:37:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:25,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849723953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:25,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:25,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 20] total 44 [2024-11-09 07:37:25,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866657310] [2024-11-09 07:37:25,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:25,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-09 07:37:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:25,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 07:37:25,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1770, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 07:37:25,583 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 45 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:27,181 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2024-11-09 07:37:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 07:37:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 45 states have internal predecessors, (71), 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 29 [2024-11-09 07:37:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:27,182 INFO L225 Difference]: With dead ends: 29 [2024-11-09 07:37:27,182 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:37:27,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=489, Invalid=3543, Unknown=0, NotChecked=0, Total=4032 [2024-11-09 07:37:27,184 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:27,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:37:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:37:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:37:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:37:27,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-11-09 07:37:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:27,186 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:37:27,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 45 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:37:27,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:37:27,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 7 remaining) [2024-11-09 07:37:27,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2024-11-09 07:37:27,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2024-11-09 07:37:27,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2024-11-09 07:37:27,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2024-11-09 07:37:27,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2024-11-09 07:37:27,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-09 07:37:27,208 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-09 07:37:27,391 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,SelfDestructingSolverStorable16 [2024-11-09 07:37:27,394 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:27,396 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:37:27,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:37:27 BoogieIcfgContainer [2024-11-09 07:37:27,398 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:37:27,399 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:37:27,399 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:37:27,400 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:37:27,400 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:37:03" (3/4) ... [2024-11-09 07:37:27,402 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:37:27,410 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 07:37:27,410 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:37:27,410 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 07:37:27,410 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:37:27,501 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:37:27,502 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:37:27,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:37:27,502 INFO L158 Benchmark]: Toolchain (without parser) took 24536.92ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 96.0MB in the beginning and 186.8MB in the end (delta: -90.8MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2024-11-09 07:37:27,503 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 151.0MB. Free memory was 115.5MB in the beginning and 115.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:37:27,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.01ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 77.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 07:37:27,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.35ms. Allocated memory is still 151.0MB. Free memory was 77.2MB in the beginning and 75.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:37:27,504 INFO L158 Benchmark]: Boogie Preprocessor took 50.74ms. Allocated memory is still 151.0MB. Free memory was 75.5MB in the beginning and 73.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:37:27,504 INFO L158 Benchmark]: RCFGBuilder took 379.26ms. Allocated memory is still 151.0MB. Free memory was 73.0MB in the beginning and 59.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:37:27,504 INFO L158 Benchmark]: TraceAbstraction took 23530.63ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 58.9MB in the beginning and 191.6MB in the end (delta: -132.7MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-11-09 07:37:27,505 INFO L158 Benchmark]: Witness Printer took 103.12ms. Allocated memory is still 310.4MB. Free memory was 191.6MB in the beginning and 186.8MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:37:27,506 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.25ms. Allocated memory is still 151.0MB. Free memory was 115.5MB in the beginning and 115.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.01ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 77.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.35ms. Allocated memory is still 151.0MB. Free memory was 77.2MB in the beginning and 75.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.74ms. Allocated memory is still 151.0MB. Free memory was 75.5MB in the beginning and 73.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 379.26ms. Allocated memory is still 151.0MB. Free memory was 73.0MB in the beginning and 59.8MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23530.63ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 58.9MB in the beginning and 191.6MB in the end (delta: -132.7MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * Witness Printer took 103.12ms. Allocated memory is still 310.4MB. Free memory was 191.6MB in the beginning and 186.8MB in the end (delta: 4.8MB). 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: 555]: 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, 23 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 23.5s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 936 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 710 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1552 IncrementalHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 226 mSDtfsCounter, 1552 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 295 GetRequests, 70 SyntacticMatches, 10 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=13, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 312 ConstructedInterpolants, 52 QuantifiedInterpolants, 4925 SizeOfPredicates, 24 NumberOfNonLiveVariables, 653 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 36/193 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 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:37:27,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE