./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-before.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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/sll-shared-before.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 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:33:28,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:33:28,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-12 13:33:28,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:33:28,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:33:28,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:33:28,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:33:28,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:33:28,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:33:28,839 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:33:28,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:33:28,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:33:28,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:33:28,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:33:28,840 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:33:28,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:33:28,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:33:28,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:33:28,842 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:33:28,842 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:33:28,842 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:33:28,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:33:28,843 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:33:28,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:33:28,844 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:33:28,844 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:33:28,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:33:28,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:33:28,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:33:28,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:33:28,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:33:28,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:33:28,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:33:28,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:33:28,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:33:28,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:33:28,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:33:28,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:33:28,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:33:28,849 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 -> 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f [2024-11-12 13:33:29,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:33:29,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:33:29,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:33:29,075 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:33:29,075 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:33:29,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2024-11-12 13:33:30,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:33:30,621 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:33:30,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2024-11-12 13:33:30,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b54e690/da6106884e4d45148820ffecd4ad8439/FLAG0c6b9fa5b [2024-11-12 13:33:30,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b54e690/da6106884e4d45148820ffecd4ad8439 [2024-11-12 13:33:30,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:33:30,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:33:30,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:33:30,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:33:30,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:33:30,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:33:30" (1/1) ... [2024-11-12 13:33:30,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646cf72a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:30, skipping insertion in model container [2024-11-12 13:33:30,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:33:30" (1/1) ... [2024-11-12 13:33:30,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:33:30,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:33:30,965 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:33:31,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:33:31,039 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:33:31,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31 WrapperNode [2024-11-12 13:33:31,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:33:31,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:33:31,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:33:31,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:33:31,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,080 INFO L138 Inliner]: procedures = 120, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-12 13:33:31,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:33:31,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:33:31,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:33:31,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:33:31,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,113 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2024-11-12 13:33:31,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:33:31,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:33:31,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:33:31,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:33:31,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (1/1) ... [2024-11-12 13:33:31,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:33:31,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:31,170 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-12 13:33:31,174 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-12 13:33:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:33:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-12 13:33:31,211 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-12 13:33:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:33:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:33:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:33:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:33:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:33:31,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:33:31,329 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:33:31,331 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:33:31,512 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-11-12 13:33:31,512 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:33:31,531 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:33:31,534 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 13:33:31,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:33:31 BoogieIcfgContainer [2024-11-12 13:33:31,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:33:31,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:33:31,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:33:31,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:33:31,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:33:30" (1/3) ... [2024-11-12 13:33:31,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241c543e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:33:31, skipping insertion in model container [2024-11-12 13:33:31,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:33:31" (2/3) ... [2024-11-12 13:33:31,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241c543e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:33:31, skipping insertion in model container [2024-11-12 13:33:31,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:33:31" (3/3) ... [2024-11-12 13:33:31,542 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-shared-before.i [2024-11-12 13:33:31,556 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:33:31,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-12 13:33:31,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:33:31,604 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;@7619a211, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:33:31,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-12 13:33:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 56 states have internal predecessors, (60), 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-12 13:33:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 13:33:31,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:31,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 13:33:31,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:31,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:31,621 INFO L85 PathProgramCache]: Analyzing trace with hash 35815, now seen corresponding path program 1 times [2024-11-12 13:33:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:31,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193513783] [2024-11-12 13:33:31,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:31,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:31,784 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-12 13:33:31,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:31,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193513783] [2024-11-12 13:33:31,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193513783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:31,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:31,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:33:31,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844489850] [2024-11-12 13:33:31,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:31,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:33:31,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:31,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:33:31,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:33:31,813 INFO L87 Difference]: Start difference. First operand has 60 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 56 states have internal predecessors, (60), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:33:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:31,914 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2024-11-12 13:33:31,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:33:31,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-12 13:33:31,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:31,923 INFO L225 Difference]: With dead ends: 59 [2024-11-12 13:33:31,923 INFO L226 Difference]: Without dead ends: 57 [2024-11-12 13:33:31,924 INFO L434 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-12 13:33:31,927 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:31,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-12 13:33:31,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-12 13:33:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.71875) internal successors, (55), 53 states have internal predecessors, (55), 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-12 13:33:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2024-11-12 13:33:31,955 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 3 [2024-11-12 13:33:31,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:31,955 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2024-11-12 13:33:31,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:33:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2024-11-12 13:33:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 13:33:31,956 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:31,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 13:33:31,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:33:31,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:31,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:31,958 INFO L85 PathProgramCache]: Analyzing trace with hash 35816, now seen corresponding path program 1 times [2024-11-12 13:33:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:31,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882552807] [2024-11-12 13:33:31,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:31,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,033 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-12 13:33:32,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:32,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882552807] [2024-11-12 13:33:32,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882552807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:32,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:32,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:33:32,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117806788] [2024-11-12 13:33:32,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:32,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:33:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:32,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:33:32,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:33:32,036 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:33:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:32,069 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-11-12 13:33:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:33:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-12 13:33:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:32,070 INFO L225 Difference]: With dead ends: 56 [2024-11-12 13:33:32,070 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 13:33:32,071 INFO L434 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-12 13:33:32,072 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:32,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:33:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 13:33:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 13:33:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.6875) internal successors, (54), 52 states have internal predecessors, (54), 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-12 13:33:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2024-11-12 13:33:32,076 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 3 [2024-11-12 13:33:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:32,076 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-12 13:33:32,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:33:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2024-11-12 13:33:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:33:32,077 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:32,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:32,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:33:32,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:32,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1284320017, now seen corresponding path program 1 times [2024-11-12 13:33:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430796089] [2024-11-12 13:33:32,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:32,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,134 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-12 13:33:32,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:32,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430796089] [2024-11-12 13:33:32,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430796089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:32,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:32,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:33:32,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707769300] [2024-11-12 13:33:32,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:32,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:33:32,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:32,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:33:32,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:33:32,136 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12 13:33:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:32,168 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2024-11-12 13:33:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:33:32,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-11-12 13:33:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:32,170 INFO L225 Difference]: With dead ends: 55 [2024-11-12 13:33:32,170 INFO L226 Difference]: Without dead ends: 55 [2024-11-12 13:33:32,170 INFO L434 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-12 13:33:32,171 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:32,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:33:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-12 13:33:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-12 13:33:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.65625) internal successors, (53), 51 states have internal predecessors, (53), 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-12 13:33:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2024-11-12 13:33:32,175 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 7 [2024-11-12 13:33:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:32,176 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-11-12 13:33:32,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12 13:33:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2024-11-12 13:33:32,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:33:32,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:32,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:32,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:33:32,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:32,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1284320016, now seen corresponding path program 1 times [2024-11-12 13:33:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632305244] [2024-11-12 13:33:32,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,264 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-12 13:33:32,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:32,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632305244] [2024-11-12 13:33:32,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632305244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:32,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:32,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:33:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245002653] [2024-11-12 13:33:32,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:32,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:33:32,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:32,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:33:32,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:33:32,267 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12 13:33:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:32,293 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2024-11-12 13:33:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:33:32,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-11-12 13:33:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:32,295 INFO L225 Difference]: With dead ends: 54 [2024-11-12 13:33:32,295 INFO L226 Difference]: Without dead ends: 54 [2024-11-12 13:33:32,296 INFO L434 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-12 13:33:32,296 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:32,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:33:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-12 13:33:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-12 13:33:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.625) internal successors, (52), 50 states have internal predecessors, (52), 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-12 13:33:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-11-12 13:33:32,304 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 7 [2024-11-12 13:33:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:32,305 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-11-12 13:33:32,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12 13:33:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2024-11-12 13:33:32,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 13:33:32,306 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:32,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:32,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:33:32,306 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:32,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:32,307 INFO L85 PathProgramCache]: Analyzing trace with hash -40963897, now seen corresponding path program 1 times [2024-11-12 13:33:32,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:32,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053632276] [2024-11-12 13:33:32,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:32,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:32,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:32,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053632276] [2024-11-12 13:33:32,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053632276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:32,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:32,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:33:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351126702] [2024-11-12 13:33:32,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:32,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:33:32,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:32,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:33:32,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:33:32,461 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 13:33:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:32,562 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-11-12 13:33:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:33:32,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2024-11-12 13:33:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:32,564 INFO L225 Difference]: With dead ends: 56 [2024-11-12 13:33:32,564 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 13:33:32,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:33:32,565 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:32,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 13:33:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-12 13:33:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.53125) internal successors, (49), 47 states have internal predecessors, (49), 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-12 13:33:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2024-11-12 13:33:32,570 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 12 [2024-11-12 13:33:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:32,570 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-11-12 13:33:32,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 13:33:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2024-11-12 13:33:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 13:33:32,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:32,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:32,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:33:32,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:32,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:32,572 INFO L85 PathProgramCache]: Analyzing trace with hash -40963896, now seen corresponding path program 1 times [2024-11-12 13:33:32,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:32,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638772000] [2024-11-12 13:33:32,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:32,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:32,770 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-12 13:33:32,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:32,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638772000] [2024-11-12 13:33:32,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638772000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:32,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:32,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:33:32,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024410061] [2024-11-12 13:33:32,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:32,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:33:32,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:32,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:33:32,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:33:32,772 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 13:33:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:32,904 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-11-12 13:33:32,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:33:32,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2024-11-12 13:33:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:32,919 INFO L225 Difference]: With dead ends: 55 [2024-11-12 13:33:32,919 INFO L226 Difference]: Without dead ends: 55 [2024-11-12 13:33:32,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:33:32,920 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:32,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 190 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:32,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-12 13:33:32,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-11-12 13:33:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.5) internal successors, (48), 46 states have internal predecessors, (48), 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-12 13:33:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-11-12 13:33:32,930 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 12 [2024-11-12 13:33:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:32,930 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-12 13:33:32,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-12 13:33:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2024-11-12 13:33:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:33:32,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:32,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:32,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:33:32,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:32,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash 694727655, now seen corresponding path program 1 times [2024-11-12 13:33:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:32,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964239381] [2024-11-12 13:33:32,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:32,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,034 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-12 13:33:33,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:33,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964239381] [2024-11-12 13:33:33,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964239381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:33,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:33,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:33:33,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633801434] [2024-11-12 13:33:33,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:33,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:33:33,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:33,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:33:33,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:33:33,036 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12 13:33:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:33,097 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2024-11-12 13:33:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:33:33,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-12 13:33:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:33,098 INFO L225 Difference]: With dead ends: 49 [2024-11-12 13:33:33,098 INFO L226 Difference]: Without dead ends: 49 [2024-11-12 13:33:33,098 INFO L434 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-12 13:33:33,099 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:33,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-12 13:33:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-12 13:33:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.46875) internal successors, (47), 45 states have internal predecessors, (47), 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-12 13:33:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2024-11-12 13:33:33,113 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 17 [2024-11-12 13:33:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:33,113 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2024-11-12 13:33:33,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12 13:33:33,113 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2024-11-12 13:33:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:33:33,114 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:33,114 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:33,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:33:33,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:33,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:33,114 INFO L85 PathProgramCache]: Analyzing trace with hash 61720908, now seen corresponding path program 1 times [2024-11-12 13:33:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:33,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309418510] [2024-11-12 13:33:33,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:33,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,212 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-12 13:33:33,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:33,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309418510] [2024-11-12 13:33:33,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309418510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:33,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:33,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:33:33,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840150774] [2024-11-12 13:33:33,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:33,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:33:33,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:33:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:33:33,221 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-12 13:33:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:33,282 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-11-12 13:33:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:33:33,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 18 [2024-11-12 13:33:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:33,286 INFO L225 Difference]: With dead ends: 48 [2024-11-12 13:33:33,286 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 13:33:33,287 INFO L434 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-12 13:33:33,288 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:33,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 81 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 13:33:33,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-12 13:33:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.4375) internal successors, (46), 44 states have internal predecessors, (46), 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-12 13:33:33,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-11-12 13:33:33,296 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 18 [2024-11-12 13:33:33,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:33,296 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-11-12 13:33:33,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-12 13:33:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-11-12 13:33:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:33:33,297 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:33,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:33,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:33:33,297 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:33,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1913348233, now seen corresponding path program 1 times [2024-11-12 13:33:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:33,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692596716] [2024-11-12 13:33:33,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,487 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-12 13:33:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:33,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692596716] [2024-11-12 13:33:33,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692596716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:33,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:33,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:33:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380164599] [2024-11-12 13:33:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:33,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:33:33,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:33,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:33:33,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:33:33,494 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-12 13:33:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:33,610 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2024-11-12 13:33:33,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:33:33,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 19 [2024-11-12 13:33:33,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:33,611 INFO L225 Difference]: With dead ends: 47 [2024-11-12 13:33:33,611 INFO L226 Difference]: Without dead ends: 47 [2024-11-12 13:33:33,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12 13:33:33,612 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:33,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 68 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:33,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-12 13:33:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-12 13:33:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.40625) internal successors, (45), 43 states have internal predecessors, (45), 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-12 13:33:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2024-11-12 13:33:33,615 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 19 [2024-11-12 13:33:33,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:33,615 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2024-11-12 13:33:33,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-12 13:33:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2024-11-12 13:33:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:33:33,616 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:33,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:33,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:33:33,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:33,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:33,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1882162804, now seen corresponding path program 1 times [2024-11-12 13:33:33,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:33,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911075398] [2024-11-12 13:33:33,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:33,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911075398] [2024-11-12 13:33:33,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911075398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024652975] [2024-11-12 13:33:33,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:33,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:33,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:33,850 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-12 13:33:33,852 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-12 13:33:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:33,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 13:33:33,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:33,982 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-12 13:33:34,039 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 13:33:34,040 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-12 13:33:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:34,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:33:34,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024652975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:34,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:33:34,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-12 13:33:34,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479414753] [2024-11-12 13:33:34,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:34,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:33:34,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:34,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:33:34,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-12 13:33:34,049 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-12 13:33:34,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:34,092 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-11-12 13:33:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:33:34,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 21 [2024-11-12 13:33:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:34,093 INFO L225 Difference]: With dead ends: 53 [2024-11-12 13:33:34,093 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 13:33:34,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-12 13:33:34,094 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:34,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 77 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 67 Unchecked, 0.0s Time] [2024-11-12 13:33:34,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 13:33:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-12 13:33:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 46 states have internal predecessors, (50), 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-12 13:33:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-12 13:33:34,097 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 21 [2024-11-12 13:33:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:34,097 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-12 13:33:34,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-12 13:33:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-12 13:33:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:33:34,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:34,098 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:34,114 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-12 13:33:34,301 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,SelfDestructingSolverStorable9 [2024-11-12 13:33:34,302 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:34,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1882162805, now seen corresponding path program 1 times [2024-11-12 13:33:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:34,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431100246] [2024-11-12 13:33:34,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:34,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:34,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:34,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:34,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431100246] [2024-11-12 13:33:34,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431100246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:34,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496370469] [2024-11-12 13:33:34,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:34,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:34,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:34,570 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-12 13:33:34,572 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-12 13:33:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:34,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 13:33:34,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:34,685 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-12 13:33:34,811 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-12 13:33:34,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:34,847 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-12 13:33:34,853 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:34,854 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-12 13:33:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-12 13:33:34,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:34,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496370469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:34,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:34,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-12 13:33:34,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361835117] [2024-11-12 13:33:34,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:34,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 13:33:34,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:34,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 13:33:34,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2024-11-12 13:33:34,979 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:33:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:35,200 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-11-12 13:33:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:33:35,201 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2024-11-12 13:33:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:35,201 INFO L225 Difference]: With dead ends: 60 [2024-11-12 13:33:35,201 INFO L226 Difference]: Without dead ends: 60 [2024-11-12 13:33:35,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2024-11-12 13:33:35,202 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:35,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 282 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 243 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2024-11-12 13:33:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-12 13:33:35,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-12 13:33:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.4) internal successors, (56), 51 states have internal predecessors, (56), 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-12 13:33:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-12 13:33:35,205 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 21 [2024-11-12 13:33:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:35,205 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-12 13:33:35,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:33:35,206 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-12 13:33:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:33:35,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:35,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:35,222 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-12 13:33:35,407 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,SelfDestructingSolverStorable10 [2024-11-12 13:33:35,408 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:35,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:35,408 INFO L85 PathProgramCache]: Analyzing trace with hash 481652236, now seen corresponding path program 1 times [2024-11-12 13:33:35,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:35,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379469344] [2024-11-12 13:33:35,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:35,577 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-12 13:33:35,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:35,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379469344] [2024-11-12 13:33:35,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379469344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:35,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:35,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 13:33:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454521613] [2024-11-12 13:33:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:35,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:33:35,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:35,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:33:35,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:33:35,579 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-12 13:33:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:35,722 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-12 13:33:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:33:35,723 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 21 [2024-11-12 13:33:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:35,723 INFO L225 Difference]: With dead ends: 62 [2024-11-12 13:33:35,723 INFO L226 Difference]: Without dead ends: 62 [2024-11-12 13:33:35,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-12 13:33:35,724 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:35,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 173 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-12 13:33:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-12 13:33:35,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 57 states have internal predecessors, (64), 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-12 13:33:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-12 13:33:35,730 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 21 [2024-11-12 13:33:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:35,730 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-12 13:33:35,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-12 13:33:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-11-12 13:33:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:33:35,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:35,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:35,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:33:35,731 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:35,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:35,732 INFO L85 PathProgramCache]: Analyzing trace with hash 481652237, now seen corresponding path program 1 times [2024-11-12 13:33:35,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:35,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323072784] [2024-11-12 13:33:35,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:35,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:35,897 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-12 13:33:35,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323072784] [2024-11-12 13:33:35,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323072784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:35,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:35,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:33:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182413784] [2024-11-12 13:33:35,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:35,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:33:35,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:35,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:33:35,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:33:35,899 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-12 13:33:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:36,018 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-12 13:33:36,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:36,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 21 [2024-11-12 13:33:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:36,019 INFO L225 Difference]: With dead ends: 64 [2024-11-12 13:33:36,019 INFO L226 Difference]: Without dead ends: 64 [2024-11-12 13:33:36,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-12 13:33:36,019 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:36,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 195 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-12 13:33:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-12 13:33:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 59 states have internal predecessors, (65), 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-12 13:33:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-11-12 13:33:36,026 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 21 [2024-11-12 13:33:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:36,026 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-11-12 13:33:36,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-12 13:33:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-11-12 13:33:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:33:36,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:36,027 INFO L218 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] [2024-11-12 13:33:36,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:33:36,027 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2046315958, now seen corresponding path program 1 times [2024-11-12 13:33:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349165150] [2024-11-12 13:33:36,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,122 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-12 13:33:36,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:36,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349165150] [2024-11-12 13:33:36,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349165150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:36,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:36,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:33:36,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268208239] [2024-11-12 13:33:36,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:36,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:33:36,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:36,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:33:36,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:33:36,125 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 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-12 13:33:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:36,221 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2024-11-12 13:33:36,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:36,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 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 22 [2024-11-12 13:33:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:36,222 INFO L225 Difference]: With dead ends: 71 [2024-11-12 13:33:36,222 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 13:33:36,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-12 13:33:36,223 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:36,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 283 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 13:33:36,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2024-11-12 13:33:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.3) internal successors, (65), 60 states have internal predecessors, (65), 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-12 13:33:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-12 13:33:36,232 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 22 [2024-11-12 13:33:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:36,233 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-12 13:33:36,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 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-12 13:33:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-12 13:33:36,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:33:36,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:36,237 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:36,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:33:36,237 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:36,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:36,238 INFO L85 PathProgramCache]: Analyzing trace with hash 714046705, now seen corresponding path program 1 times [2024-11-12 13:33:36,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:36,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911155796] [2024-11-12 13:33:36,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:36,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:33:36,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911155796] [2024-11-12 13:33:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911155796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:36,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:36,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:33:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481185027] [2024-11-12 13:33:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:36,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:33:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:36,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:33:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:33:36,406 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-12 13:33:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:36,507 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-11-12 13:33:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:33:36,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 24 [2024-11-12 13:33:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:36,508 INFO L225 Difference]: With dead ends: 64 [2024-11-12 13:33:36,508 INFO L226 Difference]: Without dead ends: 64 [2024-11-12 13:33:36,508 INFO L434 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-12 13:33:36,508 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:36,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-12 13:33:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-12 13:33:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.26) internal successors, (63), 59 states have internal predecessors, (63), 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-12 13:33:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2024-11-12 13:33:36,511 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 24 [2024-11-12 13:33:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:36,511 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2024-11-12 13:33:36,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-12 13:33:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2024-11-12 13:33:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:33:36,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:36,512 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:36,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:33:36,512 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:36,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:36,513 INFO L85 PathProgramCache]: Analyzing trace with hash 714046706, now seen corresponding path program 1 times [2024-11-12 13:33:36,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:36,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404433105] [2024-11-12 13:33:36,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:36,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:36,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404433105] [2024-11-12 13:33:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404433105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:36,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:36,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:33:36,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809579531] [2024-11-12 13:33:36,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:36,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:33:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:36,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:33:36,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:33:36,705 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-12 13:33:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:36,789 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2024-11-12 13:33:36,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:33:36,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 24 [2024-11-12 13:33:36,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:36,791 INFO L225 Difference]: With dead ends: 63 [2024-11-12 13:33:36,791 INFO L226 Difference]: Without dead ends: 63 [2024-11-12 13:33:36,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-12 13:33:36,792 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:36,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 190 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-12 13:33:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-12 13:33:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.22) internal successors, (61), 58 states have internal predecessors, (61), 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-12 13:33:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-11-12 13:33:36,795 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 24 [2024-11-12 13:33:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:36,796 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-11-12 13:33:36,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-12 13:33:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-11-12 13:33:36,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:33:36,797 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:36,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:36,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:33:36,798 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:36,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:36,799 INFO L85 PathProgramCache]: Analyzing trace with hash -583935462, now seen corresponding path program 1 times [2024-11-12 13:33:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:36,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877728868] [2024-11-12 13:33:36,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:36,921 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-12 13:33:36,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:36,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877728868] [2024-11-12 13:33:36,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877728868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:33:36,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:33:36,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:33:36,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812738021] [2024-11-12 13:33:36,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:33:36,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:33:36,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:36,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:33:36,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:33:36,923 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-12 13:33:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:37,035 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-11-12 13:33:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:33:37,035 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 24 [2024-11-12 13:33:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:37,036 INFO L225 Difference]: With dead ends: 68 [2024-11-12 13:33:37,036 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 13:33:37,036 INFO L434 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-12 13:33:37,036 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:37,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 229 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:33:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 13:33:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-11-12 13:33:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 62 states have internal predecessors, (68), 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-12 13:33:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-11-12 13:33:37,039 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 24 [2024-11-12 13:33:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:37,039 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-11-12 13:33:37,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-12 13:33:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-11-12 13:33:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:33:37,039 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:37,040 INFO L218 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] [2024-11-12 13:33:37,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:33:37,040 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:37,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:37,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1403696687, now seen corresponding path program 1 times [2024-11-12 13:33:37,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:37,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321005560] [2024-11-12 13:33:37,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:37,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:37,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:37,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321005560] [2024-11-12 13:33:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321005560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248731122] [2024-11-12 13:33:37,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:37,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:37,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:37,446 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-12 13:33:37,447 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-12 13:33:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:37,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-12 13:33:37,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:37,538 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-12 13:33:37,541 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-12 13:33:37,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:37,637 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-12 13:33:37,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:37,642 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-12 13:33:37,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:37,755 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-12 13:33:37,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:37,760 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-12 13:33:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:37,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:38,287 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 15 treesize of output 13 [2024-11-12 13:33:38,292 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 90 treesize of output 86 [2024-11-12 13:33:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:38,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248731122] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:38,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:38,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 29 [2024-11-12 13:33:38,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771086769] [2024-11-12 13:33:38,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:38,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-12 13:33:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-12 13:33:38,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:33:38,307 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 25 states have internal predecessors, (46), 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-12 13:33:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:38,621 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-11-12 13:33:38,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:33:38,622 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 25 states have internal predecessors, (46), 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 27 [2024-11-12 13:33:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:38,622 INFO L225 Difference]: With dead ends: 70 [2024-11-12 13:33:38,622 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 13:33:38,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 13:33:38,623 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:38,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 456 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 13:33:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-12 13:33:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 65 states have internal predecessors, (71), 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-12 13:33:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2024-11-12 13:33:38,625 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 27 [2024-11-12 13:33:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:38,625 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2024-11-12 13:33:38,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 25 states have internal predecessors, (46), 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-12 13:33:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2024-11-12 13:33:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:33:38,626 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:38,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:38,639 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-12 13:33:38,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 13:33:38,827 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:38,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash -564925807, now seen corresponding path program 1 times [2024-11-12 13:33:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:38,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782177110] [2024-11-12 13:33:38,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:39,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:39,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782177110] [2024-11-12 13:33:39,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782177110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:39,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030272144] [2024-11-12 13:33:39,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:39,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:39,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:39,155 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-12 13:33:39,156 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-12 13:33:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:39,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-12 13:33:39,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:39,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:40,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030272144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:40,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:40,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2024-11-12 13:33:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725676333] [2024-11-12 13:33:40,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:40,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 13:33:40,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:40,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 13:33:40,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:33:40,027 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (2), 2 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-12 13:33:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:40,198 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-11-12 13:33:40,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:33:40,199 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-12 13:33:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:40,199 INFO L225 Difference]: With dead ends: 72 [2024-11-12 13:33:40,200 INFO L226 Difference]: Without dead ends: 58 [2024-11-12 13:33:40,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:33:40,200 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:40,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 236 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-12 13:33:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-12 13:33:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.288888888888889) internal successors, (58), 53 states have internal predecessors, (58), 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-12 13:33:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2024-11-12 13:33:40,202 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 28 [2024-11-12 13:33:40,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:40,203 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2024-11-12 13:33:40,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 2 states have call successors, (2), 2 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-12 13:33:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-11-12 13:33:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:33:40,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:40,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:40,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 13:33:40,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:40,407 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:40,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1722766016, now seen corresponding path program 1 times [2024-11-12 13:33:40,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:40,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860991007] [2024-11-12 13:33:40,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:40,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:40,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:40,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:33:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:33:40,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:40,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860991007] [2024-11-12 13:33:40,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860991007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:40,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642158743] [2024-11-12 13:33:40,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:40,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:40,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:40,776 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-12 13:33:40,777 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-12 13:33:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:40,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 13:33:40,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:40,911 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:40,912 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-12 13:33:40,927 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-12 13:33:40,968 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:33:40,969 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-12 13:33:40,976 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-12 13:33:40,987 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-12 13:33:41,007 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 13:33:41,008 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-12 13:33:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-12 13:33:41,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:41,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642158743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:41,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:41,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2024-11-12 13:33:41,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954499614] [2024-11-12 13:33:41,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:41,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 13:33:41,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:41,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 13:33:41,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2024-11-12 13:33:41,049 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 18 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 13:33:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:41,270 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-12 13:33:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:33:41,270 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 18 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2024-11-12 13:33:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:41,271 INFO L225 Difference]: With dead ends: 57 [2024-11-12 13:33:41,271 INFO L226 Difference]: Without dead ends: 57 [2024-11-12 13:33:41,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=663, Unknown=1, NotChecked=52, Total=812 [2024-11-12 13:33:41,272 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:41,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 352 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2024-11-12 13:33:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-12 13:33:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-12 13:33:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 52 states have internal predecessors, (57), 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-12 13:33:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-12 13:33:41,274 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 36 [2024-11-12 13:33:41,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:41,274 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-12 13:33:41,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 18 states have internal predecessors, (48), 2 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-12 13:33:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-12 13:33:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:33:41,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:41,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:41,288 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-12 13:33:41,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:41,479 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:41,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:41,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1722766015, now seen corresponding path program 1 times [2024-11-12 13:33:41,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:41,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786047132] [2024-11-12 13:33:41,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:41,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 13:33:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:33:42,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:42,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786047132] [2024-11-12 13:33:42,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786047132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:42,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204434932] [2024-11-12 13:33:42,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:42,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:42,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:42,111 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-12 13:33:42,113 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-12 13:33:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:42,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-12 13:33:42,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:42,244 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-12 13:33:42,318 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:42,319 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-12 13:33:42,352 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-12 13:33:42,354 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-12 13:33:42,438 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 13:33:42,438 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-12 13:33:42,445 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-12 13:33:42,498 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-12 13:33:42,505 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-12 13:33:42,621 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alloc_and_zero_#res.base| Int)) (and (= (store |c_old(#length)| |alloc_and_zero_#res.base| (select |c_#length| |alloc_and_zero_#res.base|)) |c_#length|) (= (select |c_old(#valid)| |alloc_and_zero_#res.base|) 0))) is different from true [2024-11-12 13:33:42,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:42,636 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-12 13:33:42,644 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:42,645 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-12 13:33:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 13:33:42,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:42,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204434932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:42,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:42,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 30 [2024-11-12 13:33:42,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538623364] [2024-11-12 13:33:42,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:42,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-12 13:33:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-12 13:33:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=899, Unknown=1, NotChecked=60, Total=1056 [2024-11-12 13:33:42,780 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 23 states have internal predecessors, (53), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:33:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:43,169 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-11-12 13:33:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 13:33:43,170 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 23 states have internal predecessors, (53), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2024-11-12 13:33:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:43,170 INFO L225 Difference]: With dead ends: 54 [2024-11-12 13:33:43,170 INFO L226 Difference]: Without dead ends: 54 [2024-11-12 13:33:43,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=1319, Unknown=1, NotChecked=74, Total=1560 [2024-11-12 13:33:43,171 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 29 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:43,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 482 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 480 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2024-11-12 13:33:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-12 13:33:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2024-11-12 13:33:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 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-12 13:33:43,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-12 13:33:43,174 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 36 [2024-11-12 13:33:43,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:43,174 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-12 13:33:43,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 23 states have internal predecessors, (53), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:33:43,174 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-12 13:33:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:33:43,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:43,176 INFO L218 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, 1] [2024-11-12 13:33:43,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 13:33:43,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:43,377 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:43,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:43,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1171690712, now seen corresponding path program 1 times [2024-11-12 13:33:43,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:43,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718527035] [2024-11-12 13:33:43,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:43,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:43,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:43,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718527035] [2024-11-12 13:33:43,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718527035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:43,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859961154] [2024-11-12 13:33:43,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:43,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:43,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:43,631 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-12 13:33:43,632 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-12 13:33:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:43,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 13:33:43,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:43,739 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-12 13:33:43,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:43,765 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-12 13:33:43,846 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-12 13:33:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:43,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:43,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:43,895 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 17 treesize of output 21 [2024-11-12 13:33:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859961154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:43,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:43,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2024-11-12 13:33:43,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804459402] [2024-11-12 13:33:43,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:43,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 13:33:43,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:43,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 13:33:43,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:33:43,961 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:33:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:44,213 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2024-11-12 13:33:44,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:33:44,214 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2024-11-12 13:33:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:44,214 INFO L225 Difference]: With dead ends: 65 [2024-11-12 13:33:44,214 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 13:33:44,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-11-12 13:33:44,215 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:44,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 179 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 13:33:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-11-12 13:33:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2) internal successors, (66), 59 states have internal predecessors, (66), 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-12 13:33:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-12 13:33:44,217 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 36 [2024-11-12 13:33:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:44,217 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-12 13:33:44,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:33:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-11-12 13:33:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:33:44,218 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:44,218 INFO L218 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, 1] [2024-11-12 13:33:44,231 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-12 13:33:44,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:44,422 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:44,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:44,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1171690713, now seen corresponding path program 1 times [2024-11-12 13:33:44,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:44,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581246424] [2024-11-12 13:33:44,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:44,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:44,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:44,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:44,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581246424] [2024-11-12 13:33:44,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581246424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:44,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655047136] [2024-11-12 13:33:44,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:44,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:44,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:44,608 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-12 13:33:44,609 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-12 13:33:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:44,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 13:33:44,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:44,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:45,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:45,003 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 21 treesize of output 25 [2024-11-12 13:33:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:45,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655047136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:33:45,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:33:45,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2024-11-12 13:33:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742168525] [2024-11-12 13:33:45,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:45,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 13:33:45,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:45,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 13:33:45,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:33:45,127 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 28 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:33:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:45,311 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-11-12 13:33:45,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:33:45,311 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2024-11-12 13:33:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:45,312 INFO L225 Difference]: With dead ends: 67 [2024-11-12 13:33:45,328 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 13:33:45,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2024-11-12 13:33:45,329 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:45,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 517 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:33:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 13:33:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-11-12 13:33:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 61 states have internal predecessors, (67), 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-12 13:33:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-11-12 13:33:45,331 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 36 [2024-11-12 13:33:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:45,331 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-11-12 13:33:45,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.0) internal successors, (81), 24 states have internal predecessors, (81), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:33:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-11-12 13:33:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 13:33:45,332 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:45,332 INFO L218 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] [2024-11-12 13:33:45,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-12 13:33:45,536 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,SelfDestructingSolverStorable22 [2024-11-12 13:33:45,537 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:45,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash 217655197, now seen corresponding path program 1 times [2024-11-12 13:33:45,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:45,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062842396] [2024-11-12 13:33:45,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:45,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:46,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:46,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:46,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:46,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062842396] [2024-11-12 13:33:46,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062842396] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:46,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077976900] [2024-11-12 13:33:46,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:46,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:46,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:46,316 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-12 13:33:46,323 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-12 13:33:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:46,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-12 13:33:46,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:46,447 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-12 13:33:46,557 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:33:46,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:33:46,703 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-12 13:33:46,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-12 13:33:46,733 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 15 treesize of output 1 [2024-11-12 13:33:46,805 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:33:46,805 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 39 [2024-11-12 13:33:46,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-12 13:33:46,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:46,960 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 27 treesize of output 21 [2024-11-12 13:33:47,054 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-12 13:33:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:47,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:47,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:47,256 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 42 treesize of output 46 [2024-11-12 13:33:47,373 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 26 [2024-11-12 13:33:47,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:47,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:47,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077976900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:47,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:47,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2024-11-12 13:33:47,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070421930] [2024-11-12 13:33:47,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:47,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-12 13:33:47,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:47,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-12 13:33:47,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1765, Unknown=0, NotChecked=0, Total=1892 [2024-11-12 13:33:47,481 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 34 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:33:48,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:48,269 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2024-11-12 13:33:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 13:33:48,270 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 34 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 42 [2024-11-12 13:33:48,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:48,270 INFO L225 Difference]: With dead ends: 71 [2024-11-12 13:33:48,271 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 13:33:48,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=245, Invalid=2947, Unknown=0, NotChecked=0, Total=3192 [2024-11-12 13:33:48,272 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 48 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:48,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 329 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:33:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 13:33:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-12 13:33:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 65 states have internal predecessors, (73), 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-12 13:33:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-11-12 13:33:48,274 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 42 [2024-11-12 13:33:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:48,274 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-12 13:33:48,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 34 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:33:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-11-12 13:33:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-12 13:33:48,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:48,275 INFO L218 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] [2024-11-12 13:33:48,288 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-12 13:33:48,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-12 13:33:48,476 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:48,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash 217655198, now seen corresponding path program 1 times [2024-11-12 13:33:48,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:48,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316110424] [2024-11-12 13:33:48,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:49,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:49,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:49,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:49,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316110424] [2024-11-12 13:33:49,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316110424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:49,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120048497] [2024-11-12 13:33:49,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:49,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:49,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:49,203 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-12 13:33:49,205 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-12 13:33:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:49,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-12 13:33:49,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:49,430 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-12 13:33:49,498 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:49,499 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-12 13:33:49,530 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-12 13:33:49,538 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-12 13:33:49,635 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:33:49,635 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 50 treesize of output 45 [2024-11-12 13:33:49,639 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 24 treesize of output 11 [2024-11-12 13:33:49,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:49,829 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 27 treesize of output 21 [2024-11-12 13:33:49,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:49,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-12 13:33:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:49,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:50,237 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1364) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))) (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1364) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1365) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))))) is different from false [2024-11-12 13:33:50,245 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (and (forall ((v_ArrVal_1364 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1364) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 8))) (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1364) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1365) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))))) is different from false [2024-11-12 13:33:50,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:50,258 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 41 treesize of output 42 [2024-11-12 13:33:50,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:50,265 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 31 treesize of output 32 [2024-11-12 13:33:50,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:50,273 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 54 treesize of output 55 [2024-11-12 13:33:50,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:50,284 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 84 treesize of output 81 [2024-11-12 13:33:50,288 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 11 treesize of output 9 [2024-11-12 13:33:50,290 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 9 treesize of output 7 [2024-11-12 13:33:50,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:50,308 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 20 treesize of output 21 [2024-11-12 13:33:50,310 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:33:50,311 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-12 13:33:50,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120048497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:50,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:50,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2024-11-12 13:33:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190054597] [2024-11-12 13:33:50,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:50,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-12 13:33:50,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:50,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-12 13:33:50,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2292, Unknown=2, NotChecked=194, Total=2652 [2024-11-12 13:33:50,435 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 34 states have internal predecessors, (68), 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-12 13:33:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:51,082 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2024-11-12 13:33:51,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:33:51,082 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 34 states have internal predecessors, (68), 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 42 [2024-11-12 13:33:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:51,083 INFO L225 Difference]: With dead ends: 73 [2024-11-12 13:33:51,083 INFO L226 Difference]: Without dead ends: 73 [2024-11-12 13:33:51,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=267, Invalid=3521, Unknown=2, NotChecked=242, Total=4032 [2024-11-12 13:33:51,084 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:51,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 478 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:33:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-12 13:33:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-12 13:33:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 67 states have internal predecessors, (74), 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-12 13:33:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-11-12 13:33:51,087 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 42 [2024-11-12 13:33:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:51,087 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-11-12 13:33:51,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 34 states have internal predecessors, (68), 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-12 13:33:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-11-12 13:33:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-12 13:33:51,087 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:51,087 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:51,101 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-12 13:33:51,291 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,SelfDestructingSolverStorable24 [2024-11-12 13:33:51,292 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:51,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:51,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1842624955, now seen corresponding path program 1 times [2024-11-12 13:33:51,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:51,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069421519] [2024-11-12 13:33:51,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:51,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:51,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:51,856 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-12 13:33:51,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:51,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069421519] [2024-11-12 13:33:51,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069421519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:51,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073777361] [2024-11-12 13:33:51,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:51,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:51,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:51,858 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-12 13:33:51,864 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-12 13:33:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:51,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-12 13:33:51,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:52,099 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:52,099 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-12 13:33:52,134 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 15 treesize of output 1 [2024-11-12 13:33:52,200 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:33:52,200 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 33 treesize of output 32 [2024-11-12 13:33:52,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:52,329 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 26 treesize of output 20 [2024-11-12 13:33:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:52,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:52,503 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1475) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0))) is different from false [2024-11-12 13:33:52,507 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (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_1475) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0))) is different from false [2024-11-12 13:33:52,513 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:52,514 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 21 treesize of output 22 [2024-11-12 13:33:52,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:52,519 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 36 [2024-11-12 13:33:52,522 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 20 treesize of output 18 [2024-11-12 13:33:52,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073777361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:52,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:52,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 37 [2024-11-12 13:33:52,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510001673] [2024-11-12 13:33:52,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:52,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-12 13:33:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:52,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-12 13:33:52,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1602, Unknown=2, NotChecked=162, Total=1892 [2024-11-12 13:33:52,628 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 31 states have internal predecessors, (68), 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-12 13:33:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:53,156 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-12 13:33:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 13:33:53,157 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 31 states have internal predecessors, (68), 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 43 [2024-11-12 13:33:53,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:53,157 INFO L225 Difference]: With dead ends: 75 [2024-11-12 13:33:53,157 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 13:33:53,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=2746, Unknown=2, NotChecked=214, Total=3192 [2024-11-12 13:33:53,158 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:53,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 499 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:33:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 13:33:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-11-12 13:33:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 67 states have internal predecessors, (73), 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-12 13:33:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-12 13:33:53,160 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 43 [2024-11-12 13:33:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:53,161 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-12 13:33:53,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 31 states have internal predecessors, (68), 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-12 13:33:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-12 13:33:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 13:33:53,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:53,161 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:53,174 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-12 13:33:53,365 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,SelfDestructingSolverStorable25 [2024-11-12 13:33:53,366 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:53,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:53,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1234605335, now seen corresponding path program 1 times [2024-11-12 13:33:53,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:53,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663855052] [2024-11-12 13:33:53,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:53,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:53,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:53,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:53,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663855052] [2024-11-12 13:33:53,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663855052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:53,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984968095] [2024-11-12 13:33:53,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:53,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:53,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:53,966 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-12 13:33:53,967 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-12 13:33:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:54,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-12 13:33:54,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:54,216 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:54,216 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-12 13:33:54,245 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-12 13:33:54,316 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:33:54,317 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 34 treesize of output 33 [2024-11-12 13:33:54,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:54,445 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 27 treesize of output 21 [2024-11-12 13:33:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:54,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:33:54,708 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1582 (Array Int Int))) (< (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_1582) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2024-11-12 13:33:54,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:54,715 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 20 treesize of output 21 [2024-11-12 13:33:54,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:54,720 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 32 treesize of output 33 [2024-11-12 13:33:54,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-12 13:33:54,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984968095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:54,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:33:54,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 36 [2024-11-12 13:33:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781833324] [2024-11-12 13:33:54,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:33:54,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-12 13:33:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:33:54,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-12 13:33:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1664, Unknown=18, NotChecked=82, Total=1892 [2024-11-12 13:33:54,812 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 31 states have internal predecessors, (70), 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-12 13:33:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:33:55,425 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-11-12 13:33:55,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 13:33:55,425 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 31 states have internal predecessors, (70), 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 45 [2024-11-12 13:33:55,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:33:55,426 INFO L225 Difference]: With dead ends: 74 [2024-11-12 13:33:55,426 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 13:33:55,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=229, Invalid=2835, Unknown=20, NotChecked=108, Total=3192 [2024-11-12 13:33:55,427 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:33:55,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 457 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:33:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 13:33:55,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-11-12 13:33:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 67 states have internal predecessors, (73), 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-12 13:33:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-12 13:33:55,429 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 45 [2024-11-12 13:33:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:33:55,430 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-12 13:33:55,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 31 states have internal predecessors, (70), 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-12 13:33:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-12 13:33:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:33:55,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:33:55,430 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-12 13:33:55,444 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-12 13:33:55,634 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,SelfDestructingSolverStorable26 [2024-11-12 13:33:55,635 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-12 13:33:55,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:33:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1972490914, now seen corresponding path program 2 times [2024-11-12 13:33:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:33:55,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637718671] [2024-11-12 13:33:55,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:33:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:33:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:56,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-12 13:33:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:56,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 13:33:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:33:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 13:33:56,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:33:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637718671] [2024-11-12 13:33:56,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637718671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:33:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109392806] [2024-11-12 13:33:56,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:33:56,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:33:56,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:33:56,868 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-12 13:33:56,870 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-12 13:33:57,022 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:33:57,023 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:33:57,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-12 13:33:57,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:33:57,033 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-12 13:33:57,195 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-12 13:33:57,200 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-12 13:33:57,277 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:33:57,277 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-12 13:33:57,349 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 33 treesize of output 17 [2024-11-12 13:33:57,357 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 33 treesize of output 17 [2024-11-12 13:33:57,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:33:57,472 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2024-11-12 13:33:57,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 60 [2024-11-12 13:33:57,481 INFO L349 Elim1Store]: treesize reduction 33, result has 28.3 percent of original size [2024-11-12 13:33:57,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 65 treesize of output 32 [2024-11-12 13:33:57,951 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-12 13:33:57,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 38 [2024-11-12 13:33:57,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:33:57,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2024-11-12 13:33:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:33:57,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:34:29,332 INFO L349 Elim1Store]: treesize reduction 234, result has 49.9 percent of original size [2024-11-12 13:34:29,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 2510 treesize of output 1649 [2024-11-12 13:34:29,670 INFO L349 Elim1Store]: treesize reduction 204, result has 39.5 percent of original size [2024-11-12 13:34:29,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 1894 treesize of output 1632 [2024-11-12 13:34:29,925 INFO L349 Elim1Store]: treesize reduction 12, result has 93.2 percent of original size [2024-11-12 13:34:29,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1519 treesize of output 1599 [2024-11-12 13:34:30,338 INFO L349 Elim1Store]: treesize reduction 366, result has 45.6 percent of original size [2024-11-12 13:34:30,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 1638 treesize of output 1524 [2024-11-12 13:34:30,763 INFO L349 Elim1Store]: treesize reduction 304, result has 43.1 percent of original size [2024-11-12 13:34:30,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 1390 treesize of output 1503 [2024-11-12 13:34:30,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:34:30,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1392 treesize of output 1502 [2024-11-12 13:34:40,394 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 6 treesize of output 4 [2024-11-12 13:34:40,878 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 6 treesize of output 4 [2024-11-12 13:34:41,049 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 6 treesize of output 4 [2024-11-12 13:34:41,096 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 6 treesize of output 4 [2024-11-12 13:34:41,816 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 6 treesize of output 4 [2024-11-12 13:34:41,888 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 6 treesize of output 4 [2024-11-12 13:34:42,002 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 6 treesize of output 4 [2024-11-12 13:34:42,126 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 6 treesize of output 4 [2024-11-12 13:34:42,202 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 6 treesize of output 4 [2024-11-12 13:34:42,330 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 6 treesize of output 4 [2024-11-12 13:34:42,503 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 6 treesize of output 4 [2024-11-12 13:34:42,572 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 6 treesize of output 4 [2024-11-12 13:34:42,689 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 6 treesize of output 4 [2024-11-12 13:35:00,847 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 244 treesize of output 240 [2024-11-12 13:35:06,329 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 252 treesize of output 248