./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-15/cstrcmp_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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-15/cstrcmp_malloc.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 aeb0ffd1fb7d571e7b8e6363e4fb0cbfb012450e9b632e655c35a1ee40a56c64 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:04:48,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:04:48,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-10 15:04:48,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:04:48,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:04:48,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:04:48,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:04:48,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:04:48,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:04:48,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:04:48,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:04:48,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:04:48,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:04:48,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:04:48,105 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:04:48,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:04:48,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:04:48,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:04:48,106 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:04:48,106 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:04:48,106 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:04:48,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:04:48,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:04:48,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:04:48,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:04:48,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:04:48,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:04:48,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:04:48,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:04:48,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:04:48,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:04:48,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:04:48,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:04:48,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:04:48,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:04:48,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:04:48,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:04:48,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:04:48,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:04:48,109 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 -> aeb0ffd1fb7d571e7b8e6363e4fb0cbfb012450e9b632e655c35a1ee40a56c64 [2024-11-10 15:04:48,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:04:48,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:04:48,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:04:48,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:04:48,304 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:04:48,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrcmp_malloc.i [2024-11-10 15:04:49,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:04:49,658 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:04:49,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcmp_malloc.i [2024-11-10 15:04:49,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/771843dd3/fa7114c7f0a3447db212ed1d968597dd/FLAG2749c1145 [2024-11-10 15:04:50,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/771843dd3/fa7114c7f0a3447db212ed1d968597dd [2024-11-10 15:04:50,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:04:50,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:04:50,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:04:50,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:04:50,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:04:50,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca1e759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50, skipping insertion in model container [2024-11-10 15:04:50,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:04:50,336 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:04:50,336 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:04:50,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:04:50,349 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:04:50,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:04:50,453 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:04:50,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50 WrapperNode [2024-11-10 15:04:50,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:04:50,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:04:50,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:04:50,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:04:50,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,503 INFO L138 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-11-10 15:04:50,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:04:50,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:04:50,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:04:50,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:04:50,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,521 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-10 15:04:50,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,525 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:04:50,530 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:04:50,530 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:04:50,530 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:04:50,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (1/1) ... [2024-11-10 15:04:50,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:04:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:04:50,556 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-10 15:04:50,560 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-10 15:04:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:04:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:04:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:04:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:04:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:04:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:04:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:04:50,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:04:50,662 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:04:50,663 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:04:50,824 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-10 15:04:50,824 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:04:50,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:04:50,842 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:04:50,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:50 BoogieIcfgContainer [2024-11-10 15:04:50,842 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:04:50,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:04:50,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:04:50,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:04:50,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:04:50" (1/3) ... [2024-11-10 15:04:50,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c989842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:04:50, skipping insertion in model container [2024-11-10 15:04:50,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:04:50" (2/3) ... [2024-11-10 15:04:50,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c989842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:04:50, skipping insertion in model container [2024-11-10 15:04:50,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:04:50" (3/3) ... [2024-11-10 15:04:50,852 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcmp_malloc.i [2024-11-10 15:04:50,864 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:04:50,864 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-10 15:04:50,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:04:50,904 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;@2138563e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:04:50,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-10 15:04:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:04:50,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:50,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:04:50,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:50,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:50,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1603890692, now seen corresponding path program 1 times [2024-11-10 15:04:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:50,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838128566] [2024-11-10 15:04:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:51,160 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-10 15:04:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:51,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838128566] [2024-11-10 15:04:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838128566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:51,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:51,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:04:51,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907069053] [2024-11-10 15:04:51,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:51,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:04:51,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:51,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:04:51,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:04:51,190 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-10 15:04:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:51,255 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2024-11-10 15:04:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:04:51,257 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-10 15:04:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:51,263 INFO L225 Difference]: With dead ends: 53 [2024-11-10 15:04:51,263 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 15:04:51,264 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-10 15:04:51,267 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:51,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 47 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:04:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 15:04:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 15:04:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 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-10 15:04:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-11-10 15:04:51,295 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 6 [2024-11-10 15:04:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:51,296 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-11-10 15:04:51,296 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-10 15:04:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-11-10 15:04:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:04:51,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:51,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:04:51,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:04:51,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:51,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:51,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1603890691, now seen corresponding path program 1 times [2024-11-10 15:04:51,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:51,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347096894] [2024-11-10 15:04:51,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:51,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:51,529 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-10 15:04:51,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:51,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347096894] [2024-11-10 15:04:51,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347096894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:51,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:51,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:04:51,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713125040] [2024-11-10 15:04:51,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:51,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:04:51,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:51,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:04:51,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:04:51,534 INFO L87 Difference]: Start difference. First operand 50 states and 53 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-10 15:04:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:51,555 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2024-11-10 15:04:51,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:04:51,556 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-10 15:04:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:51,558 INFO L225 Difference]: With dead ends: 53 [2024-11-10 15:04:51,558 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 15:04:51,559 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-10 15:04:51,560 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:51,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 15:04:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-10 15:04:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 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-10 15:04:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-11-10 15:04:51,570 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 6 [2024-11-10 15:04:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:51,570 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-11-10 15:04:51,570 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-10 15:04:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-11-10 15:04:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:04:51,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:51,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:04:51,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:04:51,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:51,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1603860900, now seen corresponding path program 1 times [2024-11-10 15:04:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:51,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486946743] [2024-11-10 15:04:51,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:51,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:51,728 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-10 15:04:51,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:51,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486946743] [2024-11-10 15:04:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486946743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:51,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:51,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:04:51,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670901824] [2024-11-10 15:04:51,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:51,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:04:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:51,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:04:51,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:04:51,731 INFO L87 Difference]: Start difference. First operand 53 states and 57 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-10 15:04:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:51,776 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2024-11-10 15:04:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:04:51,778 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-10 15:04:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:51,778 INFO L225 Difference]: With dead ends: 52 [2024-11-10 15:04:51,778 INFO L226 Difference]: Without dead ends: 52 [2024-11-10 15:04:51,779 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-10 15:04:51,779 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:51,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 166 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:51,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-10 15:04:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-11-10 15:04:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-10 15:04:51,786 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 6 [2024-11-10 15:04:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:51,787 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-10 15:04:51,787 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-10 15:04:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-10 15:04:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:04:51,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:51,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:51,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:04:51,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:51,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:51,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1818996119, now seen corresponding path program 1 times [2024-11-10 15:04:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:51,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176683239] [2024-11-10 15:04:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:51,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:51,954 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-10 15:04:51,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:51,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176683239] [2024-11-10 15:04:51,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176683239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:51,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:51,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:04:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227492893] [2024-11-10 15:04:51,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:51,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:04:51,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:51,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:04:51,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:04:51,957 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:52,003 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-11-10 15:04:52,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:04:52,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:04:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:52,006 INFO L225 Difference]: With dead ends: 51 [2024-11-10 15:04:52,006 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 15:04:52,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:04:52,008 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:52,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 72 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 15:04:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-10 15:04:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2024-11-10 15:04:52,013 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 7 [2024-11-10 15:04:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:52,013 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2024-11-10 15:04:52,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2024-11-10 15:04:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:04:52,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:52,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:52,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:04:52,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:52,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1818996120, now seen corresponding path program 1 times [2024-11-10 15:04:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:52,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120362300] [2024-11-10 15:04:52,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:52,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:52,095 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-10 15:04:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120362300] [2024-11-10 15:04:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120362300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:04:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644267082] [2024-11-10 15:04:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:52,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:04:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:52,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:04:52,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:04:52,096 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:52,112 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-11-10 15:04:52,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:04:52,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:04:52,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:52,114 INFO L225 Difference]: With dead ends: 51 [2024-11-10 15:04:52,114 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 15:04:52,114 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-10 15:04:52,115 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:52,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 15:04:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 15:04:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 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-10 15:04:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-11-10 15:04:52,119 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 7 [2024-11-10 15:04:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:52,120 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-11-10 15:04:52,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-11-10 15:04:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:04:52,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:52,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:52,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:04:52,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:52,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:52,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1819025911, now seen corresponding path program 1 times [2024-11-10 15:04:52,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:52,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408750513] [2024-11-10 15:04:52,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:52,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:52,200 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-10 15:04:52,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:52,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408750513] [2024-11-10 15:04:52,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408750513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:52,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:52,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:04:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200690768] [2024-11-10 15:04:52,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:52,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:04:52,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:52,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:04:52,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:04:52,204 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:52,218 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2024-11-10 15:04:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:04:52,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:04:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:52,220 INFO L225 Difference]: With dead ends: 50 [2024-11-10 15:04:52,222 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 15:04:52,222 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-10 15:04:52,222 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 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-10 15:04:52,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 15:04:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2024-11-10 15:04:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 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-10 15:04:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-11-10 15:04:52,228 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 7 [2024-11-10 15:04:52,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:52,229 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-11-10 15:04:52,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-11-10 15:04:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:04:52,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:52,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:52,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:04:52,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:52,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash 111025304, now seen corresponding path program 1 times [2024-11-10 15:04:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:52,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635105500] [2024-11-10 15:04:52,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:52,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:52,265 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-10 15:04:52,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:52,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635105500] [2024-11-10 15:04:52,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635105500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:52,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:04:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715569202] [2024-11-10 15:04:52,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:52,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:04:52,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:52,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:04:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:04:52,267 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:52,310 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2024-11-10 15:04:52,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:04:52,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:04:52,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:52,311 INFO L225 Difference]: With dead ends: 44 [2024-11-10 15:04:52,311 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 15:04:52,311 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-10 15:04:52,313 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 37 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:52,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 52 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:52,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 15:04:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-10 15:04:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2024-11-10 15:04:52,318 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 10 [2024-11-10 15:04:52,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:52,318 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2024-11-10 15:04:52,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-11-10 15:04:52,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:04:52,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:52,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:52,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:04:52,319 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:52,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash 111025305, now seen corresponding path program 1 times [2024-11-10 15:04:52,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:52,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380634793] [2024-11-10 15:04:52,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:52,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:52,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-10 15:04:52,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:52,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380634793] [2024-11-10 15:04:52,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380634793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:52,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:52,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:04:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011691509] [2024-11-10 15:04:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:52,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:04:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:52,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:04:52,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:04:52,401 INFO L87 Difference]: Start difference. First operand 44 states and 47 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-10 15:04:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:52,460 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2024-11-10 15:04:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:04:52,460 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-10 15:04:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:52,461 INFO L225 Difference]: With dead ends: 54 [2024-11-10 15:04:52,461 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 15:04:52,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:04:52,461 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 47 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:52,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 100 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:52,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 15:04:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-11-10 15:04:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.475) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-11-10 15:04:52,464 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 10 [2024-11-10 15:04:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:52,464 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-11-10 15:04:52,464 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-10 15:04:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-11-10 15:04:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:04:52,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:52,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:52,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:04:52,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:52,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:52,466 INFO L85 PathProgramCache]: Analyzing trace with hash 445885299, now seen corresponding path program 1 times [2024-11-10 15:04:52,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:52,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100639442] [2024-11-10 15:04:52,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:52,498 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-10 15:04:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:52,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100639442] [2024-11-10 15:04:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100639442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:52,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:04:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737140513] [2024-11-10 15:04:52,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:52,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:04:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:04:52,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:04:52,499 INFO L87 Difference]: Start difference. First operand 52 states and 59 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-10 15:04:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:52,534 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-10 15:04:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:04:52,535 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-10 15:04:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:52,535 INFO L225 Difference]: With dead ends: 50 [2024-11-10 15:04:52,535 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 15:04:52,535 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-10 15:04:52,536 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:52,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 51 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 15:04:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 15:04:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.4) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 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-10 15:04:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-10 15:04:52,538 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 14 [2024-11-10 15:04:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:52,540 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-10 15:04:52,540 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-10 15:04:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-10 15:04:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:04:52,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:52,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:52,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:04:52,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:52,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:52,541 INFO L85 PathProgramCache]: Analyzing trace with hash 445885300, now seen corresponding path program 1 times [2024-11-10 15:04:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:52,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219002174] [2024-11-10 15:04:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:52,651 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-10 15:04:52,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:52,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219002174] [2024-11-10 15:04:52,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219002174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:52,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:52,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:04:52,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572541579] [2024-11-10 15:04:52,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:52,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:04:52,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:52,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:04:52,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:04:52,652 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-10 15:04:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:52,714 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-11-10 15:04:52,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:04:52,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-10 15:04:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:52,715 INFO L225 Difference]: With dead ends: 51 [2024-11-10 15:04:52,715 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 15:04:52,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:04:52,716 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:52,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 103 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:04:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 15:04:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 15:04:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 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-10 15:04:52,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-10 15:04:52,718 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2024-11-10 15:04:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:52,720 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-10 15:04:52,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-10 15:04:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-10 15:04:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:04:52,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:52,721 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:52,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:04:52,721 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:52,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:52,722 INFO L85 PathProgramCache]: Analyzing trace with hash 937567753, now seen corresponding path program 1 times [2024-11-10 15:04:52,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:52,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281685855] [2024-11-10 15:04:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:52,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:52,743 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-10 15:04:52,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:52,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281685855] [2024-11-10 15:04:52,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281685855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:52,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:52,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:04:52,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576021289] [2024-11-10 15:04:52,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:52,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:04:52,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:52,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:04:52,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:04:52,744 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:52,753 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-11-10 15:04:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:04:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 15:04:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:52,753 INFO L225 Difference]: With dead ends: 53 [2024-11-10 15:04:52,754 INFO L226 Difference]: Without dead ends: 53 [2024-11-10 15:04:52,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:04:52,754 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:52,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-10 15:04:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-10 15:04:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-10 15:04:52,756 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 15 [2024-11-10 15:04:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:52,756 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-10 15:04:52,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:04:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-11-10 15:04:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:04:52,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:52,757 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:52,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:04:52,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:52,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:52,760 INFO L85 PathProgramCache]: Analyzing trace with hash 152838288, now seen corresponding path program 1 times [2024-11-10 15:04:52,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:52,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663147062] [2024-11-10 15:04:52,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:52,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:52,899 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-10 15:04:52,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:52,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663147062] [2024-11-10 15:04:52,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663147062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:52,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:52,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:04:52,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051960002] [2024-11-10 15:04:52,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:52,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:04:52,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:52,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:04:52,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:04:52,900 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-10 15:04:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:52,983 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-11-10 15:04:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:04:52,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:04:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:52,984 INFO L225 Difference]: With dead ends: 69 [2024-11-10 15:04:52,984 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 15:04:52,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:04:52,985 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:52,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 218 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:04:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 15:04:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2024-11-10 15:04:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 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-10 15:04:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-10 15:04:52,993 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 18 [2024-11-10 15:04:52,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:52,993 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-10 15:04:52,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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-10 15:04:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-10 15:04:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:04:52,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:52,994 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:52,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:04:52,994 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:52,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:52,994 INFO L85 PathProgramCache]: Analyzing trace with hash -357695889, now seen corresponding path program 1 times [2024-11-10 15:04:52,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:52,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313269608] [2024-11-10 15:04:52,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:53,207 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-10 15:04:53,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:53,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313269608] [2024-11-10 15:04:53,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313269608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:04:53,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101149828] [2024-11-10 15:04:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:53,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:04:53,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:04:53,210 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-10 15:04:53,211 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-10 15:04:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:53,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 15:04:53,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:04:53,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:04:53,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-10 15:04:53,463 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-10 15:04:53,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:04:53,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101149828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:53,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:04:53,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 19 [2024-11-10 15:04:53,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730629778] [2024-11-10 15:04:53,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:53,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:04:53,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:53,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:04:53,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-11-10 15:04:53,465 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-10 15:04:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:53,651 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2024-11-10 15:04:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:04:53,652 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:04:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:53,652 INFO L225 Difference]: With dead ends: 95 [2024-11-10 15:04:53,652 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 15:04:53,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-11-10 15:04:53,653 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:53,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 210 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:04:53,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 15:04:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2024-11-10 15:04:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.25) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 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-10 15:04:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-11-10 15:04:53,663 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 18 [2024-11-10 15:04:53,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:53,663 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-10 15:04:53,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 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-10 15:04:53,663 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-10 15:04:53,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 15:04:53,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:53,664 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:53,679 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-10 15:04:53,864 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-10 15:04:53,864 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:53,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:53,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1149855920, now seen corresponding path program 1 times [2024-11-10 15:04:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:53,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823202362] [2024-11-10 15:04:53,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:53,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:54,059 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-10 15:04:54,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:54,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823202362] [2024-11-10 15:04:54,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823202362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:04:54,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339494190] [2024-11-10 15:04:54,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:54,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:04:54,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:04:54,062 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-10 15:04:54,063 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-10 15:04:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:54,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 15:04:54,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:04:54,125 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-10 15:04:54,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:04:54,233 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 18 treesize of output 19 [2024-11-10 15:04:54,357 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-10 15:04:54,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:04:54,533 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-10 15:04:54,538 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-10 15:04:54,544 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-10 15:04:54,548 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-10 15:04:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339494190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:04:54,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:04:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2024-11-10 15:04:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100558930] [2024-11-10 15:04:54,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:04:54,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 15:04:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:54,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 15:04:54,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:04:54,549 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 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-10 15:04:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:54,938 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-11-10 15:04:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:04:54,938 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-10 15:04:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:54,939 INFO L225 Difference]: With dead ends: 84 [2024-11-10 15:04:54,939 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:04:54,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2024-11-10 15:04:54,940 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 137 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:54,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 241 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:04:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:04:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2024-11-10 15:04:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 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-10 15:04:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-11-10 15:04:54,945 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 18 [2024-11-10 15:04:54,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:54,945 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-10 15:04:54,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 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-10 15:04:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-10 15:04:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:04:54,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:54,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:54,958 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-10 15:04:55,146 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,SelfDestructingSolverStorable13 [2024-11-10 15:04:55,146 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:55,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash 977349292, now seen corresponding path program 1 times [2024-11-10 15:04:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:55,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101715093] [2024-11-10 15:04:55,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:55,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:55,172 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-10 15:04:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:55,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101715093] [2024-11-10 15:04:55,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101715093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:55,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:55,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:04:55,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293459621] [2024-11-10 15:04:55,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:55,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:04:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:55,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:04:55,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:04:55,173 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-10 15:04:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:55,182 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-10 15:04:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:04:55,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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) Word has length 20 [2024-11-10 15:04:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:55,184 INFO L225 Difference]: With dead ends: 72 [2024-11-10 15:04:55,184 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 15:04:55,185 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-10 15:04:55,185 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 45 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-10 15:04:55,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 45 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 15:04:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 15:04:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 66 states have (on average 1.196969696969697) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 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-10 15:04:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-10 15:04:55,188 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 20 [2024-11-10 15:04:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:55,188 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-10 15:04:55,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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-10 15:04:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-10 15:04:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:04:55,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:55,188 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:55,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:04:55,188 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:55,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:55,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1690495989, now seen corresponding path program 1 times [2024-11-10 15:04:55,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:55,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764283307] [2024-11-10 15:04:55,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:55,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:04:55,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764283307] [2024-11-10 15:04:55,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764283307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:04:55,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538302803] [2024-11-10 15:04:55,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:55,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:04:55,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:04:55,503 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-10 15:04:55,504 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-10 15:04:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:55,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 15:04:55,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:04:55,568 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-10 15:04:55,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-10 15:04:55,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:04:55,805 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 18 treesize of output 19 [2024-11-10 15:04:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:04:55,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:04:56,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-10 15:04:56,223 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-10 15:04:56,243 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-10 15:04:56,250 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-10 15:04:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:04:56,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538302803] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:04:56,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:04:56,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2024-11-10 15:04:56,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071733057] [2024-11-10 15:04:56,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:04:56,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:04:56,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:56,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:04:56,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2024-11-10 15:04:56,264 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 30 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 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-10 15:04:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:57,117 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2024-11-10 15:04:57,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:04:57,117 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 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 22 [2024-11-10 15:04:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:57,118 INFO L225 Difference]: With dead ends: 87 [2024-11-10 15:04:57,118 INFO L226 Difference]: Without dead ends: 87 [2024-11-10 15:04:57,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2024-11-10 15:04:57,119 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 207 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:57,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 448 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:04:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-10 15:04:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2024-11-10 15:04:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 70 states have (on average 1.2) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 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-10 15:04:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2024-11-10 15:04:57,121 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 22 [2024-11-10 15:04:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:57,121 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2024-11-10 15:04:57,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 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-10 15:04:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2024-11-10 15:04:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:04:57,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:57,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:57,135 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-10 15:04:57,326 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-10 15:04:57,327 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:57,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:57,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1962150839, now seen corresponding path program 1 times [2024-11-10 15:04:57,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:57,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388976953] [2024-11-10 15:04:57,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:57,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:57,346 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-10 15:04:57,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388976953] [2024-11-10 15:04:57,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388976953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:57,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:57,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:04:57,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342557179] [2024-11-10 15:04:57,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:57,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:04:57,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:57,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:04:57,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:04:57,348 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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-10 15:04:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:57,356 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2024-11-10 15:04:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:04:57,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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) Word has length 24 [2024-11-10 15:04:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:57,356 INFO L225 Difference]: With dead ends: 75 [2024-11-10 15:04:57,357 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 15:04:57,357 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-10 15:04:57,357 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:57,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 38 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 15:04:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-10 15:04:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 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-10 15:04:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2024-11-10 15:04:57,359 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 24 [2024-11-10 15:04:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:57,359 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2024-11-10 15:04:57,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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-10 15:04:57,359 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-10 15:04:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:04:57,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:57,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:57,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:04:57,360 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:57,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:57,360 INFO L85 PathProgramCache]: Analyzing trace with hash -697133889, now seen corresponding path program 1 times [2024-11-10 15:04:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:57,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125697400] [2024-11-10 15:04:57,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:57,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:57,446 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-10 15:04:57,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:57,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125697400] [2024-11-10 15:04:57,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125697400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:04:57,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:04:57,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:04:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930883636] [2024-11-10 15:04:57,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:04:57,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:04:57,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:04:57,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:04:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:04:57,447 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-10 15:04:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:04:57,465 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-11-10 15:04:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:04:57,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-10 15:04:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:04:57,465 INFO L225 Difference]: With dead ends: 74 [2024-11-10 15:04:57,465 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 15:04:57,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:04:57,466 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:04:57,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:04:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 15:04:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-10 15:04:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 15:04:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-11-10 15:04:57,468 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 25 [2024-11-10 15:04:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:04:57,468 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-11-10 15:04:57,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-10 15:04:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-11-10 15:04:57,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:04:57,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:04:57,468 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:04:57,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:04:57,469 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:04:57,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:04:57,469 INFO L85 PathProgramCache]: Analyzing trace with hash -819894873, now seen corresponding path program 2 times [2024-11-10 15:04:57,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:04:57,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184091080] [2024-11-10 15:04:57,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:04:57,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:04:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:04:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:04:57,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:04:57,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184091080] [2024-11-10 15:04:57,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184091080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:04:57,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046582809] [2024-11-10 15:04:57,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:04:57,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:04:57,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:04:57,764 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-10 15:04:57,764 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-10 15:04:57,816 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:04:57,816 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:04:57,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 15:04:57,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:04:57,851 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-10 15:05:00,980 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-10 15:05:00,980 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 28 treesize of output 23 [2024-11-10 15:05:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:01,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:05:01,442 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-10 15:05:01,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:05:01,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2024-11-10 15:05:01,450 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-10 15:05:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046582809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:05:01,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:05:01,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 31 [2024-11-10 15:05:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535783533] [2024-11-10 15:05:01,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:05:01,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 15:05:01,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:01,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 15:05:01,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=871, Unknown=1, NotChecked=0, Total=992 [2024-11-10 15:05:01,508 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 32 states, 31 states have (on average 2.129032258064516) internal successors, (66), 32 states have internal predecessors, (66), 0 states have call successors, (0), 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-10 15:05:09,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:05:17,480 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-10 15:05:22,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:05:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:23,972 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2024-11-10 15:05:23,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 15:05:23,973 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.129032258064516) internal successors, (66), 32 states have internal predecessors, (66), 0 states have call successors, (0), 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 26 [2024-11-10 15:05:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:23,973 INFO L225 Difference]: With dead ends: 118 [2024-11-10 15:05:23,973 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 15:05:23,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=487, Invalid=2477, Unknown=6, NotChecked=0, Total=2970 [2024-11-10 15:05:23,974 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 380 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 10 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:23,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 428 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 686 Invalid, 13 Unknown, 0 Unchecked, 15.3s Time] [2024-11-10 15:05:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 15:05:23,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 94. [2024-11-10 15:05:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 90 states have (on average 1.211111111111111) internal successors, (109), 93 states have internal predecessors, (109), 0 states have call successors, (0), 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-10 15:05:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2024-11-10 15:05:23,977 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 26 [2024-11-10 15:05:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:23,977 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2024-11-10 15:05:23,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.129032258064516) internal successors, (66), 32 states have internal predecessors, (66), 0 states have call successors, (0), 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-10 15:05:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2024-11-10 15:05:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:05:23,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:23,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:23,992 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-10 15:05:24,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:24,178 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:05:24,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2146131366, now seen corresponding path program 1 times [2024-11-10 15:05:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:24,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642683273] [2024-11-10 15:05:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:24,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:24,281 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-10 15:05:24,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642683273] [2024-11-10 15:05:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642683273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:05:24,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:05:24,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:05:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984127587] [2024-11-10 15:05:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:05:24,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:05:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:05:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:05:24,284 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-10 15:05:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:24,324 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2024-11-10 15:05:24,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:05:24,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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 28 [2024-11-10 15:05:24,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:24,325 INFO L225 Difference]: With dead ends: 93 [2024-11-10 15:05:24,325 INFO L226 Difference]: Without dead ends: 57 [2024-11-10 15:05:24,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:05:24,326 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:24,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 82 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:05:24,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-10 15:05:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-10 15:05:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 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-10 15:05:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-11-10 15:05:24,328 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 28 [2024-11-10 15:05:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:24,328 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-11-10 15:05:24,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-10 15:05:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-11-10 15:05:24,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:05:24,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:24,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:24,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:05:24,329 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:05:24,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:24,330 INFO L85 PathProgramCache]: Analyzing trace with hash -284181118, now seen corresponding path program 2 times [2024-11-10 15:05:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:24,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516055723] [2024-11-10 15:05:24,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:24,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:24,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:24,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516055723] [2024-11-10 15:05:24,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516055723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:05:24,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560882409] [2024-11-10 15:05:24,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:05:24,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:24,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:05:24,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:05:24,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:05:24,819 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:05:24,819 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:05:24,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 15:05:24,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:05:24,857 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-10 15:05:25,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:05:25,562 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 37 treesize of output 33 [2024-11-10 15:05:25,911 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-10 15:05:25,912 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 28 treesize of output 23 [2024-11-10 15:05:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:26,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:05:26,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:05:26,623 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 41 treesize of output 36 [2024-11-10 15:05:26,709 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-10 15:05:26,710 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-10 15:05:26,716 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-10 15:05:26,777 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560882409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:05:26,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:05:26,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 19] total 47 [2024-11-10 15:05:26,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813886814] [2024-11-10 15:05:26,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:05:26,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-10 15:05:26,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:26,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-10 15:05:26,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2039, Unknown=1, NotChecked=0, Total=2256 [2024-11-10 15:05:26,779 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 48 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 48 states have internal predecessors, (77), 0 states have call successors, (0), 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-10 15:05:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:05:28,428 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2024-11-10 15:05:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 15:05:28,428 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 48 states have internal predecessors, (77), 0 states have call successors, (0), 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 30 [2024-11-10 15:05:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:05:28,428 INFO L225 Difference]: With dead ends: 55 [2024-11-10 15:05:28,428 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 15:05:28,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=739, Invalid=4372, Unknown=1, NotChecked=0, Total=5112 [2024-11-10 15:05:28,429 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 75 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:05:28,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 184 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:05:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 15:05:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 15:05:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:05:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-11-10 15:05:28,431 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 30 [2024-11-10 15:05:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:05:28,431 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-11-10 15:05:28,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 48 states have internal predecessors, (77), 0 states have call successors, (0), 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-10 15:05:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-11-10 15:05:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:05:28,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:05:28,432 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:05:28,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 15:05:28,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:28,632 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2024-11-10 15:05:28,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:05:28,633 INFO L85 PathProgramCache]: Analyzing trace with hash -788008308, now seen corresponding path program 3 times [2024-11-10 15:05:28,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:05:28,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480368781] [2024-11-10 15:05:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:05:28,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:05:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:05:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:29,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:05:29,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480368781] [2024-11-10 15:05:29,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480368781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:05:29,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417394104] [2024-11-10 15:05:29,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 15:05:29,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:05:29,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:05:29,173 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:05:29,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 15:05:29,248 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 15:05:29,249 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:05:29,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-10 15:05:29,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:05:29,271 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-10 15:05:40,044 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-10 15:05:40,044 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 45 treesize of output 46 [2024-11-10 15:05:40,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:05:40,109 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 16 treesize of output 20 [2024-11-10 15:05:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 54 proven. 22 refuted. 2 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 15:05:40,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:05:41,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:05:41,312 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 33 treesize of output 54 [2024-11-10 15:05:42,972 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-10 15:05:43,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:05:43,031 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-10 15:05:43,097 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-10 15:05:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:05:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417394104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:05:43,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:05:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27, 32] total 69 [2024-11-10 15:05:43,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190927058] [2024-11-10 15:05:43,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:05:43,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2024-11-10 15:05:43,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:05:43,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2024-11-10 15:05:43,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=653, Invalid=4174, Unknown=3, NotChecked=0, Total=4830 [2024-11-10 15:05:43,192 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 70 states, 69 states have (on average 1.9420289855072463) internal successors, (134), 70 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)