./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/dll-middle-shared.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/memsafety-broom/dll-middle-shared.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 d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:19:57,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:19:57,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-10 15:19:57,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:19:57,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:19:57,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:19:57,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:19:57,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:19:57,422 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:19:57,423 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:19:57,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:19:57,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:19:57,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:19:57,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:19:57,425 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:19:57,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:19:57,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:19:57,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:19:57,429 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:19:57,429 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:19:57,430 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:19:57,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:19:57,431 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:19:57,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:19:57,431 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:19:57,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:19:57,432 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:19:57,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:19:57,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:19:57,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:19:57,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:19:57,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:19:57,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:19:57,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:19:57,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:19:57,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:19:57,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:19:57,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:19:57,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:19:57,436 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 -> d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc [2024-11-10 15:19:57,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:19:57,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:19:57,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:19:57,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:19:57,706 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:19:57,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2024-11-10 15:19:59,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:19:59,404 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:19:59,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2024-11-10 15:19:59,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fffd564f/7c43cf1048334a498d3af4a4f7d683fc/FLAGa70fe2172 [2024-11-10 15:19:59,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fffd564f/7c43cf1048334a498d3af4a4f7d683fc [2024-11-10 15:19:59,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:19:59,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:19:59,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:19:59,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:19:59,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:19:59,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:19:59,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ffdbef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59, skipping insertion in model container [2024-11-10 15:19:59,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:19:59,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:19:59,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:19:59,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:19:59,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:19:59,950 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:19:59,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59 WrapperNode [2024-11-10 15:19:59,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:19:59,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:19:59,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:19:59,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:19:59,959 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:19:59" (1/1) ... [2024-11-10 15:19:59,977 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:19:59" (1/1) ... [2024-11-10 15:20:00,003 INFO L138 Inliner]: procedures = 121, calls = 34, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 96 [2024-11-10 15:20:00,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:20:00,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:20:00,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:20:00,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:20:00,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:20:00,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:20:00,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:20:00,052 INFO L175 MemorySlicer]: Split 20 memory accesses to 1 slices as follows [20]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2024-11-10 15:20:00,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:20:00,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:20:00,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:20:00,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:20:00,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:20:00,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:20:00,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:20:00,077 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:20:00,078 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:20:00,078 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:20:00,079 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59" (1/1) ... [2024-11-10 15:20:00,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:20:00,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:00,116 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:20:00,118 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:20:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:20:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-10 15:20:00,156 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-10 15:20:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:20:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:20:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:20:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:20:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:20:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:20:00,260 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:20:00,262 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:20:00,692 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-10 15:20:00,692 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:20:00,711 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:20:00,712 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:20:00,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:20:00 BoogieIcfgContainer [2024-11-10 15:20:00,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:20:00,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:20:00,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:20:00,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:20:00,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:19:59" (1/3) ... [2024-11-10 15:20:00,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49eaf172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:20:00, skipping insertion in model container [2024-11-10 15:20:00,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:59" (2/3) ... [2024-11-10 15:20:00,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49eaf172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:20:00, skipping insertion in model container [2024-11-10 15:20:00,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:20:00" (3/3) ... [2024-11-10 15:20:00,725 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-middle-shared.i [2024-11-10 15:20:00,740 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:20:00,740 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-11-10 15:20:00,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:20:00,785 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;@7ca1be04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:20:00,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-10 15:20:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 64 states have (on average 1.890625) internal successors, (121), 114 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:20:00,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:00,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:20:00,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:00,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash 145979005, now seen corresponding path program 1 times [2024-11-10 15:20:00,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:00,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759763686] [2024-11-10 15:20:00,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:01,046 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:20:01,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:01,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759763686] [2024-11-10 15:20:01,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759763686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:01,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:01,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:20:01,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929445187] [2024-11-10 15:20:01,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:01,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:20:01,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:01,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:20:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:20:01,085 INFO L87 Difference]: Start difference. First operand has 118 states, 64 states have (on average 1.890625) internal successors, (121), 114 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:20:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:01,211 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2024-11-10 15:20:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:20:01,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:20:01,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:01,225 INFO L225 Difference]: With dead ends: 116 [2024-11-10 15:20:01,225 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 15:20:01,227 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:20:01,232 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:01,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 177 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:20:01,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 15:20:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-10 15:20:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 62 states have (on average 1.8225806451612903) internal successors, (113), 109 states have internal predecessors, (113), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2024-11-10 15:20:01,270 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 5 [2024-11-10 15:20:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:01,270 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2024-11-10 15:20:01,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:20:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2024-11-10 15:20:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:20:01,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:01,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:20:01,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:20:01,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:01,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash 145979006, now seen corresponding path program 1 times [2024-11-10 15:20:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:01,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751895123] [2024-11-10 15:20:01,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:01,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:01,369 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:20:01,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:01,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751895123] [2024-11-10 15:20:01,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751895123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:01,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:01,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:20:01,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254037004] [2024-11-10 15:20:01,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:01,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:20:01,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:01,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:20:01,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:20:01,374 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:20:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:01,485 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2024-11-10 15:20:01,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:20:01,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:20:01,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:01,487 INFO L225 Difference]: With dead ends: 111 [2024-11-10 15:20:01,487 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 15:20:01,488 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:20:01,489 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:01,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 185 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:20:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 15:20:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-10 15:20:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 62 states have (on average 1.7903225806451613) internal successors, (111), 107 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2024-11-10 15:20:01,509 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 5 [2024-11-10 15:20:01,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:01,510 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2024-11-10 15:20:01,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:20:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2024-11-10 15:20:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:20:01,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:01,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:01,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:20:01,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:01,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:01,514 INFO L85 PathProgramCache]: Analyzing trace with hash 922883217, now seen corresponding path program 1 times [2024-11-10 15:20:01,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:01,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639767799] [2024-11-10 15:20:01,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:01,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:01,673 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:20:01,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:01,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639767799] [2024-11-10 15:20:01,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639767799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:01,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:01,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:20:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900867805] [2024-11-10 15:20:01,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:01,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:20:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:01,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:20:01,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:20:01,680 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:01,828 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2024-11-10 15:20:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:20:01,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-10 15:20:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:01,831 INFO L225 Difference]: With dead ends: 115 [2024-11-10 15:20:01,834 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 15:20:01,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:20:01,835 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 15 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:01,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 200 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:20:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 15:20:01,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2024-11-10 15:20:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 62 states have (on average 1.7741935483870968) internal successors, (110), 106 states have internal predecessors, (110), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2024-11-10 15:20:01,853 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 11 [2024-11-10 15:20:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:01,853 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2024-11-10 15:20:01,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2024-11-10 15:20:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:20:01,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:01,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:01,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:20:01,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:01,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash 922883218, now seen corresponding path program 1 times [2024-11-10 15:20:01,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:01,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607252801] [2024-11-10 15:20:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:01,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:01,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:02,007 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:20:02,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:02,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607252801] [2024-11-10 15:20:02,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607252801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:02,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:02,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:20:02,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433716857] [2024-11-10 15:20:02,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:02,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:20:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:02,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:20:02,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:20:02,014 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:02,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:02,147 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2024-11-10 15:20:02,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:20:02,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-10 15:20:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:02,149 INFO L225 Difference]: With dead ends: 114 [2024-11-10 15:20:02,149 INFO L226 Difference]: Without dead ends: 114 [2024-11-10 15:20:02,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:20:02,152 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 15 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:02,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 211 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:20:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-10 15:20:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2024-11-10 15:20:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 105 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 113 transitions. [2024-11-10 15:20:02,162 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 113 transitions. Word has length 11 [2024-11-10 15:20:02,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:02,162 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 113 transitions. [2024-11-10 15:20:02,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2024-11-10 15:20:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:20:02,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:02,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:02,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:20:02,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:02,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2127511310, now seen corresponding path program 1 times [2024-11-10 15:20:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:02,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764548611] [2024-11-10 15:20:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:02,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:02,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:02,268 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:20:02,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:02,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764548611] [2024-11-10 15:20:02,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764548611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:02,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:02,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:20:02,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636144295] [2024-11-10 15:20:02,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:02,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:20:02,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:02,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:20:02,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:20:02,274 INFO L87 Difference]: Start difference. First operand 109 states and 113 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:02,411 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2024-11-10 15:20:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:20:02,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 15:20:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:02,412 INFO L225 Difference]: With dead ends: 113 [2024-11-10 15:20:02,412 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 15:20:02,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:20:02,414 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:02,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 201 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:20:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 15:20:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2024-11-10 15:20:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 104 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2024-11-10 15:20:02,438 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 13 [2024-11-10 15:20:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:02,438 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2024-11-10 15:20:02,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2024-11-10 15:20:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:20:02,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:02,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:02,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:20:02,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:02,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2127511311, now seen corresponding path program 1 times [2024-11-10 15:20:02,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:02,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883914560] [2024-11-10 15:20:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:02,601 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:20:02,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:02,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883914560] [2024-11-10 15:20:02,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883914560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:02,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:02,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:20:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376615602] [2024-11-10 15:20:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:02,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:20:02,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:02,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:20:02,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:20:02,604 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:02,717 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2024-11-10 15:20:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:20:02,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 15:20:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:02,718 INFO L225 Difference]: With dead ends: 112 [2024-11-10 15:20:02,718 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 15:20:02,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:20:02,719 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:02,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 212 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:20:02,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 15:20:02,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2024-11-10 15:20:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 103 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2024-11-10 15:20:02,725 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 13 [2024-11-10 15:20:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:02,725 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2024-11-10 15:20:02,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2024-11-10 15:20:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:20:02,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:02,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:02,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:20:02,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:02,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:02,727 INFO L85 PathProgramCache]: Analyzing trace with hash 133938635, now seen corresponding path program 1 times [2024-11-10 15:20:02,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:02,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746682935] [2024-11-10 15:20:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:02,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:02,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:02,945 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:20:02,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746682935] [2024-11-10 15:20:02,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746682935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:02,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:02,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:20:02,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260549194] [2024-11-10 15:20:02,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:02,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:20:02,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:02,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:20:02,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:20:02,948 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:03,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:03,154 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2024-11-10 15:20:03,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:20:03,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-10 15:20:03,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:03,155 INFO L225 Difference]: With dead ends: 106 [2024-11-10 15:20:03,155 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 15:20:03,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:20:03,156 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 44 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:03,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 305 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:03,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 15:20:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2024-11-10 15:20:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 97 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2024-11-10 15:20:03,168 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 15 [2024-11-10 15:20:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:03,168 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2024-11-10 15:20:03,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2024-11-10 15:20:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 15:20:03,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:03,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:03,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:20:03,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:03,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:03,170 INFO L85 PathProgramCache]: Analyzing trace with hash 133938636, now seen corresponding path program 1 times [2024-11-10 15:20:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:03,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400395261] [2024-11-10 15:20:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:03,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:03,615 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:20:03,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:03,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400395261] [2024-11-10 15:20:03,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400395261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:03,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:03,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:20:03,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52581211] [2024-11-10 15:20:03,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:03,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:20:03,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:03,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:20:03,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:20:03,620 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:03,853 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2024-11-10 15:20:03,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:20:03,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-10 15:20:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:03,855 INFO L225 Difference]: With dead ends: 104 [2024-11-10 15:20:03,855 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 15:20:03,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:20:03,856 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 22 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:03,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 369 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:03,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 15:20:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2024-11-10 15:20:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.596774193548387) internal successors, (99), 95 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2024-11-10 15:20:03,867 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 15 [2024-11-10 15:20:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:03,867 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2024-11-10 15:20:03,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2024-11-10 15:20:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:20:03,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:03,868 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] [2024-11-10 15:20:03,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:20:03,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:03,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:03,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1815465979, now seen corresponding path program 1 times [2024-11-10 15:20:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142133489] [2024-11-10 15:20:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:04,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:04,117 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:20:04,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:04,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142133489] [2024-11-10 15:20:04,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142133489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:04,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:04,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:20:04,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134643389] [2024-11-10 15:20:04,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:04,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:20:04,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:04,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:20:04,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:20:04,123 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:04,367 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2024-11-10 15:20:04,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:20:04,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-10 15:20:04,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:04,369 INFO L225 Difference]: With dead ends: 133 [2024-11-10 15:20:04,369 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 15:20:04,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:20:04,370 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 31 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:04,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 583 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 15:20:04,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2024-11-10 15:20:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.5810810810810811) internal successors, (117), 107 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2024-11-10 15:20:04,378 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 23 [2024-11-10 15:20:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:04,378 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2024-11-10 15:20:04,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2024-11-10 15:20:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:20:04,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:04,379 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] [2024-11-10 15:20:04,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:20:04,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:04,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1815465980, now seen corresponding path program 1 times [2024-11-10 15:20:04,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:04,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930371666] [2024-11-10 15:20:04,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:04,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:04,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:04,531 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:20:04,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:04,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930371666] [2024-11-10 15:20:04,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930371666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:04,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:04,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:20:04,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118975522] [2024-11-10 15:20:04,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:04,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:20:04,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:04,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:20:04,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:20:04,534 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:04,752 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2024-11-10 15:20:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:20:04,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-10 15:20:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:04,754 INFO L225 Difference]: With dead ends: 143 [2024-11-10 15:20:04,754 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 15:20:04,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:20:04,755 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 36 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:04,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 373 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:04,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 15:20:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 131. [2024-11-10 15:20:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 126 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2024-11-10 15:20:04,763 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 23 [2024-11-10 15:20:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:04,764 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2024-11-10 15:20:04,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:04,764 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2024-11-10 15:20:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:20:04,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:04,764 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:20:04,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:20:04,765 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:04,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:04,768 INFO L85 PathProgramCache]: Analyzing trace with hash -906123368, now seen corresponding path program 1 times [2024-11-10 15:20:04,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:04,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898593558] [2024-11-10 15:20:04,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:04,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:04,947 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:20:04,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:04,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898593558] [2024-11-10 15:20:04,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898593558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:04,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:04,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:20:04,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77360660] [2024-11-10 15:20:04,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:04,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:20:04,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:04,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:20:04,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:20:04,948 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:05,058 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2024-11-10 15:20:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:20:05,058 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-10 15:20:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:05,060 INFO L225 Difference]: With dead ends: 147 [2024-11-10 15:20:05,060 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 15:20:05,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:20:05,060 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:05,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 631 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:20:05,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 15:20:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2024-11-10 15:20:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.5510204081632653) internal successors, (152), 130 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2024-11-10 15:20:05,065 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 25 [2024-11-10 15:20:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:05,066 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2024-11-10 15:20:05,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:05,066 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2024-11-10 15:20:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:20:05,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:05,069 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:05,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:20:05,069 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:05,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1265012429, now seen corresponding path program 1 times [2024-11-10 15:20:05,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:05,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92502780] [2024-11-10 15:20:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:05,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:05,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:20:05,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:05,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92502780] [2024-11-10 15:20:05,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92502780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:05,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:05,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:20:05,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305091049] [2024-11-10 15:20:05,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:05,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:20:05,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:05,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:20:05,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:20:05,264 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:05,384 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2024-11-10 15:20:05,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:20:05,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-10 15:20:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:05,385 INFO L225 Difference]: With dead ends: 135 [2024-11-10 15:20:05,385 INFO L226 Difference]: Without dead ends: 135 [2024-11-10 15:20:05,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:20:05,386 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:05,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 169 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:20:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-10 15:20:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-10 15:20:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.5408163265306123) internal successors, (151), 130 states have internal predecessors, (151), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2024-11-10 15:20:05,391 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 26 [2024-11-10 15:20:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:05,392 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2024-11-10 15:20:05,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2024-11-10 15:20:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:20:05,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:05,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:05,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:20:05,396 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:05,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:05,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1265012428, now seen corresponding path program 1 times [2024-11-10 15:20:05,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:05,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430072051] [2024-11-10 15:20:05,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:05,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:05,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:20:05,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:05,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430072051] [2024-11-10 15:20:05,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430072051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:05,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918184310] [2024-11-10 15:20:05,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:05,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:05,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:05,737 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:20:05,738 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:20:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:05,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 15:20:05,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:06,005 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:20:06,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:20:06,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:20:06,090 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:20:06,090 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 11 treesize of output 11 [2024-11-10 15:20:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:20:06,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:20:06,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918184310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:06,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:20:06,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-11-10 15:20:06,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500246370] [2024-11-10 15:20:06,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:06,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:20:06,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:06,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:20:06,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-11-10 15:20:06,115 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:06,258 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2024-11-10 15:20:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:20:06,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-10 15:20:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:06,260 INFO L225 Difference]: With dead ends: 141 [2024-11-10 15:20:06,260 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 15:20:06,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-11-10 15:20:06,261 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 36 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:06,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 226 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 160 Invalid, 0 Unknown, 148 Unchecked, 0.1s Time] [2024-11-10 15:20:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 15:20:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2024-11-10 15:20:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.489795918367347) internal successors, (146), 130 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:06,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2024-11-10 15:20:06,265 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 26 [2024-11-10 15:20:06,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:06,265 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2024-11-10 15:20:06,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2024-11-10 15:20:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:20:06,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:06,266 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] [2024-11-10 15:20:06,285 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:20:06,468 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:20:06,468 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:06,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1131948352, now seen corresponding path program 1 times [2024-11-10 15:20:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:06,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027546504] [2024-11-10 15:20:06,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:06,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:20:06,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:06,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027546504] [2024-11-10 15:20:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027546504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:06,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:20:06,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071488346] [2024-11-10 15:20:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:06,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:20:06,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:06,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:20:06,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:20:06,600 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:06,801 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2024-11-10 15:20:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:20:06,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-10 15:20:06,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:06,803 INFO L225 Difference]: With dead ends: 154 [2024-11-10 15:20:06,803 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 15:20:06,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:20:06,804 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 63 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:06,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 347 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 15:20:06,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 145. [2024-11-10 15:20:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 140 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:06,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 166 transitions. [2024-11-10 15:20:06,808 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 166 transitions. Word has length 27 [2024-11-10 15:20:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:06,808 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 166 transitions. [2024-11-10 15:20:06,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:06,809 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 166 transitions. [2024-11-10 15:20:06,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 15:20:06,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:06,809 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] [2024-11-10 15:20:06,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:20:06,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:06,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1131948353, now seen corresponding path program 1 times [2024-11-10 15:20:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431954759] [2024-11-10 15:20:06,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:06,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:07,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:07,103 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:20:07,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:07,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431954759] [2024-11-10 15:20:07,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431954759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:07,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:07,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:20:07,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5403253] [2024-11-10 15:20:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:07,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:20:07,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:07,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:20:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:20:07,106 INFO L87 Difference]: Start difference. First operand 145 states and 166 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:07,310 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2024-11-10 15:20:07,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:20:07,311 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-10 15:20:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:07,312 INFO L225 Difference]: With dead ends: 149 [2024-11-10 15:20:07,312 INFO L226 Difference]: Without dead ends: 149 [2024-11-10 15:20:07,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:20:07,313 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 29 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:07,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 638 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-10 15:20:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-10 15:20:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 112 states have (on average 1.4642857142857142) internal successors, (164), 144 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2024-11-10 15:20:07,319 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 27 [2024-11-10 15:20:07,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:07,320 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2024-11-10 15:20:07,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2024-11-10 15:20:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:20:07,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:07,322 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:07,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:20:07,322 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:07,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:07,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1942150803, now seen corresponding path program 1 times [2024-11-10 15:20:07,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:07,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865163364] [2024-11-10 15:20:07,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:07,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:07,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:07,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:07,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:07,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865163364] [2024-11-10 15:20:07,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865163364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:07,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:07,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:20:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138234791] [2024-11-10 15:20:07,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:07,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:20:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:07,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:20:07,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:20:07,514 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:20:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:07,721 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2024-11-10 15:20:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:20:07,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-10 15:20:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:07,723 INFO L225 Difference]: With dead ends: 148 [2024-11-10 15:20:07,723 INFO L226 Difference]: Without dead ends: 148 [2024-11-10 15:20:07,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:20:07,723 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 8 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:07,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 372 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:07,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-10 15:20:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-10 15:20:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 143 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2024-11-10 15:20:07,729 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 29 [2024-11-10 15:20:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:07,730 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2024-11-10 15:20:07,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:20:07,730 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2024-11-10 15:20:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:20:07,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:07,730 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:07,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:20:07,731 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:07,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:07,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1942150802, now seen corresponding path program 1 times [2024-11-10 15:20:07,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:07,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236147531] [2024-11-10 15:20:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:07,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:07,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:20:08,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:08,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236147531] [2024-11-10 15:20:08,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236147531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:08,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:08,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:20:08,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954511933] [2024-11-10 15:20:08,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:08,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:20:08,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:08,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:20:08,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:20:08,020 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:20:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:08,227 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2024-11-10 15:20:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:20:08,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-10 15:20:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:08,228 INFO L225 Difference]: With dead ends: 147 [2024-11-10 15:20:08,228 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 15:20:08,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:20:08,229 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 3 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:08,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 422 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 15:20:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-10 15:20:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 112 states have (on average 1.4285714285714286) internal successors, (160), 142 states have internal predecessors, (160), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 166 transitions. [2024-11-10 15:20:08,233 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 166 transitions. Word has length 29 [2024-11-10 15:20:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:08,233 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 166 transitions. [2024-11-10 15:20:08,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:20:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2024-11-10 15:20:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:20:08,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:08,234 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:20:08,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:20:08,235 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:08,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:08,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1110068276, now seen corresponding path program 1 times [2024-11-10 15:20:08,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:08,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625134474] [2024-11-10 15:20:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:08,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:08,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:20:08,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:08,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625134474] [2024-11-10 15:20:08,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625134474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:08,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:08,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:20:08,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148589149] [2024-11-10 15:20:08,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:08,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:20:08,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:08,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:20:08,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:20:08,560 INFO L87 Difference]: Start difference. First operand 147 states and 166 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:08,826 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2024-11-10 15:20:08,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:20:08,827 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-10 15:20:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:08,828 INFO L225 Difference]: With dead ends: 148 [2024-11-10 15:20:08,828 INFO L226 Difference]: Without dead ends: 148 [2024-11-10 15:20:08,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:20:08,829 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 29 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:08,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 418 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-10 15:20:08,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-11-10 15:20:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 112 states have (on average 1.4196428571428572) internal successors, (159), 142 states have internal predecessors, (159), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2024-11-10 15:20:08,833 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 32 [2024-11-10 15:20:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:08,833 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2024-11-10 15:20:08,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2024-11-10 15:20:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:20:08,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:08,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:20:08,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:20:08,834 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:08,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:08,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1110068275, now seen corresponding path program 1 times [2024-11-10 15:20:08,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:08,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880613258] [2024-11-10 15:20:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:08,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:09,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:09,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:20:09,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:09,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880613258] [2024-11-10 15:20:09,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880613258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:09,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:09,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:20:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291151223] [2024-11-10 15:20:09,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:09,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:20:09,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:09,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:20:09,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:20:09,278 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:09,617 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2024-11-10 15:20:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:20:09,617 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-10 15:20:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:09,618 INFO L225 Difference]: With dead ends: 147 [2024-11-10 15:20:09,618 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 15:20:09,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:20:09,619 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:09,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 547 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:20:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 15:20:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-10 15:20:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 142 states have internal predecessors, (158), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 164 transitions. [2024-11-10 15:20:09,623 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 164 transitions. Word has length 32 [2024-11-10 15:20:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:09,623 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 164 transitions. [2024-11-10 15:20:09,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 164 transitions. [2024-11-10 15:20:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:20:09,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:09,624 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2024-11-10 15:20:09,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:20:09,625 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:09,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash 199054142, now seen corresponding path program 1 times [2024-11-10 15:20:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:09,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44896723] [2024-11-10 15:20:09,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:09,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:09,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:09,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:09,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44896723] [2024-11-10 15:20:09,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44896723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:09,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:09,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:20:09,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690174333] [2024-11-10 15:20:09,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:09,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:20:09,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:09,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:20:09,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:20:09,742 INFO L87 Difference]: Start difference. First operand 147 states and 164 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:09,978 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2024-11-10 15:20:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:20:09,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-10 15:20:09,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:09,980 INFO L225 Difference]: With dead ends: 167 [2024-11-10 15:20:09,980 INFO L226 Difference]: Without dead ends: 167 [2024-11-10 15:20:09,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:20:09,980 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 58 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:09,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 315 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:09,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-10 15:20:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2024-11-10 15:20:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 126 states have (on average 1.4285714285714286) internal successors, (180), 155 states have internal predecessors, (180), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 186 transitions. [2024-11-10 15:20:09,989 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 186 transitions. Word has length 33 [2024-11-10 15:20:09,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:09,989 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 186 transitions. [2024-11-10 15:20:09,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:09,989 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2024-11-10 15:20:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:20:09,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:09,989 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2024-11-10 15:20:09,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 15:20:09,990 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:09,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:09,993 INFO L85 PathProgramCache]: Analyzing trace with hash 199054143, now seen corresponding path program 1 times [2024-11-10 15:20:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:09,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629636356] [2024-11-10 15:20:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:09,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:10,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:10,273 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:20:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629636356] [2024-11-10 15:20:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629636356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388139605] [2024-11-10 15:20:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:10,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:10,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:10,276 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:20:10,278 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:20:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:10,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 15:20:10,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:10,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:20:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388139605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:10,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:20:10,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-11-10 15:20:10,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422976691] [2024-11-10 15:20:10,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:10,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:20:10,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:10,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:20:10,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:20:10,620 INFO L87 Difference]: Start difference. First operand 160 states and 186 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:10,844 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2024-11-10 15:20:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:20:10,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-10 15:20:10,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:10,845 INFO L225 Difference]: With dead ends: 190 [2024-11-10 15:20:10,846 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 15:20:10,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-11-10 15:20:10,847 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 41 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:10,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 397 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 15:20:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 178. [2024-11-10 15:20:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 144 states have (on average 1.4513888888888888) internal successors, (209), 173 states have internal predecessors, (209), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 215 transitions. [2024-11-10 15:20:10,852 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 215 transitions. Word has length 33 [2024-11-10 15:20:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:10,852 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 215 transitions. [2024-11-10 15:20:10,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:10,853 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 215 transitions. [2024-11-10 15:20:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 15:20:10,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:10,853 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2024-11-10 15:20:10,870 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:20:11,053 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,SelfDestructingSolverStorable20 [2024-11-10 15:20:11,054 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:11,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1875711121, now seen corresponding path program 1 times [2024-11-10 15:20:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:11,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346504983] [2024-11-10 15:20:11,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:11,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:11,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:11,328 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:20:11,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:11,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346504983] [2024-11-10 15:20:11,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346504983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:11,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299203440] [2024-11-10 15:20:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:11,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:11,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:11,336 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:20:11,337 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:20:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:11,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 15:20:11,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:11,621 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:20:11,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 15:20:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:11,783 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:20:11,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299203440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:11,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:20:11,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-11-10 15:20:11,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111817565] [2024-11-10 15:20:11,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:11,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:20:11,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:11,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:20:11,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:20:11,786 INFO L87 Difference]: Start difference. First operand 178 states and 215 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:12,035 INFO L93 Difference]: Finished difference Result 189 states and 217 transitions. [2024-11-10 15:20:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:20:12,036 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-11-10 15:20:12,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:12,037 INFO L225 Difference]: With dead ends: 189 [2024-11-10 15:20:12,037 INFO L226 Difference]: Without dead ends: 189 [2024-11-10 15:20:12,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:20:12,040 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 44 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:12,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 637 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-10 15:20:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2024-11-10 15:20:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 144 states have (on average 1.4444444444444444) internal successors, (208), 173 states have internal predecessors, (208), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 214 transitions. [2024-11-10 15:20:12,044 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 214 transitions. Word has length 34 [2024-11-10 15:20:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:12,044 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 214 transitions. [2024-11-10 15:20:12,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 214 transitions. [2024-11-10 15:20:12,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:20:12,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:12,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:20:12,064 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:20:12,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:12,245 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:12,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:12,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1204221414, now seen corresponding path program 1 times [2024-11-10 15:20:12,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:12,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466995904] [2024-11-10 15:20:12,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:12,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:12,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:12,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:20:12,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:12,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466995904] [2024-11-10 15:20:12,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466995904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:12,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:12,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:20:12,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116095603] [2024-11-10 15:20:12,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:12,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:20:12,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:12,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:20:12,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:20:12,615 INFO L87 Difference]: Start difference. First operand 178 states and 214 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:12,935 INFO L93 Difference]: Finished difference Result 179 states and 213 transitions. [2024-11-10 15:20:12,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:20:12,936 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-10 15:20:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:12,936 INFO L225 Difference]: With dead ends: 179 [2024-11-10 15:20:12,937 INFO L226 Difference]: Without dead ends: 179 [2024-11-10 15:20:12,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-10 15:20:12,937 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 32 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:12,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 461 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:20:12,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-10 15:20:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2024-11-10 15:20:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 144 states have (on average 1.4375) internal successors, (207), 173 states have internal predecessors, (207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions. [2024-11-10 15:20:12,942 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 35 [2024-11-10 15:20:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:12,942 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 213 transitions. [2024-11-10 15:20:12,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2024-11-10 15:20:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:20:12,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:12,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:20:12,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 15:20:12,944 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:12,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:12,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1204221415, now seen corresponding path program 1 times [2024-11-10 15:20:12,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:12,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216551865] [2024-11-10 15:20:12,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:13,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:20:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:13,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216551865] [2024-11-10 15:20:13,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216551865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:13,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:13,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:20:13,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429746359] [2024-11-10 15:20:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:13,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:20:13,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:13,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:20:13,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:20:13,477 INFO L87 Difference]: Start difference. First operand 178 states and 213 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:13,817 INFO L93 Difference]: Finished difference Result 178 states and 212 transitions. [2024-11-10 15:20:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:20:13,818 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-10 15:20:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:13,819 INFO L225 Difference]: With dead ends: 178 [2024-11-10 15:20:13,819 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 15:20:13,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:20:13,820 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 29 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:13,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 487 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:20:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 15:20:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-10 15:20:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 144 states have (on average 1.4305555555555556) internal successors, (206), 173 states have internal predecessors, (206), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:13,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 212 transitions. [2024-11-10 15:20:13,825 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 212 transitions. Word has length 35 [2024-11-10 15:20:13,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:13,825 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 212 transitions. [2024-11-10 15:20:13,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:20:13,826 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 212 transitions. [2024-11-10 15:20:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:20:13,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:13,826 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2024-11-10 15:20:13,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 15:20:13,827 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:13,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:13,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1982497380, now seen corresponding path program 1 times [2024-11-10 15:20:13,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:13,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498149152] [2024-11-10 15:20:13,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:13,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:14,085 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:20:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498149152] [2024-11-10 15:20:14,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498149152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:14,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49337727] [2024-11-10 15:20:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:14,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:14,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:14,087 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:20:14,089 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:20:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:14,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 15:20:14,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:14,403 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 15 treesize of output 1 [2024-11-10 15:20:14,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 15:20:14,572 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 17 treesize of output 9 [2024-11-10 15:20:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:14,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:20:14,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49337727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:14,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:20:14,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-11-10 15:20:14,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836040195] [2024-11-10 15:20:14,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:14,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:20:14,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:14,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:20:14,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:20:14,579 INFO L87 Difference]: Start difference. First operand 178 states and 212 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:14,922 INFO L93 Difference]: Finished difference Result 186 states and 214 transitions. [2024-11-10 15:20:14,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:20:14,922 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-10 15:20:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:14,923 INFO L225 Difference]: With dead ends: 186 [2024-11-10 15:20:14,924 INFO L226 Difference]: Without dead ends: 186 [2024-11-10 15:20:14,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:20:14,924 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:14,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 590 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:20:14,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-10 15:20:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2024-11-10 15:20:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 144 states have (on average 1.4236111111111112) internal successors, (205), 173 states have internal predecessors, (205), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2024-11-10 15:20:14,933 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 211 transitions. Word has length 35 [2024-11-10 15:20:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:14,933 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 211 transitions. [2024-11-10 15:20:14,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:14,934 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 211 transitions. [2024-11-10 15:20:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 15:20:14,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:14,934 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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:20:14,952 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:20:15,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:15,135 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:15,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1944353946, now seen corresponding path program 1 times [2024-11-10 15:20:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012180769] [2024-11-10 15:20:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:15,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:20:16,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:16,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012180769] [2024-11-10 15:20:16,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012180769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:16,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900923392] [2024-11-10 15:20:16,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:16,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:16,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:16,118 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:20:16,119 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:20:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:16,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-10 15:20:16,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:16,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:20:16,339 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 13 treesize of output 9 [2024-11-10 15:20:16,345 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 13 treesize of output 9 [2024-11-10 15:20:16,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 13 [2024-11-10 15:20:16,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-10 15:20:16,537 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:20:16,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:20:16,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:20:16,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-10 15:20:16,658 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:20:16,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2024-11-10 15:20:16,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-10 15:20:16,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:20:16,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-10 15:20:16,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 15:20:16,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 13 [2024-11-10 15:20:16,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2024-11-10 15:20:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:20:17,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:20:30,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:30,542 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2024-11-10 15:20:30,548 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 70 treesize of output 58 [2024-11-10 15:20:30,553 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 28 treesize of output 24 [2024-11-10 15:20:30,557 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 42 treesize of output 34 [2024-11-10 15:20:30,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:30,589 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2024-11-10 15:20:30,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:30,595 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 150 treesize of output 126 [2024-11-10 15:20:30,605 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 28 treesize of output 20 [2024-11-10 15:20:30,609 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 17 treesize of output 13 [2024-11-10 15:20:30,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:20:30,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900923392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:20:30,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:20:30,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 40 [2024-11-10 15:20:30,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173765170] [2024-11-10 15:20:30,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:20:30,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-10 15:20:30,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:30,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-10 15:20:30,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1390, Unknown=33, NotChecked=0, Total=1560 [2024-11-10 15:20:30,747 INFO L87 Difference]: Start difference. First operand 178 states and 211 transitions. Second operand has 40 states, 40 states have (on average 1.8) internal successors, (72), 36 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:20:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:31,821 INFO L93 Difference]: Finished difference Result 173 states and 203 transitions. [2024-11-10 15:20:31,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:20:31,822 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.8) internal successors, (72), 36 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-10 15:20:31,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:31,822 INFO L225 Difference]: With dead ends: 173 [2024-11-10 15:20:31,822 INFO L226 Difference]: Without dead ends: 173 [2024-11-10 15:20:31,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=219, Invalid=2001, Unknown=36, NotChecked=0, Total=2256 [2024-11-10 15:20:31,824 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 28 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:31,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1510 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:20:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-10 15:20:31,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-10 15:20:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 139 states have (on average 1.4172661870503598) internal successors, (197), 168 states have internal predecessors, (197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2024-11-10 15:20:31,828 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 35 [2024-11-10 15:20:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:31,828 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2024-11-10 15:20:31,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.8) internal successors, (72), 36 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:20:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2024-11-10 15:20:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:20:31,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:31,829 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:31,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:20:32,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 15:20:32,034 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:32,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:32,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1327876625, now seen corresponding path program 1 times [2024-11-10 15:20:32,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:32,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323344299] [2024-11-10 15:20:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:32,407 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:20:32,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:32,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323344299] [2024-11-10 15:20:32,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323344299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:32,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795092316] [2024-11-10 15:20:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:32,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:32,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:32,410 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:20:32,411 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:20:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:32,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 15:20:32,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:32,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:20:32,709 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:20:32,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:20:32,736 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 15 treesize of output 1 [2024-11-10 15:20:32,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 15:20:32,905 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 17 treesize of output 9 [2024-11-10 15:20:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:32,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:20:32,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795092316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:32,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:20:32,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2024-11-10 15:20:32,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637783704] [2024-11-10 15:20:32,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:32,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:20:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:32,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:20:32,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:20:32,913 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:33,233 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2024-11-10 15:20:33,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:20:33,233 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-10 15:20:33,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:33,234 INFO L225 Difference]: With dead ends: 175 [2024-11-10 15:20:33,235 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 15:20:33,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-11-10 15:20:33,236 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 18 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:33,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 580 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:20:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 15:20:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2024-11-10 15:20:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 139 states have (on average 1.410071942446043) internal successors, (196), 168 states have internal predecessors, (196), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 202 transitions. [2024-11-10 15:20:33,242 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 202 transitions. Word has length 36 [2024-11-10 15:20:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:33,243 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 202 transitions. [2024-11-10 15:20:33,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 202 transitions. [2024-11-10 15:20:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:20:33,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:33,243 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:33,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 15:20:33,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 15:20:33,444 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:33,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:33,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1795985020, now seen corresponding path program 1 times [2024-11-10 15:20:33,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:33,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125519495] [2024-11-10 15:20:33,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:33,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:33,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125519495] [2024-11-10 15:20:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125519495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:33,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:33,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:20:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292720482] [2024-11-10 15:20:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:33,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:20:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:20:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:20:33,604 INFO L87 Difference]: Start difference. First operand 173 states and 202 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:33,762 INFO L93 Difference]: Finished difference Result 176 states and 201 transitions. [2024-11-10 15:20:33,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:20:33,763 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-11-10 15:20:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:33,764 INFO L225 Difference]: With dead ends: 176 [2024-11-10 15:20:33,764 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 15:20:33,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:20:33,764 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 54 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:33,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 571 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:33,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 15:20:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2024-11-10 15:20:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 135 states have (on average 1.3703703703703705) internal successors, (185), 164 states have internal predecessors, (185), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:33,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 191 transitions. [2024-11-10 15:20:33,769 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 191 transitions. Word has length 37 [2024-11-10 15:20:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:33,769 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 191 transitions. [2024-11-10 15:20:33,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 191 transitions. [2024-11-10 15:20:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:20:33,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:33,770 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:33,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 15:20:33,770 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:33,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:33,770 INFO L85 PathProgramCache]: Analyzing trace with hash -484149396, now seen corresponding path program 1 times [2024-11-10 15:20:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:33,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376888789] [2024-11-10 15:20:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:33,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:34,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:34,171 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:20:34,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:34,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376888789] [2024-11-10 15:20:34,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376888789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:34,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481844040] [2024-11-10 15:20:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:34,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:34,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:34,174 INFO L229 MonitoredProcess]: Starting monitored process 8 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:20:34,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 15:20:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:34,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-10 15:20:34,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:34,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:20:34,401 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:20:34,402 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 11 treesize of output 11 [2024-11-10 15:20:34,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:20:34,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 12 [2024-11-10 15:20:34,550 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:20:34,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:20:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:34,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:20:34,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481844040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:34,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:20:34,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 19 [2024-11-10 15:20:34,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691508555] [2024-11-10 15:20:34,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:34,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:20:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:34,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:20:34,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:20:34,570 INFO L87 Difference]: Start difference. First operand 169 states and 191 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:34,830 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2024-11-10 15:20:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:20:34,830 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-11-10 15:20:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:34,831 INFO L225 Difference]: With dead ends: 174 [2024-11-10 15:20:34,831 INFO L226 Difference]: Without dead ends: 174 [2024-11-10 15:20:34,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:20:34,832 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:34,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 533 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-10 15:20:34,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2024-11-10 15:20:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 135 states have (on average 1.362962962962963) internal successors, (184), 164 states have internal predecessors, (184), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2024-11-10 15:20:34,836 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 38 [2024-11-10 15:20:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:34,836 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2024-11-10 15:20:34,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2024-11-10 15:20:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:20:34,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:34,837 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:34,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 15:20:35,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:35,041 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:35,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:35,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2123729383, now seen corresponding path program 1 times [2024-11-10 15:20:35,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:35,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279287260] [2024-11-10 15:20:35,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:35,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:35,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:35,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:35,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279287260] [2024-11-10 15:20:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279287260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:35,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:35,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:20:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777674975] [2024-11-10 15:20:35,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:35,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:20:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:35,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:20:35,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:20:35,367 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:35,656 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2024-11-10 15:20:35,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:20:35,657 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-10 15:20:35,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:35,657 INFO L225 Difference]: With dead ends: 173 [2024-11-10 15:20:35,658 INFO L226 Difference]: Without dead ends: 173 [2024-11-10 15:20:35,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:20:35,658 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 27 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:35,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 739 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:20:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-10 15:20:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2024-11-10 15:20:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 166 states have internal predecessors, (185), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 191 transitions. [2024-11-10 15:20:35,662 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 191 transitions. Word has length 39 [2024-11-10 15:20:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:35,662 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 191 transitions. [2024-11-10 15:20:35,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 191 transitions. [2024-11-10 15:20:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:20:35,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:35,663 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:35,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 15:20:35,663 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:35,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:35,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1411101430, now seen corresponding path program 1 times [2024-11-10 15:20:35,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:35,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383824738] [2024-11-10 15:20:35,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:35,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:35,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383824738] [2024-11-10 15:20:36,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383824738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:36,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:36,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 15:20:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467167009] [2024-11-10 15:20:36,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:36,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:20:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:20:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:20:36,002 INFO L87 Difference]: Start difference. First operand 171 states and 191 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:36,269 INFO L93 Difference]: Finished difference Result 172 states and 190 transitions. [2024-11-10 15:20:36,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:20:36,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-11-10 15:20:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:36,272 INFO L225 Difference]: With dead ends: 172 [2024-11-10 15:20:36,272 INFO L226 Difference]: Without dead ends: 172 [2024-11-10 15:20:36,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:20:36,272 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:36,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 656 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-10 15:20:36,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2024-11-10 15:20:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 137 states have (on average 1.3430656934306568) internal successors, (184), 166 states have internal predecessors, (184), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 190 transitions. [2024-11-10 15:20:36,277 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 190 transitions. Word has length 40 [2024-11-10 15:20:36,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:36,277 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 190 transitions. [2024-11-10 15:20:36,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 190 transitions. [2024-11-10 15:20:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:20:36,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:36,278 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:36,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 15:20:36,279 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:36,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:36,279 INFO L85 PathProgramCache]: Analyzing trace with hash -794471369, now seen corresponding path program 1 times [2024-11-10 15:20:36,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:36,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963120049] [2024-11-10 15:20:36,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:36,883 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:20:36,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:36,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963120049] [2024-11-10 15:20:36,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963120049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:36,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4594796] [2024-11-10 15:20:36,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:36,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:36,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:36,886 INFO L229 MonitoredProcess]: Starting monitored process 9 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:20:36,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:20:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:37,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 15:20:37,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:37,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:20:37,150 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:20:37,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:20:37,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:20:37,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-11-10 15:20:37,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 37 treesize of output 18 [2024-11-10 15:20:37,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:37,576 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 35 treesize of output 13 [2024-11-10 15:20:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:37,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:20:37,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4594796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:37,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:20:37,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 26 [2024-11-10 15:20:37,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002218831] [2024-11-10 15:20:37,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:37,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:20:37,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:37,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:20:37,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2024-11-10 15:20:37,582 INFO L87 Difference]: Start difference. First operand 171 states and 190 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:37,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:37,972 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2024-11-10 15:20:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:20:37,973 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2024-11-10 15:20:37,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:37,974 INFO L225 Difference]: With dead ends: 171 [2024-11-10 15:20:37,974 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 15:20:37,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2024-11-10 15:20:37,975 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 14 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:37,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 475 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:20:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 15:20:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-10 15:20:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 166 states have internal predecessors, (183), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 189 transitions. [2024-11-10 15:20:37,978 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 189 transitions. Word has length 41 [2024-11-10 15:20:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:37,979 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 189 transitions. [2024-11-10 15:20:37,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 189 transitions. [2024-11-10 15:20:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:20:37,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:37,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2024-11-10 15:20:37,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:20:38,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-10 15:20:38,184 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:38,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash 204586687, now seen corresponding path program 1 times [2024-11-10 15:20:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:38,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303632811] [2024-11-10 15:20:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:38,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:38,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:38,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:20:38,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:38,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303632811] [2024-11-10 15:20:38,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303632811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:38,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122361260] [2024-11-10 15:20:38,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:38,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:38,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:38,463 INFO L229 MonitoredProcess]: Starting monitored process 10 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:20:38,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:20:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:38,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 15:20:38,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:20:38,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:20:38,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:38,976 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 19 treesize of output 23 [2024-11-10 15:20:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:20:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122361260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:20:39,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:20:39,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 20 [2024-11-10 15:20:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202671927] [2024-11-10 15:20:39,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:20:39,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 15:20:39,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:39,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 15:20:39,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:20:39,096 INFO L87 Difference]: Start difference. First operand 171 states and 189 transitions. Second operand has 21 states, 20 states have (on average 5.0) internal successors, (100), 19 states have internal predecessors, (100), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:20:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:39,387 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2024-11-10 15:20:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:20:39,388 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.0) internal successors, (100), 19 states have internal predecessors, (100), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 45 [2024-11-10 15:20:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:39,389 INFO L225 Difference]: With dead ends: 174 [2024-11-10 15:20:39,389 INFO L226 Difference]: Without dead ends: 174 [2024-11-10 15:20:39,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-11-10 15:20:39,390 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 51 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:39,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 753 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:20:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-10 15:20:39,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2024-11-10 15:20:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 137 states have (on average 1.313868613138686) internal successors, (180), 166 states have internal predecessors, (180), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 186 transitions. [2024-11-10 15:20:39,393 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 186 transitions. Word has length 45 [2024-11-10 15:20:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:39,394 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 186 transitions. [2024-11-10 15:20:39,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.0) internal successors, (100), 19 states have internal predecessors, (100), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:20:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2024-11-10 15:20:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:20:39,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:39,395 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:39,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:20:39,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:39,595 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:39,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1729996591, now seen corresponding path program 1 times [2024-11-10 15:20:39,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:39,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292066089] [2024-11-10 15:20:39,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:39,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:40,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:40,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292066089] [2024-11-10 15:20:40,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292066089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:40,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:40,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 15:20:40,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424033497] [2024-11-10 15:20:40,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:40,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 15:20:40,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:40,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 15:20:40,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:20:40,009 INFO L87 Difference]: Start difference. First operand 171 states and 186 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:40,345 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2024-11-10 15:20:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:20:40,346 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-11-10 15:20:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:40,346 INFO L225 Difference]: With dead ends: 171 [2024-11-10 15:20:40,346 INFO L226 Difference]: Without dead ends: 171 [2024-11-10 15:20:40,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:20:40,347 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:40,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 625 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:20:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-10 15:20:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-10 15:20:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 137 states have (on average 1.3065693430656935) internal successors, (179), 166 states have internal predecessors, (179), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:20:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2024-11-10 15:20:40,350 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 45 [2024-11-10 15:20:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:40,351 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2024-11-10 15:20:40,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 13 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:40,351 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2024-11-10 15:20:40,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:20:40,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:40,352 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:40,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 15:20:40,352 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:40,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2047220000, now seen corresponding path program 1 times [2024-11-10 15:20:40,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:40,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674773512] [2024-11-10 15:20:40,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:40,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:40,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:40,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:20:40,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:40,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674773512] [2024-11-10 15:20:40,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674773512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:40,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91067669] [2024-11-10 15:20:40,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:40,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:40,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:40,778 INFO L229 MonitoredProcess]: Starting monitored process 11 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:20:40,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:20:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:41,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 15:20:41,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:41,113 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:20:41,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:20:41,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:20:41,141 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:20:41,141 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 11 treesize of output 11 [2024-11-10 15:20:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:20:41,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:20:41,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91067669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:41,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:20:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2024-11-10 15:20:41,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054255470] [2024-11-10 15:20:41,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:20:41,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 15:20:41,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:41,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 15:20:41,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=661, Unknown=1, NotChecked=52, Total=812 [2024-11-10 15:20:41,429 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 21 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:20:41,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:41,806 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2024-11-10 15:20:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:20:41,806 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 21 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-11-10 15:20:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:41,807 INFO L225 Difference]: With dead ends: 224 [2024-11-10 15:20:41,807 INFO L226 Difference]: Without dead ends: 224 [2024-11-10 15:20:41,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=818, Unknown=1, NotChecked=58, Total=992 [2024-11-10 15:20:41,808 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 90 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:41,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 933 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 714 Invalid, 0 Unknown, 175 Unchecked, 0.3s Time] [2024-11-10 15:20:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-10 15:20:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 193. [2024-11-10 15:20:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.3227848101265822) internal successors, (209), 187 states have internal predecessors, (209), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:20:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2024-11-10 15:20:41,812 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 46 [2024-11-10 15:20:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:41,812 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2024-11-10 15:20:41,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 21 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:20:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2024-11-10 15:20:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:20:41,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:41,813 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 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:20:41,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-10 15:20:42,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-10 15:20:42,014 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:42,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1337176121, now seen corresponding path program 1 times [2024-11-10 15:20:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031488253] [2024-11-10 15:20:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:42,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:42,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:42,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 15:20:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:20:42,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:42,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031488253] [2024-11-10 15:20:42,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031488253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:42,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191178899] [2024-11-10 15:20:42,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:42,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:42,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:42,563 INFO L229 MonitoredProcess]: Starting monitored process 12 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:20:42,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:20:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:42,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 15:20:42,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:42,885 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:20:42,886 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 11 treesize of output 11 [2024-11-10 15:20:42,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:20:42,944 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:20:42,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:20:42,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:20:42,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:20:43,016 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:20:43,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:20:43,023 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 31 treesize of output 13 [2024-11-10 15:20:43,037 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-10 15:20:43,060 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:20:43,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:20:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2024-11-10 15:20:43,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:20:43,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191178899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:43,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:20:43,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2024-11-10 15:20:43,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593797863] [2024-11-10 15:20:43,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:20:43,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 15:20:43,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:43,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 15:20:43,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=481, Unknown=1, NotChecked=44, Total=600 [2024-11-10 15:20:43,103 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 20 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:20:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:43,469 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2024-11-10 15:20:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:20:43,469 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 20 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-11-10 15:20:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:43,470 INFO L225 Difference]: With dead ends: 190 [2024-11-10 15:20:43,470 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 15:20:43,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=805, Unknown=1, NotChecked=58, Total=992 [2024-11-10 15:20:43,471 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 19 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:43,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 762 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 626 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2024-11-10 15:20:43,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 15:20:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-10 15:20:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 158 states have (on average 1.2848101265822784) internal successors, (203), 184 states have internal predecessors, (203), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:20:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 211 transitions. [2024-11-10 15:20:43,475 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 211 transitions. Word has length 48 [2024-11-10 15:20:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:43,475 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 211 transitions. [2024-11-10 15:20:43,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.652173913043478) internal successors, (61), 20 states have internal predecessors, (61), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:20:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 211 transitions. [2024-11-10 15:20:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:20:43,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:43,476 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 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:20:43,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-10 15:20:43,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-10 15:20:43,677 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:43,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:43,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1337176122, now seen corresponding path program 1 times [2024-11-10 15:20:43,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:43,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412817017] [2024-11-10 15:20:43,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:44,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:44,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 15:20:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:20:44,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:44,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412817017] [2024-11-10 15:20:44,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412817017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:44,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53118280] [2024-11-10 15:20:44,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:44,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:44,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:44,462 INFO L229 MonitoredProcess]: Starting monitored process 13 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:20:44,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:20:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:44,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-10 15:20:44,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:44,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:20:44,827 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:20:44,827 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 11 treesize of output 11 [2024-11-10 15:20:44,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:20:44,856 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 13 treesize of output 9 [2024-11-10 15:20:44,940 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:20:44,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-10 15:20:44,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:20:45,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:20:45,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-10 15:20:45,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:20:45,102 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:20:45,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-10 15:20:45,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:20:45,119 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 42 treesize of output 18 [2024-11-10 15:20:45,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:20:45,196 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:20:45,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:20:45,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:20:45,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:20:45,234 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 11 treesize of output 11 [2024-11-10 15:20:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-10 15:20:45,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:20:45,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53118280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:45,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:20:45,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2024-11-10 15:20:45,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158977869] [2024-11-10 15:20:45,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:20:45,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 15:20:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:45,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 15:20:45,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=951, Unknown=1, NotChecked=62, Total=1122 [2024-11-10 15:20:45,335 INFO L87 Difference]: Start difference. First operand 190 states and 211 transitions. Second operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 25 states have internal predecessors, (69), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:20:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:46,065 INFO L93 Difference]: Finished difference Result 185 states and 201 transitions. [2024-11-10 15:20:46,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:20:46,065 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 25 states have internal predecessors, (69), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 48 [2024-11-10 15:20:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:46,066 INFO L225 Difference]: With dead ends: 185 [2024-11-10 15:20:46,066 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 15:20:46,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=1663, Unknown=1, NotChecked=84, Total=1980 [2024-11-10 15:20:46,067 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 34 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:46,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1051 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1064 Invalid, 0 Unknown, 104 Unchecked, 0.5s Time] [2024-11-10 15:20:46,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 15:20:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-10 15:20:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 158 states have (on average 1.2215189873417722) internal successors, (193), 179 states have internal predecessors, (193), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:20:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 201 transitions. [2024-11-10 15:20:46,071 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 201 transitions. Word has length 48 [2024-11-10 15:20:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:46,071 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 201 transitions. [2024-11-10 15:20:46,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 25 states have internal predecessors, (69), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-10 15:20:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 201 transitions. [2024-11-10 15:20:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:20:46,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:46,072 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:46,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-10 15:20:46,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-10 15:20:46,274 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:46,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:46,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1279101509, now seen corresponding path program 1 times [2024-11-10 15:20:46,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:46,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110790496] [2024-11-10 15:20:46,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:46,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:46,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110790496] [2024-11-10 15:20:46,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110790496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:20:46,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:20:46,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:20:46,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897478684] [2024-11-10 15:20:46,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:20:46,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:20:46,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:46,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:20:46,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:20:46,410 INFO L87 Difference]: Start difference. First operand 185 states and 201 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:46,615 INFO L93 Difference]: Finished difference Result 190 states and 208 transitions. [2024-11-10 15:20:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:20:46,616 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-11-10 15:20:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:46,617 INFO L225 Difference]: With dead ends: 190 [2024-11-10 15:20:46,617 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 15:20:46,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:20:46,618 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 30 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:46,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 465 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:20:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 15:20:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2024-11-10 15:20:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 162 states have (on average 1.2345679012345678) internal successors, (200), 183 states have internal predecessors, (200), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:20:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 208 transitions. [2024-11-10 15:20:46,622 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 208 transitions. Word has length 48 [2024-11-10 15:20:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:46,622 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 208 transitions. [2024-11-10 15:20:46,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:20:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 208 transitions. [2024-11-10 15:20:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-10 15:20:46,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:46,623 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:46,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 15:20:46,625 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:46,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 57284179, now seen corresponding path program 1 times [2024-11-10 15:20:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:46,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227122220] [2024-11-10 15:20:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:46,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:47,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:20:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:47,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 15:20:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:20:47,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227122220] [2024-11-10 15:20:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227122220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:47,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139335987] [2024-11-10 15:20:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:47,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:47,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:47,388 INFO L229 MonitoredProcess]: Starting monitored process 14 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:20:47,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 15:20:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:47,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-10 15:20:47,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:47,688 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:20:47,689 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 11 treesize of output 11 [2024-11-10 15:20:47,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:20:47,749 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:20:47,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:20:47,791 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:20:47,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:20:47,843 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:20:47,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:20:47,853 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 31 treesize of output 13 [2024-11-10 15:20:47,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:20:47,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:20:47,940 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 11 treesize of output 11 [2024-11-10 15:20:47,969 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 13 treesize of output 9 [2024-11-10 15:20:47,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:20:48,057 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:20:48,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 85 [2024-11-10 15:20:48,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2024-11-10 15:20:48,126 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 46 treesize of output 22 [2024-11-10 15:20:48,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-10 15:20:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:20:48,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:20:52,326 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (let ((.cse3 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2)) (.cse1 (select |c_#memory_$Pointer$#0.offset| .cse0))) (and (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_16| Int)) (or (forall ((v_ArrVal_3521 Int)) (or (< v_ArrVal_3521 |c_ULTIMATE.start_create_~now~0#1.offset|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 (store .cse1 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_16| 16) v_ArrVal_3521)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) 1)))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_16| .cse3))) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_16| Int)) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_16| .cse3) (forall ((v_ArrVal_3521 Int)) (or (forall ((v_ArrVal_3522 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 (store .cse1 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_16| 16) v_ArrVal_3521)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3522) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2)))) (< v_ArrVal_3521 |c_ULTIMATE.start_create_~now~0#1.offset|))))))))) is different from false [2024-11-10 15:20:52,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:52,393 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 64 [2024-11-10 15:20:52,398 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 100 treesize of output 82 [2024-11-10 15:20:52,405 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 61 treesize of output 53 [2024-11-10 15:20:53,065 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-10 15:20:53,065 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 58 treesize of output 57 [2024-11-10 15:20:53,078 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3512 (Array Int Int)) (v_ArrVal_3513 (Array Int Int)) (v_ArrVal_3514 (Array Int Int))) (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3512))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3513)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3514)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) |c_ULTIMATE.start_create_#t~mem11#1.base|)) is different from false [2024-11-10 15:20:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-11-10 15:20:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139335987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:20:53,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:20:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 50 [2024-11-10 15:20:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411228255] [2024-11-10 15:20:53,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:20:53,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-10 15:20:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:53,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 15:20:53,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2145, Unknown=29, NotChecked=190, Total=2550 [2024-11-10 15:20:53,238 INFO L87 Difference]: Start difference. First operand 189 states and 208 transitions. Second operand has 51 states, 50 states have (on average 2.04) internal successors, (102), 43 states have internal predecessors, (102), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 15:20:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:20:54,546 INFO L93 Difference]: Finished difference Result 188 states and 206 transitions. [2024-11-10 15:20:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:20:54,547 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.04) internal successors, (102), 43 states have internal predecessors, (102), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2024-11-10 15:20:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:20:54,548 INFO L225 Difference]: With dead ends: 188 [2024-11-10 15:20:54,548 INFO L226 Difference]: Without dead ends: 188 [2024-11-10 15:20:54,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=303, Invalid=2868, Unknown=29, NotChecked=222, Total=3422 [2024-11-10 15:20:54,549 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 30 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 15:20:54,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1854 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1272 Invalid, 0 Unknown, 79 Unchecked, 0.9s Time] [2024-11-10 15:20:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-10 15:20:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-10 15:20:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 162 states have (on average 1.2222222222222223) internal successors, (198), 182 states have internal predecessors, (198), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:20:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 206 transitions. [2024-11-10 15:20:54,553 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 206 transitions. Word has length 54 [2024-11-10 15:20:54,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:20:54,553 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 206 transitions. [2024-11-10 15:20:54,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.04) internal successors, (102), 43 states have internal predecessors, (102), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-10 15:20:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 206 transitions. [2024-11-10 15:20:54,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 15:20:54,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:20:54,556 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:20:54,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-10 15:20:54,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-10 15:20:54,757 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:20:54,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:20:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1013254570, now seen corresponding path program 1 times [2024-11-10 15:20:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:20:54,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70954735] [2024-11-10 15:20:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:20:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:55,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:20:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:55,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:20:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70954735] [2024-11-10 15:20:55,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70954735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:20:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723046954] [2024-11-10 15:20:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:20:55,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:20:55,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:20:55,659 INFO L229 MonitoredProcess]: Starting monitored process 15 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:20:55,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-10 15:20:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:20:55,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-10 15:20:55,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:20:55,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:20:55,939 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:20:55,946 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:20:55,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:20:55,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:20:56,121 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:20:56,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:20:56,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:20:56,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-10 15:20:56,203 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:20:56,203 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:20:56,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-10 15:20:56,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:20:56,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:20:56,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-10 15:20:56,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:56,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 32 [2024-11-10 15:20:56,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:20:56,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:20:56,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:56,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2024-11-10 15:20:56,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:56,830 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 17 treesize of output 15 [2024-11-10 15:20:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:56,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:20:57,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 24))) (and (forall ((v_ArrVal_3646 Int) (v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3643 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_3641))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_3643) .cse1 v_ArrVal_3646))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0)) (forall ((v_ArrVal_3647 Int) (v_ArrVal_3642 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data2~0#1.base| v_ArrVal_3642))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |c_ULTIMATE.start_create_~data1~0#1.base|) .cse1 v_ArrVal_3647))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0)))) is different from false [2024-11-10 15:20:58,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:58,787 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2024-11-10 15:20:58,791 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 188 treesize of output 182 [2024-11-10 15:20:58,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:58,807 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 147 treesize of output 147 [2024-11-10 15:20:58,819 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 100 treesize of output 98 [2024-11-10 15:20:58,836 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 118 treesize of output 114 [2024-11-10 15:20:59,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:59,032 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2024-11-10 15:20:59,035 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 198 treesize of output 190 [2024-11-10 15:20:59,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:20:59,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 155 treesize of output 161 [2024-11-10 15:20:59,061 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 158 treesize of output 154 [2024-11-10 15:20:59,068 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 234 treesize of output 226 [2024-11-10 15:20:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:20:59,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723046954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:20:59,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:20:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 51 [2024-11-10 15:20:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535235920] [2024-11-10 15:20:59,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:20:59,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-10 15:20:59,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:20:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 15:20:59,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2278, Unknown=6, NotChecked=96, Total=2550 [2024-11-10 15:20:59,523 INFO L87 Difference]: Start difference. First operand 188 states and 206 transitions. Second operand has 51 states, 51 states have (on average 2.627450980392157) internal successors, (134), 47 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:21:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:01,191 INFO L93 Difference]: Finished difference Result 193 states and 211 transitions. [2024-11-10 15:21:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:21:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.627450980392157) internal successors, (134), 47 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-10 15:21:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:01,193 INFO L225 Difference]: With dead ends: 193 [2024-11-10 15:21:01,193 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 15:21:01,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=265, Invalid=3155, Unknown=6, NotChecked=114, Total=3540 [2024-11-10 15:21:01,194 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 38 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:01,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1502 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1286 Invalid, 0 Unknown, 69 Unchecked, 1.1s Time] [2024-11-10 15:21:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 15:21:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-10 15:21:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 167 states have (on average 1.215568862275449) internal successors, (203), 187 states have internal predecessors, (203), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:21:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 211 transitions. [2024-11-10 15:21:01,198 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 211 transitions. Word has length 53 [2024-11-10 15:21:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:01,198 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 211 transitions. [2024-11-10 15:21:01,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.627450980392157) internal successors, (134), 47 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:21:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 211 transitions. [2024-11-10 15:21:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 15:21:01,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:01,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:01,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-10 15:21:01,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:01,404 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:21:01,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2027241849, now seen corresponding path program 1 times [2024-11-10 15:21:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198077709] [2024-11-10 15:21:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:01,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:01,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 15:21:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:21:01,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:01,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198077709] [2024-11-10 15:21:01,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198077709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:01,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464324616] [2024-11-10 15:21:01,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:01,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:01,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:01,684 INFO L229 MonitoredProcess]: Starting monitored process 16 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:21:01,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 15:21:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:01,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-10 15:21:01,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:02,131 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:02,131 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:21:02,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:21:02,236 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:02,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-11-10 15:21:02,287 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:02,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-11-10 15:21:02,330 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:02,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-11-10 15:21:02,436 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 30 treesize of output 12 [2024-11-10 15:21:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:02,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:02,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3851 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem13#1.base| v_ArrVal_3851) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-11-10 15:21:02,610 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3851 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_3851) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-11-10 15:21:02,721 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3850 (Array Int Int)) (v_ArrVal_3851 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_3849))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3850)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3851))) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-11-10 15:21:02,726 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3850 (Array Int Int)) (v_ArrVal_3851 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3849))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3850)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3851))) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-11-10 15:21:02,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:02,734 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 60 [2024-11-10 15:21:02,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:02,743 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 4621 treesize of output 3750 [2024-11-10 15:21:02,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:02,826 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 810 treesize of output 607 [2024-11-10 15:21:02,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:02,849 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 598 treesize of output 535 [2024-11-10 15:21:02,862 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 526 treesize of output 498 [2024-11-10 15:21:03,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464324616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:03,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:03,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17] total 26 [2024-11-10 15:21:03,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452215609] [2024-11-10 15:21:03,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:03,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 15:21:03,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:03,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 15:21:03,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=995, Unknown=44, NotChecked=268, Total=1406 [2024-11-10 15:21:03,167 INFO L87 Difference]: Start difference. First operand 193 states and 211 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 22 states have internal predecessors, (95), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:21:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:03,979 INFO L93 Difference]: Finished difference Result 199 states and 216 transitions. [2024-11-10 15:21:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:21:03,979 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 22 states have internal predecessors, (95), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2024-11-10 15:21:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:03,980 INFO L225 Difference]: With dead ends: 199 [2024-11-10 15:21:03,980 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 15:21:03,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=2186, Unknown=56, NotChecked=396, Total=2862 [2024-11-10 15:21:03,981 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 58 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:03,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1116 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:21:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 15:21:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 194. [2024-11-10 15:21:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.1823529411764706) internal successors, (201), 188 states have internal predecessors, (201), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:21:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 209 transitions. [2024-11-10 15:21:03,984 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 209 transitions. Word has length 55 [2024-11-10 15:21:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:03,985 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 209 transitions. [2024-11-10 15:21:03,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 22 states have internal predecessors, (95), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:21:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 209 transitions. [2024-11-10 15:21:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 15:21:03,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:03,986 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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, 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:21:04,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-10 15:21:04,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:04,191 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-11-10 15:21:04,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1219895404, now seen corresponding path program 1 times [2024-11-10 15:21:04,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:04,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819985579] [2024-11-10 15:21:04,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:04,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:05,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:05,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:05,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819985579] [2024-11-10 15:21:05,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819985579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:05,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610283189] [2024-11-10 15:21:05,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:05,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:05,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:05,583 INFO L229 MonitoredProcess]: Starting monitored process 17 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:21:05,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-10 15:21:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:05,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-10 15:21:05,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:06,640 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 15 treesize of output 1 [2024-11-10 15:21:06,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 458 treesize of output 342 [2024-11-10 15:21:11,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:21:11,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:11,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1624 treesize of output 814