./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 07:55:48,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:55:48,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:55:48,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:55:48,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:55:48,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:55:48,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:55:48,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:55:48,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:55:48,617 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:55:48,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:55:48,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:55:48,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:55:48,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:55:48,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:55:48,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:55:48,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:55:48,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:55:48,622 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:55:48,622 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:55:48,623 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:55:48,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:55:48,628 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:55:48,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:55:48,628 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:55:48,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:55:48,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:55:48,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:55:48,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:55:48,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:55:48,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:55:48,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:55:48,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:55:48,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:55:48,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:55:48,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:55:48,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:55:48,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:55:48,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:55:48,633 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-09 07:55:48,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:55:48,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:55:48,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:55:48,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:55:48,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:55:48,888 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-09 07:55:50,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:55:50,699 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:55:50,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2024-11-09 07:55:50,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1907ff08/544b1a200ecb4547b46064a38c8c609d/FLAGb782315b4 [2024-11-09 07:55:50,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1907ff08/544b1a200ecb4547b46064a38c8c609d [2024-11-09 07:55:50,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:55:50,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:55:50,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:55:50,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:55:50,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:55:50,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5897a1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50, skipping insertion in model container [2024-11-09 07:55:50,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:55:51,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:55:51,152 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:55:51,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:55:51,234 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:55:51,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51 WrapperNode [2024-11-09 07:55:51,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:55:51,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:55:51,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:55:51,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:55:51,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,285 INFO L138 Inliner]: procedures = 120, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-09 07:55:51,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:55:51,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:55:51,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:55:51,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:55:51,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,327 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-09 07:55:51,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:55:51,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:55:51,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:55:51,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:55:51,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (1/1) ... [2024-11-09 07:55:51,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:55:51,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:51,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:55:51,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:55:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:55:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-09 07:55:51,438 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-09 07:55:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:55:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:55:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:55:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:55:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:55:51,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:55:51,531 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:55:51,533 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:55:51,732 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-11-09 07:55:51,733 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:55:51,749 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:55:51,750 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:55:51,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:55:51 BoogieIcfgContainer [2024-11-09 07:55:51,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:55:51,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:55:51,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:55:51,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:55:51,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:55:50" (1/3) ... [2024-11-09 07:55:51,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26708ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:55:51, skipping insertion in model container [2024-11-09 07:55:51,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:51" (2/3) ... [2024-11-09 07:55:51,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26708ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:55:51, skipping insertion in model container [2024-11-09 07:55:51,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:55:51" (3/3) ... [2024-11-09 07:55:51,761 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-shared-before.i [2024-11-09 07:55:51,778 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:55:51,779 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-09 07:55:51,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:55:51,829 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;@a108184, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:55:51,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-09 07:55:51,835 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-09 07:55:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:55:51,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:51,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:55:51,843 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-09 07:55:51,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:51,849 INFO L85 PathProgramCache]: Analyzing trace with hash 35815, now seen corresponding path program 1 times [2024-11-09 07:55:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245373780] [2024-11-09 07:55:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:52,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:52,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245373780] [2024-11-09 07:55:52,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245373780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:52,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:52,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:55:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759603834] [2024-11-09 07:55:52,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:52,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:55:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:52,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:55:52,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:52,138 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-09 07:55:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:52,239 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2024-11-09 07:55:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:55:52,242 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-09 07:55:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:52,249 INFO L225 Difference]: With dead ends: 59 [2024-11-09 07:55:52,249 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 07:55:52,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:52,257 INFO L432 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-09 07:55:52,258 INFO L433 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-09 07:55:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 07:55:52,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 07:55:52,321 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-09 07:55:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2024-11-09 07:55:52,324 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 3 [2024-11-09 07:55:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:52,325 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2024-11-09 07:55:52,326 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-09 07:55:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2024-11-09 07:55:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:55:52,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:52,327 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:55:52,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:55:52,328 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-09 07:55:52,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash 35816, now seen corresponding path program 1 times [2024-11-09 07:55:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:52,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572503318] [2024-11-09 07:55:52,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:52,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:52,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572503318] [2024-11-09 07:55:52,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572503318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:52,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:52,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:55:52,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228002248] [2024-11-09 07:55:52,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:52,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:55:52,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:52,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:55:52,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:52,504 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-09 07:55:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:52,573 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-11-09 07:55:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:55:52,574 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-09 07:55:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:52,575 INFO L225 Difference]: With dead ends: 56 [2024-11-09 07:55:52,575 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 07:55:52,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:52,577 INFO L432 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:52,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 07:55:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 07:55:52,585 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-09 07:55:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2024-11-09 07:55:52,587 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 3 [2024-11-09 07:55:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:52,587 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-09 07:55:52,588 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-09 07:55:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2024-11-09 07:55:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:55:52,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:52,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:52,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:55:52,589 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-09 07:55:52,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:52,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1284320017, now seen corresponding path program 1 times [2024-11-09 07:55:52,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:52,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177823769] [2024-11-09 07:55:52,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:52,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:52,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177823769] [2024-11-09 07:55:52,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177823769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:52,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:52,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:55:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656858238] [2024-11-09 07:55:52,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:52,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:55:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:55:52,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:52,725 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-09 07:55:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:52,764 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2024-11-09 07:55:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:55:52,765 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-09 07:55:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:52,766 INFO L225 Difference]: With dead ends: 55 [2024-11-09 07:55:52,766 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 07:55:52,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:52,768 INFO L432 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-09 07:55:52,769 INFO L433 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-09 07:55:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 07:55:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-09 07:55:52,773 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-09 07:55:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2024-11-09 07:55:52,775 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 7 [2024-11-09 07:55:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:52,775 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-11-09 07:55:52,775 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-09 07:55:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2024-11-09 07:55:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:55:52,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:52,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:52,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:55:52,777 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-09 07:55:52,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:52,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1284320016, now seen corresponding path program 1 times [2024-11-09 07:55:52,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:52,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730796763] [2024-11-09 07:55:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:52,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:52,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730796763] [2024-11-09 07:55:52,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730796763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:52,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:52,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:55:52,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190890434] [2024-11-09 07:55:52,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:52,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:55:52,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:52,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:55:52,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:52,880 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-09 07:55:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:52,912 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2024-11-09 07:55:52,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:55:52,913 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-09 07:55:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:52,914 INFO L225 Difference]: With dead ends: 54 [2024-11-09 07:55:52,914 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 07:55:52,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:52,915 INFO L432 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-09 07:55:52,916 INFO L433 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-09 07:55:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 07:55:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-09 07:55:52,920 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-09 07:55:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-11-09 07:55:52,921 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 7 [2024-11-09 07:55:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:52,921 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-11-09 07:55:52,922 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-09 07:55:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2024-11-09 07:55:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:55:52,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:52,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:52,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:55:52,923 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-09 07:55:52,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash -40963897, now seen corresponding path program 1 times [2024-11-09 07:55:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:52,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098439182] [2024-11-09 07:55:52,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:52,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,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-09 07:55:53,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:53,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098439182] [2024-11-09 07:55:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098439182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:53,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:53,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:55:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217547054] [2024-11-09 07:55:53,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:53,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:55:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:53,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:55:53,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:55:53,127 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-09 07:55:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:53,276 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-11-09 07:55:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:55:53,276 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-09 07:55:53,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:53,278 INFO L225 Difference]: With dead ends: 56 [2024-11-09 07:55:53,278 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 07:55:53,279 INFO L431 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-09 07:55:53,280 INFO L432 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-09 07:55:53,284 INFO L433 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-09 07:55:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 07:55:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-09 07:55:53,293 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-09 07:55:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2024-11-09 07:55:53,294 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 12 [2024-11-09 07:55:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:53,295 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-11-09 07:55:53,295 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-09 07:55:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2024-11-09 07:55:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:55:53,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:53,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:53,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:55:53,296 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-09 07:55:53,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash -40963896, now seen corresponding path program 1 times [2024-11-09 07:55:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:53,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723355000] [2024-11-09 07:55:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:53,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:53,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723355000] [2024-11-09 07:55:53,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723355000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:53,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:53,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:55:53,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622460914] [2024-11-09 07:55:53,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:53,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:55:53,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:53,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:55:53,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:55:53,541 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-09 07:55:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:53,649 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-11-09 07:55:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:55:53,650 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-09 07:55:53,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:53,651 INFO L225 Difference]: With dead ends: 55 [2024-11-09 07:55:53,651 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 07:55:53,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-09 07:55:53,653 INFO L432 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-09 07:55:53,653 INFO L433 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-09 07:55:53,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 07:55:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-11-09 07:55:53,657 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-09 07:55:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-11-09 07:55:53,658 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 12 [2024-11-09 07:55:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:53,658 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-09 07:55:53,658 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-09 07:55:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2024-11-09 07:55:53,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:55:53,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:53,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:53,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:55:53,659 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-09 07:55:53,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:53,660 INFO L85 PathProgramCache]: Analyzing trace with hash 694727655, now seen corresponding path program 1 times [2024-11-09 07:55:53,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:53,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265925988] [2024-11-09 07:55:53,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265925988] [2024-11-09 07:55:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265925988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:55:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953123303] [2024-11-09 07:55:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:53,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:55:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:53,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:55:53,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:53,734 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-09 07:55:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:53,782 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2024-11-09 07:55:53,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:55:53,783 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-09 07:55:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:53,783 INFO L225 Difference]: With dead ends: 49 [2024-11-09 07:55:53,783 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 07:55:53,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:53,784 INFO L432 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:53,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 94 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:55:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 07:55:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-09 07:55:53,795 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-09 07:55:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2024-11-09 07:55:53,795 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 17 [2024-11-09 07:55:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:53,796 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2024-11-09 07:55:53,796 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-09 07:55:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2024-11-09 07:55:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:55:53,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:53,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:53,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:55:53,797 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-09 07:55:53,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash 61720908, now seen corresponding path program 1 times [2024-11-09 07:55:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:53,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235950692] [2024-11-09 07:55:53,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:53,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:53,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235950692] [2024-11-09 07:55:53,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235950692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:53,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:53,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:55:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253550451] [2024-11-09 07:55:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:53,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:55:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:53,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:55:53,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:53,908 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-09 07:55:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:54,024 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-11-09 07:55:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:55:54,025 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-09 07:55:54,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:54,026 INFO L225 Difference]: With dead ends: 48 [2024-11-09 07:55:54,026 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 07:55:54,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:54,029 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-09 07:55:54,029 INFO L433 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-09 07:55:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 07:55:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-09 07:55:54,032 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-09 07:55:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-11-09 07:55:54,033 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 18 [2024-11-09 07:55:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:54,033 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-11-09 07:55:54,034 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-09 07:55:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-11-09 07:55:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:55:54,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:54,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:54,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:55:54,035 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-09 07:55:54,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1913348233, now seen corresponding path program 1 times [2024-11-09 07:55:54,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:54,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218205568] [2024-11-09 07:55:54,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:54,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:54,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218205568] [2024-11-09 07:55:54,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218205568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:54,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:54,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:55:54,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767268833] [2024-11-09 07:55:54,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:54,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:55:54,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:54,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:55:54,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:55:54,222 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-09 07:55:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:54,297 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2024-11-09 07:55:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:55:54,298 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-09 07:55:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:54,298 INFO L225 Difference]: With dead ends: 47 [2024-11-09 07:55:54,298 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 07:55:54,299 INFO L431 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-09 07:55:54,299 INFO L432 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-09 07:55:54,299 INFO L433 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-09 07:55:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 07:55:54,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 07:55:54,305 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-09 07:55:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2024-11-09 07:55:54,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 19 [2024-11-09 07:55:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:54,306 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2024-11-09 07:55:54,306 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-09 07:55:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2024-11-09 07:55:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:55:54,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:54,307 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:54,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:55:54,307 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-09 07:55:54,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:54,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1882162804, now seen corresponding path program 1 times [2024-11-09 07:55:54,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:54,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243395470] [2024-11-09 07:55:54,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:55:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,580 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-09 07:55:54,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:54,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243395470] [2024-11-09 07:55:54,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243395470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:54,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951831083] [2024-11-09 07:55:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:54,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:54,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:54,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:54,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:55:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:55:54,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:54,778 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-09 07:55:54,868 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:55:54,869 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-09 07:55:54,880 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-09 07:55:54,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:55:54,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951831083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:54,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:55:54,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-09 07:55:54,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418456342] [2024-11-09 07:55:54,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:54,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:55:54,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:54,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:55:54,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-09 07:55:54,882 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-09 07:55:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:54,931 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-11-09 07:55:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:55:54,932 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-09 07:55:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:54,932 INFO L225 Difference]: With dead ends: 53 [2024-11-09 07:55:54,933 INFO L226 Difference]: Without dead ends: 53 [2024-11-09 07:55:54,933 INFO L431 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-09 07:55:54,934 INFO L432 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-09 07:55:54,934 INFO L433 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-09 07:55:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-09 07:55:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-09 07:55:54,937 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-09 07:55:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-09 07:55:54,938 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 21 [2024-11-09 07:55:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:54,939 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-09 07:55:54,939 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-09 07:55:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-09 07:55:54,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:55:54,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:54,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:54,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:55:55,144 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-09 07:55:55,145 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-09 07:55:55,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:55,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1882162805, now seen corresponding path program 1 times [2024-11-09 07:55:55,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:55,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629413240] [2024-11-09 07:55:55,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:55:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,616 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-09 07:55:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629413240] [2024-11-09 07:55:55,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629413240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350946177] [2024-11-09 07:55:55,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:55,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:55,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:55,620 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:55,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:55:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:55:55,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:55,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:55:55,895 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-09 07:55:55,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:55:55,931 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-09 07:55:55,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:55:55,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:55:55,948 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-09 07:55:55,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:56,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350946177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:56,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:55:56,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-09 07:55:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150436562] [2024-11-09 07:55:56,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:56,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:55:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:56,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:55:56,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=259, Unknown=1, NotChecked=32, Total=342 [2024-11-09 07:55:56,093 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-09 07:55:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:56,351 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-11-09 07:55:56,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:56,351 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-09 07:55:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:56,352 INFO L225 Difference]: With dead ends: 60 [2024-11-09 07:55:56,352 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 07:55:56,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2024-11-09 07:55:56,353 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:56,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 282 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 243 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2024-11-09 07:55:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 07:55:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-09 07:55:56,356 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-09 07:55:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-09 07:55:56,357 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 21 [2024-11-09 07:55:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:56,357 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-09 07:55:56,357 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-09 07:55:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-09 07:55:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:55:56,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:56,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:56,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:55:56,558 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-09 07:55:56,559 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-09 07:55:56,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 481652236, now seen corresponding path program 1 times [2024-11-09 07:55:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:56,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306259372] [2024-11-09 07:55:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:56,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:56,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:56,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306259372] [2024-11-09 07:55:56,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306259372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:56,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:56,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:55:56,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518965614] [2024-11-09 07:55:56,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:56,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:55:56,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:56,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:55:56,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:55:56,834 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-09 07:55:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:57,015 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-09 07:55:57,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:55:57,015 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-09 07:55:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:57,016 INFO L225 Difference]: With dead ends: 62 [2024-11-09 07:55:57,016 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 07:55:57,017 INFO L431 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-09 07:55:57,017 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:57,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 173 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 07:55:57,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 07:55:57,025 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-09 07:55:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-09 07:55:57,026 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 21 [2024-11-09 07:55:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:57,026 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-09 07:55:57,026 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-09 07:55:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-11-09 07:55:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:55:57,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:57,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:57,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:55:57,028 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-09 07:55:57,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash 481652237, now seen corresponding path program 1 times [2024-11-09 07:55:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:57,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829301828] [2024-11-09 07:55:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:57,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:57,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:57,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:57,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829301828] [2024-11-09 07:55:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829301828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:57,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:57,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:55:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818947845] [2024-11-09 07:55:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:57,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:55:57,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:57,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:55:57,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:57,240 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-09 07:55:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:57,416 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-09 07:55:57,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:57,417 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-09 07:55:57,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:57,418 INFO L225 Difference]: With dead ends: 64 [2024-11-09 07:55:57,418 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 07:55:57,418 INFO L431 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-09 07:55:57,419 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:57,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 195 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 07:55:57,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-09 07:55:57,423 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-09 07:55:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-11-09 07:55:57,423 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 21 [2024-11-09 07:55:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:57,424 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-11-09 07:55:57,424 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-09 07:55:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-11-09 07:55:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:55:57,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:57,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:57,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:55:57,430 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-09 07:55:57,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:57,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2046315958, now seen corresponding path program 1 times [2024-11-09 07:55:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:57,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307832794] [2024-11-09 07:55:57,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:57,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:57,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:57,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:57,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307832794] [2024-11-09 07:55:57,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307832794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:57,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:57,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:55:57,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802905706] [2024-11-09 07:55:57,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:57,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:55:57,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:57,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:55:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:57,574 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-09 07:55:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:57,686 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2024-11-09 07:55:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:57,687 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-09 07:55:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:57,688 INFO L225 Difference]: With dead ends: 71 [2024-11-09 07:55:57,688 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 07:55:57,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:57,689 INFO L432 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-09 07:55:57,689 INFO L433 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-09 07:55:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 07:55:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2024-11-09 07:55:57,692 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-09 07:55:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-09 07:55:57,693 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 22 [2024-11-09 07:55:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:57,694 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-09 07:55:57,694 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-09 07:55:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-09 07:55:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:55:57,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:57,695 INFO L215 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-09 07:55:57,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:55:57,695 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-09 07:55:57,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:57,696 INFO L85 PathProgramCache]: Analyzing trace with hash 714046705, now seen corresponding path program 1 times [2024-11-09 07:55:57,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:57,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339061587] [2024-11-09 07:55:57,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:57,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:57,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:57,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:55:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:57,835 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-09 07:55:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:57,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339061587] [2024-11-09 07:55:57,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339061587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:57,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:57,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:55:57,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884748583] [2024-11-09 07:55:57,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:57,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:57,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:57,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:57,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:57,838 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-09 07:55:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:57,936 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-11-09 07:55:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:57,937 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-09 07:55:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:57,937 INFO L225 Difference]: With dead ends: 64 [2024-11-09 07:55:57,938 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 07:55:57,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:57,938 INFO L432 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-09 07:55:57,939 INFO L433 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-09 07:55:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 07:55:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-09 07:55:57,941 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-09 07:55:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2024-11-09 07:55:57,942 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 24 [2024-11-09 07:55:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:57,942 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2024-11-09 07:55:57,942 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-09 07:55:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2024-11-09 07:55:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:55:57,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:57,943 INFO L215 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-09 07:55:57,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:55:57,944 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-09 07:55:57,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 714046706, now seen corresponding path program 1 times [2024-11-09 07:55:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:57,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678418138] [2024-11-09 07:55:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:55:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,174 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-09 07:55:58,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:58,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678418138] [2024-11-09 07:55:58,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678418138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:58,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:58,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:55:58,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189520878] [2024-11-09 07:55:58,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:58,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:58,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:58,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:58,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:58,176 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-09 07:55:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:58,276 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2024-11-09 07:55:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:58,277 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-09 07:55:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:58,277 INFO L225 Difference]: With dead ends: 63 [2024-11-09 07:55:58,277 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 07:55:58,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:58,278 INFO L432 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-09 07:55:58,279 INFO L433 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-09 07:55:58,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 07:55:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-09 07:55:58,281 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-09 07:55:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-11-09 07:55:58,281 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 24 [2024-11-09 07:55:58,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:58,282 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-11-09 07:55:58,282 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-09 07:55:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-11-09 07:55:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:55:58,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:58,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:58,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:55:58,283 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-09 07:55:58,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:58,283 INFO L85 PathProgramCache]: Analyzing trace with hash -583935462, now seen corresponding path program 1 times [2024-11-09 07:55:58,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:58,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414790343] [2024-11-09 07:55:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:58,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:58,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:58,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414790343] [2024-11-09 07:55:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414790343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:58,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:55:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104715763] [2024-11-09 07:55:58,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:58,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:55:58,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:58,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:55:58,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:58,438 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-09 07:55:58,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:58,560 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-11-09 07:55:58,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:58,561 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-09 07:55:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:58,562 INFO L225 Difference]: With dead ends: 68 [2024-11-09 07:55:58,562 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 07:55:58,562 INFO L431 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-09 07:55:58,562 INFO L432 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-09 07:55:58,563 INFO L433 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-09 07:55:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 07:55:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-11-09 07:55:58,565 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-09 07:55:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-11-09 07:55:58,566 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 24 [2024-11-09 07:55:58,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:58,566 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-11-09 07:55:58,566 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-09 07:55:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-11-09 07:55:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:55:58,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:58,570 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:58,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:55:58,571 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-09 07:55:58,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1403696687, now seen corresponding path program 1 times [2024-11-09 07:55:58,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:58,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027889809] [2024-11-09 07:55:58,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:58,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:59,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:55:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:59,175 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-09 07:55:59,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027889809] [2024-11-09 07:55:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027889809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681028447] [2024-11-09 07:55:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:59,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:59,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:59,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:59,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:55:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:59,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 07:55:59,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:59,286 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-09 07:55:59,290 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-09 07:55:59,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:55:59,395 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-09 07:55:59,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:55:59,403 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-09 07:55:59,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:59,530 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-09 07:55:59,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:59,537 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-09 07:55:59,615 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-09 07:55:59,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:00,169 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-09 07:56:00,176 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-09 07:56:00,189 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-09 07:56:00,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681028447] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:00,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:00,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 29 [2024-11-09 07:56:00,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384197343] [2024-11-09 07:56:00,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:00,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 07:56:00,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:00,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 07:56:00,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:56:00,192 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-09 07:56:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:00,592 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-11-09 07:56:00,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:56:00,593 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-09 07:56:00,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:00,593 INFO L225 Difference]: With dead ends: 70 [2024-11-09 07:56:00,594 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 07:56:00,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 07:56:00,595 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:00,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 456 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:56:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 07:56:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-09 07:56:00,597 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-09 07:56:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2024-11-09 07:56:00,598 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 27 [2024-11-09 07:56:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:00,598 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2024-11-09 07:56:00,598 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-09 07:56:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2024-11-09 07:56:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:56:00,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:00,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:00,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:56:00,803 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-09 07:56:00,804 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-09 07:56:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash -564925807, now seen corresponding path program 1 times [2024-11-09 07:56:00,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:00,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418235234] [2024-11-09 07:56:00,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:00,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:01,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:56:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:01,084 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-09 07:56:01,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:01,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418235234] [2024-11-09 07:56:01,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418235234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:01,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683015611] [2024-11-09 07:56:01,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:01,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:01,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:01,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:01,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:56:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:01,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 07:56:01,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:01,757 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-09 07:56:01,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:01,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683015611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:01,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:01,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2024-11-09 07:56:01,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234888882] [2024-11-09 07:56:01,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:01,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:56:01,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:01,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:56:01,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:56:01,903 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-09 07:56:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:02,098 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-11-09 07:56:02,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:56:02,099 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-09 07:56:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:02,100 INFO L225 Difference]: With dead ends: 72 [2024-11-09 07:56:02,100 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 07:56:02,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:56:02,101 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-09 07:56:02,101 INFO L433 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-09 07:56:02,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 07:56:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-09 07:56:02,103 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-09 07:56:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2024-11-09 07:56:02,104 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 28 [2024-11-09 07:56:02,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:02,104 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2024-11-09 07:56:02,104 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-09 07:56:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-11-09 07:56:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:56:02,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:02,105 INFO L215 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-09 07:56:02,121 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-09 07:56:02,309 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-09 07:56:02,310 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-09 07:56:02,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1722766016, now seen corresponding path program 1 times [2024-11-09 07:56:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552306690] [2024-11-09 07:56:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:02,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:56:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 07:56:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,862 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-09 07:56:02,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:02,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552306690] [2024-11-09 07:56:02,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552306690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:02,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772400066] [2024-11-09 07:56:02,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:02,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:02,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:02,865 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-09 07:56:02,866 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-09 07:56:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:56:03,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:03,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:03,055 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-09 07:56:03,082 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-09 07:56:03,142 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:03,143 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-09 07:56:03,158 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-09 07:56:03,193 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-09 07:56:03,229 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:56:03,230 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-09 07:56:03,233 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-09 07:56:03,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:03,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772400066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:03,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:03,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2024-11-09 07:56:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776106049] [2024-11-09 07:56:03,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:03,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:56:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:03,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:56:03,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2024-11-09 07:56:03,294 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-09 07:56:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:03,566 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-09 07:56:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:56:03,567 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-09 07:56:03,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:03,568 INFO L225 Difference]: With dead ends: 57 [2024-11-09 07:56:03,568 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 07:56:03,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=663, Unknown=1, NotChecked=52, Total=812 [2024-11-09 07:56:03,569 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:03,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 352 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2024-11-09 07:56:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 07:56:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 07:56:03,572 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-09 07:56:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-09 07:56:03,572 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 36 [2024-11-09 07:56:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:03,573 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-09 07:56:03,573 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-09 07:56:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-09 07:56:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:56:03,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:03,574 INFO L215 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-09 07:56:03,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:56:03,774 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-09 07:56:03,775 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-09 07:56:03,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1722766015, now seen corresponding path program 1 times [2024-11-09 07:56:03,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:03,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134453128] [2024-11-09 07:56:03,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:56:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:04,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:04,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 07:56:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:04,494 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-09 07:56:04,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:04,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134453128] [2024-11-09 07:56:04,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134453128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:04,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811018754] [2024-11-09 07:56:04,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:04,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:04,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:04,497 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-09 07:56:04,499 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-09 07:56:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:04,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 07:56:04,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:04,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:56:04,741 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:04,741 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-09 07:56:04,776 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-09 07:56:04,778 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-09 07:56:04,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:04,863 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-09 07:56:04,870 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-09 07:56:04,926 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-09 07:56:04,932 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-09 07:56:05,034 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-09 07:56:05,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:05,048 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-09 07:56:05,054 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:05,054 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-09 07:56:05,081 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-09 07:56:05,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811018754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:05,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:05,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 30 [2024-11-09 07:56:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065556203] [2024-11-09 07:56:05,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:05,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 07:56:05,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:05,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 07:56:05,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=899, Unknown=1, NotChecked=60, Total=1056 [2024-11-09 07:56:05,204 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-09 07:56:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:05,698 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-11-09 07:56:05,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:56:05,699 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-09 07:56:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:05,700 INFO L225 Difference]: With dead ends: 54 [2024-11-09 07:56:05,700 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 07:56:05,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=1319, Unknown=1, NotChecked=74, Total=1560 [2024-11-09 07:56:05,701 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:05,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 482 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 480 Invalid, 0 Unknown, 50 Unchecked, 0.3s Time] [2024-11-09 07:56:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 07:56:05,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2024-11-09 07:56:05,704 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-09 07:56:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-09 07:56:05,706 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 36 [2024-11-09 07:56:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:05,707 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-09 07:56:05,707 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-09 07:56:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-09 07:56:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:56:05,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:05,708 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:05,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:56:05,908 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-09 07:56:05,909 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-09 07:56:05,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:05,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1171690712, now seen corresponding path program 1 times [2024-11-09 07:56:05,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:05,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569185775] [2024-11-09 07:56:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:06,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:56:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:06,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:06,195 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-09 07:56:06,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:06,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569185775] [2024-11-09 07:56:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569185775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:06,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431304586] [2024-11-09 07:56:06,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:06,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:06,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:06,198 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-09 07:56:06,204 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-09 07:56:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:06,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:56:06,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:06,343 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-09 07:56:06,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:06,375 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-09 07:56:06,444 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-09 07:56:06,448 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-09 07:56:06,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:06,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:06,510 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-09 07:56:06,592 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-09 07:56:06,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431304586] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:06,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:06,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2024-11-09 07:56:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068905106] [2024-11-09 07:56:06,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:06,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:56:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:06,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:56:06,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:56:06,595 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-09 07:56:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:06,916 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2024-11-09 07:56:06,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:56:06,919 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-09 07:56:06,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:06,919 INFO L225 Difference]: With dead ends: 65 [2024-11-09 07:56:06,919 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 07:56:06,920 INFO L431 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-09 07:56:06,920 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-09 07:56:06,921 INFO L433 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-09 07:56:06,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 07:56:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-11-09 07:56:06,924 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-09 07:56:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-09 07:56:06,925 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 36 [2024-11-09 07:56:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:06,925 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-09 07:56:06,925 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-09 07:56:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-11-09 07:56:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:56:06,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:06,926 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:06,943 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-09 07:56:07,130 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-09 07:56:07,131 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-09 07:56:07,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:07,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1171690713, now seen corresponding path program 1 times [2024-11-09 07:56:07,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:07,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956210478] [2024-11-09 07:56:07,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:07,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:56:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,426 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-09 07:56:07,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:07,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956210478] [2024-11-09 07:56:07,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956210478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:07,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299676968] [2024-11-09 07:56:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:07,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:07,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:07,430 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-09 07:56:07,431 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-09 07:56:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:56:07,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:07,780 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-09 07:56:07,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:07,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:07,917 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-09 07:56:08,056 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-09 07:56:08,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299676968] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:08,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2024-11-09 07:56:08,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701017894] [2024-11-09 07:56:08,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:08,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 07:56:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:08,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 07:56:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2024-11-09 07:56:08,058 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-09 07:56:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:08,247 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-11-09 07:56:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:56:08,248 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-09 07:56:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:08,249 INFO L225 Difference]: With dead ends: 67 [2024-11-09 07:56:08,249 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 07:56:08,249 INFO L431 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-09 07:56:08,250 INFO L432 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-09 07:56:08,250 INFO L433 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-09 07:56:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 07:56:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-11-09 07:56:08,253 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-09 07:56:08,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-11-09 07:56:08,254 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 36 [2024-11-09 07:56:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:08,254 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-11-09 07:56:08,255 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-09 07:56:08,255 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-11-09 07:56:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:56:08,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:08,256 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:08,274 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-09 07:56:08,460 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-09 07:56:08,461 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-09 07:56:08,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 217655197, now seen corresponding path program 1 times [2024-11-09 07:56:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:08,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800349645] [2024-11-09 07:56:08,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:08,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:09,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:56:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:09,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:09,552 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-09 07:56:09,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800349645] [2024-11-09 07:56:09,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800349645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284052109] [2024-11-09 07:56:09,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:09,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:09,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:09,555 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-09 07:56:09,557 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-09 07:56:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:09,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 07:56:09,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:09,707 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-09 07:56:09,828 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:56:09,828 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-09 07:56:10,001 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-09 07:56:10,001 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-09 07:56:10,031 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-09 07:56:10,116 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:56:10,117 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-09 07:56:10,270 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-09 07:56:10,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:10,305 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-09 07:56:10,406 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-09 07:56:10,408 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-09 07:56:10,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:10,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:10,602 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-09 07:56:10,712 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-09 07:56:10,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:10,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:10,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284052109] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:10,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:10,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2024-11-09 07:56:10,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633889534] [2024-11-09 07:56:10,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:10,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 07:56:10,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:10,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 07:56:10,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1765, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 07:56:10,849 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-09 07:56:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:11,705 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2024-11-09 07:56:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:56:11,706 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-09 07:56:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:11,706 INFO L225 Difference]: With dead ends: 71 [2024-11-09 07:56:11,706 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 07:56:11,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=245, Invalid=2947, Unknown=0, NotChecked=0, Total=3192 [2024-11-09 07:56:11,708 INFO L432 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:11,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 329 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:56:11,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 07:56:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-09 07:56:11,710 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-09 07:56:11,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-11-09 07:56:11,711 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 42 [2024-11-09 07:56:11,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:11,711 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-09 07:56:11,711 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-09 07:56:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-11-09 07:56:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:56:11,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:11,712 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:11,725 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-09 07:56:11,912 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-09 07:56:11,913 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-09 07:56:11,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash 217655198, now seen corresponding path program 1 times [2024-11-09 07:56:11,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:11,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508752314] [2024-11-09 07:56:11,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:11,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:12,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:56:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:12,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:12,878 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-09 07:56:12,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:12,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508752314] [2024-11-09 07:56:12,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508752314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:12,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134062279] [2024-11-09 07:56:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:12,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:12,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:12,881 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-09 07:56:12,883 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-09 07:56:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:13,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 07:56:13,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:13,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:56:13,246 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:13,246 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-09 07:56:13,284 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-09 07:56:13,291 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-09 07:56:13,376 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:56:13,376 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-09 07:56:13,381 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-09 07:56:13,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:13,573 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-09 07:56:13,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:13,590 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-09 07:56:13,698 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-09 07:56:13,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:14,066 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-09 07:56:14,080 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-09 07:56:14,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:14,101 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-09 07:56:14,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:14,109 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-09 07:56:14,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:14,121 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-09 07:56:14,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:14,137 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-09 07:56:14,144 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-09 07:56:14,146 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-09 07:56:14,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:14,173 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-09 07:56:14,176 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:14,178 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-09 07:56:14,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134062279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:14,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:14,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2024-11-09 07:56:14,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113749943] [2024-11-09 07:56:14,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:14,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 07:56:14,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:14,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 07:56:14,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2292, Unknown=2, NotChecked=194, Total=2652 [2024-11-09 07:56:14,338 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-09 07:56:15,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:15,002 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2024-11-09 07:56:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:56:15,002 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-09 07:56:15,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:15,003 INFO L225 Difference]: With dead ends: 73 [2024-11-09 07:56:15,003 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 07:56:15,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=267, Invalid=3521, Unknown=2, NotChecked=242, Total=4032 [2024-11-09 07:56:15,005 INFO L432 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-09 07:56:15,005 INFO L433 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-09 07:56:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 07:56:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-09 07:56:15,007 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-09 07:56:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-11-09 07:56:15,008 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 42 [2024-11-09 07:56:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:15,008 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-11-09 07:56:15,008 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-09 07:56:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-11-09 07:56:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:56:15,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:15,009 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:15,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:56:15,213 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-09 07:56:15,214 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-09 07:56:15,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1842624955, now seen corresponding path program 1 times [2024-11-09 07:56:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460123186] [2024-11-09 07:56:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:56:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:15,932 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-09 07:56:15,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:15,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460123186] [2024-11-09 07:56:15,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460123186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:15,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891690290] [2024-11-09 07:56:15,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:15,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:15,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:15,935 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-09 07:56:15,936 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-09 07:56:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:16,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 07:56:16,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:16,266 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:16,266 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-09 07:56:16,306 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-09 07:56:16,373 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:56:16,374 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-09 07:56:16,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:16,490 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-09 07:56:16,546 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-09 07:56:16,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:16,682 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-09 07:56:16,687 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-09 07:56:16,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:16,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-09 07:56:16,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:16,702 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-09 07:56:16,705 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-09 07:56:16,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891690290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:16,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:16,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 37 [2024-11-09 07:56:16,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102540859] [2024-11-09 07:56:16,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:16,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 07:56:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:16,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 07:56:16,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1602, Unknown=2, NotChecked=162, Total=1892 [2024-11-09 07:56:16,839 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-09 07:56:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:17,498 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-09 07:56:17,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:56:17,498 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-09 07:56:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:17,499 INFO L225 Difference]: With dead ends: 75 [2024-11-09 07:56:17,499 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 07:56:17,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=2746, Unknown=2, NotChecked=214, Total=3192 [2024-11-09 07:56:17,500 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-09 07:56:17,501 INFO L433 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-09 07:56:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 07:56:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-11-09 07:56:17,503 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-09 07:56:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-09 07:56:17,503 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 43 [2024-11-09 07:56:17,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:17,504 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-09 07:56:17,504 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-09 07:56:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-09 07:56:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:56:17,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:17,504 INFO L215 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-09 07:56:17,519 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-09 07:56:17,708 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-09 07:56:17,709 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-09 07:56:17,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:17,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1234605335, now seen corresponding path program 1 times [2024-11-09 07:56:17,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:17,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645393661] [2024-11-09 07:56:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:17,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:18,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:56:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:18,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:18,485 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-09 07:56:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:18,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645393661] [2024-11-09 07:56:18,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645393661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:18,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270618273] [2024-11-09 07:56:18,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:18,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:18,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:18,488 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-09 07:56:18,490 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-09 07:56:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:18,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 07:56:18,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:18,793 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:18,793 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-09 07:56:18,839 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-09 07:56:18,924 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:56:18,924 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-09 07:56:19,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:19,087 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-09 07:56:19,177 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-09 07:56:19,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:19,425 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-09 07:56:19,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:19,432 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-09 07:56:19,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:19,444 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-09 07:56:19,448 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-09 07:56:19,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270618273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:19,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:19,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 36 [2024-11-09 07:56:19,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673626233] [2024-11-09 07:56:19,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:19,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-09 07:56:19,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:19,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-09 07:56:19,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1664, Unknown=18, NotChecked=82, Total=1892 [2024-11-09 07:56:19,541 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-09 07:56:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:20,159 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-11-09 07:56:20,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:56:20,160 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-09 07:56:20,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:20,160 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:56:20,160 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 07:56:20,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=229, Invalid=2835, Unknown=20, NotChecked=108, Total=3192 [2024-11-09 07:56:20,162 INFO L432 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-09 07:56:20,162 INFO L433 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-09 07:56:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 07:56:20,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-11-09 07:56:20,166 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-09 07:56:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-09 07:56:20,167 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 45 [2024-11-09 07:56:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:20,167 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-09 07:56:20,167 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-09 07:56:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-09 07:56:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 07:56:20,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:20,168 INFO L215 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-09 07:56:20,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 07:56:20,368 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-09 07:56:20,369 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-09 07:56:20,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1972490914, now seen corresponding path program 2 times [2024-11-09 07:56:20,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:20,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537883737] [2024-11-09 07:56:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:20,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 07:56:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 07:56:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:21,721 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-09 07:56:21,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:21,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537883737] [2024-11-09 07:56:21,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537883737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:21,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180232717] [2024-11-09 07:56:21,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:56:21,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:21,724 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-09 07:56:21,725 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-09 07:56:21,873 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:56:21,873 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:56:21,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-09 07:56:21,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:21,880 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-09 07:56:22,011 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-09 07:56:22,014 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-09 07:56:22,084 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:22,084 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-09 07:56:22,153 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-09 07:56:22,159 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-09 07:56:22,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:22,283 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2024-11-09 07:56:22,284 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-09 07:56:22,294 INFO L349 Elim1Store]: treesize reduction 33, result has 28.3 percent of original size [2024-11-09 07:56:22,294 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-09 07:56:22,811 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-09 07:56:22,811 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-09 07:56:22,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:22,818 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-09 07:56:22,859 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-09 07:56:22,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:05,640 INFO L349 Elim1Store]: treesize reduction 234, result has 49.9 percent of original size [2024-11-09 07:57:05,640 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-09 07:57:06,137 INFO L349 Elim1Store]: treesize reduction 204, result has 39.5 percent of original size [2024-11-09 07:57:06,138 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-09 07:57:06,470 INFO L349 Elim1Store]: treesize reduction 12, result has 93.2 percent of original size [2024-11-09 07:57:06,470 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-09 07:57:06,902 INFO L349 Elim1Store]: treesize reduction 366, result has 45.6 percent of original size [2024-11-09 07:57:06,902 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-09 07:57:07,271 INFO L349 Elim1Store]: treesize reduction 304, result has 43.1 percent of original size [2024-11-09 07:57:07,272 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-09 07:57:07,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:07,479 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