./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.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 f1741d130075f1f7f25c8fd49724f342261e16295a533d1b7fc59c9fdd3354e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:21:57,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:21:58,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-10 15:21:58,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:21:58,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:21:58,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:21:58,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:21:58,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:21:58,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:21:58,043 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:21:58,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:21:58,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:21:58,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:21:58,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:21:58,046 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:21:58,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:21:58,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:21:58,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:21:58,050 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:21:58,050 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:21:58,050 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:21:58,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:21:58,051 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:21:58,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:21:58,051 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:21:58,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:21:58,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:21:58,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:21:58,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:21:58,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:21:58,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:21:58,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:21:58,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:21:58,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:21:58,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:21:58,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:21:58,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:21:58,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:21:58,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:21:58,054 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 -> f1741d130075f1f7f25c8fd49724f342261e16295a533d1b7fc59c9fdd3354e1 [2024-11-10 15:21:58,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:21:58,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:21:58,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:21:58,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:21:58,286 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:21:58,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.i [2024-11-10 15:21:59,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:21:59,843 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:21:59,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-sll-after.i [2024-11-10 15:21:59,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe77c7df/6ce767044c194e408a10c27f4f3cd3ce/FLAG53bddefae [2024-11-10 15:22:00,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe77c7df/6ce767044c194e408a10c27f4f3cd3ce [2024-11-10 15:22:00,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:22:00,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:22:00,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:22:00,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:22:00,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:22:00,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe372d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00, skipping insertion in model container [2024-11-10 15:22:00,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:22:00,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:22:00,504 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:22:00,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:22:00,577 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:22:00,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00 WrapperNode [2024-11-10 15:22:00,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:22:00,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:22:00,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:22:00,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:22:00,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,610 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2024-11-10 15:22:00,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:22:00,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:22:00,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:22:00,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:22:00,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,709 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2024-11-10 15:22:00,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:22:00,738 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:22:00,738 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:22:00,738 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:22:00,739 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (1/1) ... [2024-11-10 15:22:00,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:22:00,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:00,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:22:00,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:22:00,804 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-11-10 15:22:00,805 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-11-10 15:22:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-10 15:22:00,805 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-10 15:22:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:22:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:22:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:22:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:22:00,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:22:00,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:22:00,891 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:22:00,893 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:22:01,082 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-11-10 15:22:01,083 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:22:01,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:22:01,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:22:01,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:22:01 BoogieIcfgContainer [2024-11-10 15:22:01,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:22:01,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:22:01,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:22:01,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:22:01,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:22:00" (1/3) ... [2024-11-10 15:22:01,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1529e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:22:01, skipping insertion in model container [2024-11-10 15:22:01,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:00" (2/3) ... [2024-11-10 15:22:01,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e1529e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:22:01, skipping insertion in model container [2024-11-10 15:22:01,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:22:01" (3/3) ... [2024-11-10 15:22:01,102 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-shared-sll-after.i [2024-11-10 15:22:01,114 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:22:01,114 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-10 15:22:01,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:22:01,152 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;@6e5f3e2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:22:01,152 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-11-10 15:22:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 86 states have internal predecessors, (96), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:22:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:22:01,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:01,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:22:01,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:01,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:01,165 INFO L85 PathProgramCache]: Analyzing trace with hash 119268971, now seen corresponding path program 1 times [2024-11-10 15:22:01,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:01,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259144218] [2024-11-10 15:22:01,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:01,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:01,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259144218] [2024-11-10 15:22:01,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259144218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:01,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:01,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:22:01,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140538576] [2024-11-10 15:22:01,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:01,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:22:01,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:01,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:22:01,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:22:01,404 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 86 states have internal predecessors, (96), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:22:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:01,479 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-11-10 15:22:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:22:01,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:22:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:01,487 INFO L225 Difference]: With dead ends: 91 [2024-11-10 15:22:01,487 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 15:22:01,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:22:01,491 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:01,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 153 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:01,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 15:22:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-10 15:22:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 81 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:22:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2024-11-10 15:22:01,522 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 5 [2024-11-10 15:22:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:01,523 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2024-11-10 15:22:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:22:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2024-11-10 15:22:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:22:01,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:01,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:22:01,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:22:01,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:01,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash 119268972, now seen corresponding path program 1 times [2024-11-10 15:22:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:01,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581139151] [2024-11-10 15:22:01,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:01,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:01,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:01,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581139151] [2024-11-10 15:22:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581139151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:01,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:01,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:22:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423388452] [2024-11-10 15:22:01,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:01,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:22:01,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:01,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:22:01,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:22:01,608 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:22:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:01,652 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2024-11-10 15:22:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:22:01,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:22:01,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:01,656 INFO L225 Difference]: With dead ends: 86 [2024-11-10 15:22:01,656 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 15:22:01,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:22:01,657 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:01,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:22:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 15:22:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 15:22:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 79 states have internal predecessors, (84), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:22:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-11-10 15:22:01,665 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 5 [2024-11-10 15:22:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:01,665 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-11-10 15:22:01,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:22:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-11-10 15:22:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:22:01,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:01,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:01,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:22:01,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:01,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:01,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1735446498, now seen corresponding path program 1 times [2024-11-10 15:22:01,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:01,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363046523] [2024-11-10 15:22:01,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:01,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:01,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:01,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:01,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363046523] [2024-11-10 15:22:01,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363046523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:01,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:01,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:22:01,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438421810] [2024-11-10 15:22:01,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:01,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:22:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:01,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:22:01,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:22:01,748 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:01,816 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2024-11-10 15:22:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:22:01,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-10 15:22:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:01,818 INFO L225 Difference]: With dead ends: 85 [2024-11-10 15:22:01,818 INFO L226 Difference]: Without dead ends: 85 [2024-11-10 15:22:01,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:22:01,819 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:01,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 192 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-10 15:22:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-10 15:22:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.509090909090909) internal successors, (83), 78 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:22:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-10 15:22:01,825 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 17 [2024-11-10 15:22:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:01,827 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-10 15:22:01,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-10 15:22:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:22:01,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:01,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:01,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:22:01,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:01,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:01,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1735446497, now seen corresponding path program 1 times [2024-11-10 15:22:01,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:01,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985997846] [2024-11-10 15:22:01,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:01,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:01,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:01,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985997846] [2024-11-10 15:22:01,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985997846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:01,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:01,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:22:01,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400804317] [2024-11-10 15:22:01,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:01,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:22:01,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:01,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:22:01,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:22:01,915 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:01,975 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-10 15:22:01,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:22:01,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-10 15:22:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:01,976 INFO L225 Difference]: With dead ends: 84 [2024-11-10 15:22:01,977 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:22:01,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:22:01,978 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:01,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 201 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:22:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 15:22:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.490909090909091) internal successors, (82), 77 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 15:22:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-11-10 15:22:01,983 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 17 [2024-11-10 15:22:01,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:01,983 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-11-10 15:22:01,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:22:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-11-10 15:22:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:22:01,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:01,985 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:01,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:22:01,985 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:01,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash -475954058, now seen corresponding path program 1 times [2024-11-10 15:22:01,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:01,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897564600] [2024-11-10 15:22:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:01,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 15:22:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:02,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:02,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897564600] [2024-11-10 15:22:02,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897564600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:02,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601108691] [2024-11-10 15:22:02,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:02,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:02,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:02,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:02,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:22:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:22:02,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:02,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:02,588 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-10 15:22:02,667 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:22:02,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:22:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-10 15:22:02,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:02,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601108691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:02,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:02,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-11-10 15:22:02,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104441653] [2024-11-10 15:22:02,727 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:02,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:22:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:02,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:22:02,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-10 15:22:02,728 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:22:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:02,954 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2024-11-10 15:22:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:22:02,954 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2024-11-10 15:22:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:02,955 INFO L225 Difference]: With dead ends: 89 [2024-11-10 15:22:02,955 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 15:22:02,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:22:02,956 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:02,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 414 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 278 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2024-11-10 15:22:02,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 15:22:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-10 15:22:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 79 states have internal predecessors, (86), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:22:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-10 15:22:02,967 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 20 [2024-11-10 15:22:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:02,967 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-10 15:22:02,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 15:22:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-10 15:22:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 15:22:02,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:02,968 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:02,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 15:22:03,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:03,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:03,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:03,171 INFO L85 PathProgramCache]: Analyzing trace with hash -475954057, now seen corresponding path program 1 times [2024-11-10 15:22:03,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:03,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488862103] [2024-11-10 15:22:03,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:03,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:03,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:03,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 15:22:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:03,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488862103] [2024-11-10 15:22:03,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488862103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:03,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408657402] [2024-11-10 15:22:03,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:03,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:03,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:03,578 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:03,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:22:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:03,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:22:03,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:03,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:22:03,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:03,792 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:22:03,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:03,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:22:03,830 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:03,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-10 15:22:03,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:03,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408657402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:03,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:03,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2024-11-10 15:22:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636477158] [2024-11-10 15:22:03,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:03,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 15:22:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:03,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 15:22:03,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2024-11-10 15:22:03,935 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:04,235 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2024-11-10 15:22:04,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:22:04,235 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 12 states have internal predecessors, (30), 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 20 [2024-11-10 15:22:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:04,236 INFO L225 Difference]: With dead ends: 91 [2024-11-10 15:22:04,236 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 15:22:04,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=355, Unknown=1, NotChecked=38, Total=462 [2024-11-10 15:22:04,237 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:04,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 659 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 463 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2024-11-10 15:22:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 15:22:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-10 15:22:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.45) internal successors, (87), 81 states have internal predecessors, (87), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:22:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-11-10 15:22:04,241 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 20 [2024-11-10 15:22:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:04,245 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-11-10 15:22:04,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 12 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-11-10 15:22:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:22:04,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:04,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:04,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:22:04,450 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,SelfDestructingSolverStorable5 [2024-11-10 15:22:04,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:04,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:04,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2099701431, now seen corresponding path program 1 times [2024-11-10 15:22:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:04,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557685080] [2024-11-10 15:22:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:04,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:04,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:04,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:04,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557685080] [2024-11-10 15:22:04,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557685080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:04,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:04,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:22:04,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467173225] [2024-11-10 15:22:04,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:04,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:22:04,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:04,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:22:04,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:22:04,627 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:04,907 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2024-11-10 15:22:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:22:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-10 15:22:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:04,907 INFO L225 Difference]: With dead ends: 91 [2024-11-10 15:22:04,908 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 15:22:04,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:22:04,908 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:04,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 448 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:22:04,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 15:22:04,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 15:22:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 83 states have internal predecessors, (91), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:22:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2024-11-10 15:22:04,916 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 28 [2024-11-10 15:22:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:04,917 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2024-11-10 15:22:04,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2024-11-10 15:22:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:22:04,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:04,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:04,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:22:04,918 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:04,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:04,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2099701432, now seen corresponding path program 1 times [2024-11-10 15:22:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:04,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706151556] [2024-11-10 15:22:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:04,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:05,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:05,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:05,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706151556] [2024-11-10 15:22:05,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706151556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:05,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:05,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 15:22:05,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166763702] [2024-11-10 15:22:05,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:05,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:22:05,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:05,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:22:05,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:22:05,213 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:05,515 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2024-11-10 15:22:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:22:05,516 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-10 15:22:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:05,517 INFO L225 Difference]: With dead ends: 113 [2024-11-10 15:22:05,517 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 15:22:05,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-10 15:22:05,518 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 22 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:05,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 486 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:22:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 15:22:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2024-11-10 15:22:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 94 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:05,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-10 15:22:05,522 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 28 [2024-11-10 15:22:05,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:05,523 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-10 15:22:05,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-10 15:22:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:22:05,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:05,524 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, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:05,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:22:05,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:05,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1700352963, now seen corresponding path program 1 times [2024-11-10 15:22:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:05,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053537449] [2024-11-10 15:22:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:05,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:05,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:05,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:05,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:22:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:05,644 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-10 15:22:05,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:05,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053537449] [2024-11-10 15:22:05,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053537449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:05,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564843624] [2024-11-10 15:22:05,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:05,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:05,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:05,649 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:05,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:22:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:05,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:22:05,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:05,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:05,748 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-10 15:22:05,769 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:22:05,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:22:05,772 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-10 15:22:05,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:05,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564843624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:05,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:05,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-11-10 15:22:05,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639744988] [2024-11-10 15:22:05,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:05,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:22:05,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:05,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:22:05,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-10 15:22:05,802 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:22:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:05,984 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2024-11-10 15:22:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:22:05,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2024-11-10 15:22:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:05,985 INFO L225 Difference]: With dead ends: 108 [2024-11-10 15:22:05,986 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 15:22:05,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:22:05,986 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 8 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:05,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 455 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 297 Invalid, 0 Unknown, 92 Unchecked, 0.1s Time] [2024-11-10 15:22:05,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 15:22:05,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2024-11-10 15:22:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 96 states have internal predecessors, (108), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 15:22:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2024-11-10 15:22:05,990 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 30 [2024-11-10 15:22:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:05,990 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2024-11-10 15:22:05,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:22:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2024-11-10 15:22:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:22:05,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:05,991 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, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:06,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 15:22:06,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:06,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:06,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1700352964, now seen corresponding path program 1 times [2024-11-10 15:22:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:06,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059562404] [2024-11-10 15:22:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:06,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:06,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:06,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:06,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:22:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:06,380 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-10 15:22:06,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:06,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059562404] [2024-11-10 15:22:06,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059562404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:06,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803950425] [2024-11-10 15:22:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:06,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:06,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:06,382 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:06,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:22:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:06,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 15:22:06,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:06,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:06,501 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-10 15:22:06,514 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:22:06,515 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 12 treesize of output 14 [2024-11-10 15:22:06,522 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-10 15:22:06,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:06,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803950425] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:06,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:06,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-11-10 15:22:06,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694749935] [2024-11-10 15:22:06,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:06,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:22:06,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:22:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-11-10 15:22:06,575 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:22:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:06,734 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2024-11-10 15:22:06,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:22:06,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2024-11-10 15:22:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:06,739 INFO L225 Difference]: With dead ends: 110 [2024-11-10 15:22:06,739 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 15:22:06,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=146, Unknown=1, NotChecked=24, Total=210 [2024-11-10 15:22:06,740 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:06,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 489 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 93 Unchecked, 0.1s Time] [2024-11-10 15:22:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 15:22:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2024-11-10 15:22:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.379746835443038) internal successors, (109), 98 states have internal predecessors, (109), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 15:22:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2024-11-10 15:22:06,744 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 30 [2024-11-10 15:22:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:06,744 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2024-11-10 15:22:06,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:22:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2024-11-10 15:22:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:22:06,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:06,745 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, 1, 1, 1] [2024-11-10 15:22:06,758 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-10 15:22:06,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:06,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:06,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:06,950 INFO L85 PathProgramCache]: Analyzing trace with hash 300573367, now seen corresponding path program 1 times [2024-11-10 15:22:06,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:06,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190619386] [2024-11-10 15:22:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:07,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:07,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:07,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:07,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190619386] [2024-11-10 15:22:07,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190619386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:07,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:07,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:22:07,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589935718] [2024-11-10 15:22:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:07,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:22:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:07,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:22:07,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:07,035 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:07,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:07,131 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2024-11-10 15:22:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:22:07,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-10 15:22:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:07,132 INFO L225 Difference]: With dead ends: 109 [2024-11-10 15:22:07,132 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 15:22:07,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:22:07,133 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 32 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:07,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 591 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 15:22:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-10 15:22:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 98 states have internal predecessors, (107), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 15:22:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2024-11-10 15:22:07,136 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 31 [2024-11-10 15:22:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:07,136 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2024-11-10 15:22:07,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2024-11-10 15:22:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:22:07,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:07,137 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:07,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:22:07,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:07,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1623946854, now seen corresponding path program 1 times [2024-11-10 15:22:07,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:07,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785981166] [2024-11-10 15:22:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:07,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 15:22:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:07,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 15:22:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:22:07,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:07,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785981166] [2024-11-10 15:22:07,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785981166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:07,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194985804] [2024-11-10 15:22:07,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:07,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:07,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:07,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:22:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:07,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 15:22:07,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:07,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:07,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:22:07,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:22:07,434 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2024-11-10 15:22:07,451 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:22:07,451 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 12 treesize of output 14 [2024-11-10 15:22:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-10 15:22:07,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:07,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194985804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:22:07,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:22:07,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 13 [2024-11-10 15:22:07,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095889534] [2024-11-10 15:22:07,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:07,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:22:07,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:07,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:22:07,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:22:07,555 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:22:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:07,729 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2024-11-10 15:22:07,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:22:07,729 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-11-10 15:22:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:07,730 INFO L225 Difference]: With dead ends: 107 [2024-11-10 15:22:07,730 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 15:22:07,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-11-10 15:22:07,731 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 10 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:07,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 464 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 282 Invalid, 0 Unknown, 89 Unchecked, 0.1s Time] [2024-11-10 15:22:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 15:22:07,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-10 15:22:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 97 states have internal predecessors, (106), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 15:22:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2024-11-10 15:22:07,735 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 33 [2024-11-10 15:22:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:07,736 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2024-11-10 15:22:07,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:22:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2024-11-10 15:22:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:22:07,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:07,739 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:07,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:22:07,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-10 15:22:07,940 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:07,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1623946855, now seen corresponding path program 1 times [2024-11-10 15:22:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:07,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151628355] [2024-11-10 15:22:07,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:07,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:08,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:08,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 15:22:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 15:22:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:22:08,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:08,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151628355] [2024-11-10 15:22:08,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151628355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:08,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928937] [2024-11-10 15:22:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:08,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:08,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:08,269 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:08,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 15:22:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:08,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 15:22:08,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:08,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:08,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:22:08,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:08,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:22:08,473 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 26 treesize of output 14 [2024-11-10 15:22:08,543 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-10 15:22:08,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:08,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:22:08,574 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:08,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2024-11-10 15:22:08,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:08,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:08,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:08,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2024-11-10 15:22:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778574639] [2024-11-10 15:22:08,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:08,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 15:22:08,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:08,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 15:22:08,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=404, Unknown=1, NotChecked=40, Total=506 [2024-11-10 15:22:08,665 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 21 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:22:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:09,018 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-11-10 15:22:09,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:22:09,019 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2024-11-10 15:22:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:09,019 INFO L225 Difference]: With dead ends: 105 [2024-11-10 15:22:09,019 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 15:22:09,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=565, Unknown=1, NotChecked=48, Total=702 [2024-11-10 15:22:09,020 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:09,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 704 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 491 Invalid, 0 Unknown, 89 Unchecked, 0.3s Time] [2024-11-10 15:22:09,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 15:22:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2024-11-10 15:22:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 92 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2024-11-10 15:22:09,023 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 33 [2024-11-10 15:22:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:09,023 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2024-11-10 15:22:09,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:22:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2024-11-10 15:22:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:22:09,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:09,026 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:09,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 15:22:09,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:09,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:09,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:09,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2122676672, now seen corresponding path program 1 times [2024-11-10 15:22:09,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:09,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538667075] [2024-11-10 15:22:09,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:09,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:09,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:09,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:09,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538667075] [2024-11-10 15:22:09,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538667075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:09,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408250784] [2024-11-10 15:22:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:09,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:09,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:09,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:09,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 15:22:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:09,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-10 15:22:09,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:09,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:09,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:09,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:22:09,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:22:10,161 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (store (select |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base) 0 0))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (store (select |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base) 0 0)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-11-10 15:22:10,184 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:22:10,184 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 26 treesize of output 28 [2024-11-10 15:22:10,198 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 15:22:10,198 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 26 treesize of output 28 [2024-11-10 15:22:10,342 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2024-11-10 15:22:10,342 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 3 case distinctions, treesize of input 34 treesize of output 31 [2024-11-10 15:22:10,367 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2024-11-10 15:22:10,367 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 2 case distinctions, treesize of input 34 treesize of output 31 [2024-11-10 15:22:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:10,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408250784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:10,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2024-11-10 15:22:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216195620] [2024-11-10 15:22:10,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:10,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 15:22:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:10,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 15:22:10,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=792, Unknown=1, NotChecked=56, Total=930 [2024-11-10 15:22:10,767 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:11,453 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2024-11-10 15:22:11,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:22:11,454 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 25 states have internal predecessors, (52), 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 33 [2024-11-10 15:22:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:11,454 INFO L225 Difference]: With dead ends: 107 [2024-11-10 15:22:11,454 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 15:22:11,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=151, Invalid=1658, Unknown=1, NotChecked=82, Total=1892 [2024-11-10 15:22:11,455 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 12 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:11,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1126 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 651 Invalid, 0 Unknown, 106 Unchecked, 0.4s Time] [2024-11-10 15:22:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 15:22:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-11-10 15:22:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 95 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2024-11-10 15:22:11,458 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 33 [2024-11-10 15:22:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:11,459 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2024-11-10 15:22:11,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 25 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:22:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2024-11-10 15:22:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:22:11,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:11,459 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:11,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 15:22:11,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:11,664 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:11,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1856177934, now seen corresponding path program 1 times [2024-11-10 15:22:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:11,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746529208] [2024-11-10 15:22:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:11,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:11,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:11,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746529208] [2024-11-10 15:22:11,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746529208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:11,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343086896] [2024-11-10 15:22:11,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:11,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:11,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:11,726 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:11,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:22:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:11,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 15:22:11,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:11,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:11,875 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-10 15:22:11,893 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:22:11,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:22:11,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:11,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:22:11,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343086896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:11,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:22:11,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 13 [2024-11-10 15:22:11,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457578789] [2024-11-10 15:22:11,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:11,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:22:11,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:11,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:22:11,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=131, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:22:11,910 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:12,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:12,044 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2024-11-10 15:22:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:22:12,044 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 36 [2024-11-10 15:22:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:12,045 INFO L225 Difference]: With dead ends: 109 [2024-11-10 15:22:12,045 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 15:22:12,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=131, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:22:12,046 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 8 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:12,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 360 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 329 Invalid, 0 Unknown, 166 Unchecked, 0.1s Time] [2024-11-10 15:22:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 15:22:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-11-10 15:22:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 98 states have internal predecessors, (109), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2024-11-10 15:22:12,048 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 36 [2024-11-10 15:22:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:12,048 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2024-11-10 15:22:12,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2024-11-10 15:22:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:22:12,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:12,049 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:12,063 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-10 15:22:12,253 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,SelfDestructingSolverStorable14 [2024-11-10 15:22:12,254 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:12,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:12,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1856177935, now seen corresponding path program 1 times [2024-11-10 15:22:12,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:12,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807926589] [2024-11-10 15:22:12,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:12,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:12,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:12,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:12,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807926589] [2024-11-10 15:22:12,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807926589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:12,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330455753] [2024-11-10 15:22:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:12,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:12,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:12,476 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:12,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:22:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:12,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-10 15:22:12,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:12,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:12,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:22:12,716 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-10 15:22:12,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:12,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:22:12,741 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:12,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-10 15:22:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:12,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:22:12,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330455753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:12,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:22:12,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2024-11-10 15:22:12,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492977105] [2024-11-10 15:22:12,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:12,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:22:12,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:12,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:22:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=331, Unknown=1, NotChecked=36, Total=420 [2024-11-10 15:22:12,777 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:12,939 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2024-11-10 15:22:12,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:22:12,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 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 36 [2024-11-10 15:22:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:12,940 INFO L225 Difference]: With dead ends: 111 [2024-11-10 15:22:12,940 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 15:22:12,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=331, Unknown=1, NotChecked=36, Total=420 [2024-11-10 15:22:12,941 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:12,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 361 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 346 Invalid, 0 Unknown, 174 Unchecked, 0.2s Time] [2024-11-10 15:22:12,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 15:22:12,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-10 15:22:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 100 states have internal predecessors, (110), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2024-11-10 15:22:12,944 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 36 [2024-11-10 15:22:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:12,944 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2024-11-10 15:22:12,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2024-11-10 15:22:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:22:12,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:12,945 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:12,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:22:13,148 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,SelfDestructingSolverStorable15 [2024-11-10 15:22:13,149 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:13,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash -308297868, now seen corresponding path program 1 times [2024-11-10 15:22:13,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:13,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356692950] [2024-11-10 15:22:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:13,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:13,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:13,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:13,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356692950] [2024-11-10 15:22:13,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356692950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:13,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:13,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:22:13,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413989369] [2024-11-10 15:22:13,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:13,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:22:13,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:13,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:22:13,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:13,243 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:13,332 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2024-11-10 15:22:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:22:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-11-10 15:22:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:13,333 INFO L225 Difference]: With dead ends: 118 [2024-11-10 15:22:13,333 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 15:22:13,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:13,334 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:13,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 542 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 15:22:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2024-11-10 15:22:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 102 states have internal predecessors, (111), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2024-11-10 15:22:13,336 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 39 [2024-11-10 15:22:13,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:13,337 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2024-11-10 15:22:13,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2024-11-10 15:22:13,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:22:13,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:13,337 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:13,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:22:13,338 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:13,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:13,338 INFO L85 PathProgramCache]: Analyzing trace with hash -307096328, now seen corresponding path program 1 times [2024-11-10 15:22:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:13,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847833702] [2024-11-10 15:22:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:13,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:13,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:13,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:13,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847833702] [2024-11-10 15:22:13,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847833702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:13,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:13,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:22:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752983977] [2024-11-10 15:22:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:13,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:22:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:13,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:22:13,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:13,488 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:13,613 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2024-11-10 15:22:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:22:13,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-11-10 15:22:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:13,615 INFO L225 Difference]: With dead ends: 116 [2024-11-10 15:22:13,615 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 15:22:13,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:13,616 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 19 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:13,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 476 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 15:22:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-10 15:22:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 106 states have internal predecessors, (118), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 130 transitions. [2024-11-10 15:22:13,619 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 130 transitions. Word has length 39 [2024-11-10 15:22:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:13,619 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 130 transitions. [2024-11-10 15:22:13,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:22:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 130 transitions. [2024-11-10 15:22:13,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 15:22:13,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:13,621 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] [2024-11-10 15:22:13,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:22:13,621 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:13,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1356461084, now seen corresponding path program 1 times [2024-11-10 15:22:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:13,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089500483] [2024-11-10 15:22:13,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:13,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:13,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:22:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:14,031 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-10 15:22:14,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:14,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089500483] [2024-11-10 15:22:14,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089500483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:14,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001392092] [2024-11-10 15:22:14,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:14,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:14,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:14,033 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:14,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:22:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:14,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-10 15:22:14,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:14,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:14,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:22:14,402 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:22:14,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:22:14,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 15:22:14,507 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-10 15:22:14,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:14,536 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 14 treesize of output 9 [2024-11-10 15:22:14,551 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:22:14,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:22:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-10 15:22:14,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:14,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001392092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:14,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:14,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2024-11-10 15:22:14,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664604698] [2024-11-10 15:22:14,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:14,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:22:14,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:14,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:22:14,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=887, Unknown=1, NotChecked=60, Total=1056 [2024-11-10 15:22:14,764 INFO L87 Difference]: Start difference. First operand 115 states and 130 transitions. Second operand has 30 states, 28 states have (on average 2.357142857142857) internal successors, (66), 25 states have internal predecessors, (66), 4 states have call successors, (6), 3 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-10 15:22:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:15,312 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2024-11-10 15:22:15,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:22:15,312 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.357142857142857) internal successors, (66), 25 states have internal predecessors, (66), 4 states have call successors, (6), 3 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 40 [2024-11-10 15:22:15,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:15,313 INFO L225 Difference]: With dead ends: 116 [2024-11-10 15:22:15,313 INFO L226 Difference]: Without dead ends: 116 [2024-11-10 15:22:15,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=1181, Unknown=1, NotChecked=70, Total=1406 [2024-11-10 15:22:15,314 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 74 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:15,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 690 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 721 Invalid, 0 Unknown, 83 Unchecked, 0.4s Time] [2024-11-10 15:22:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-10 15:22:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-10 15:22:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 107 states have internal predecessors, (118), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2024-11-10 15:22:15,318 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 40 [2024-11-10 15:22:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:15,318 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2024-11-10 15:22:15,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.357142857142857) internal successors, (66), 25 states have internal predecessors, (66), 4 states have call successors, (6), 3 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-10 15:22:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2024-11-10 15:22:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:22:15,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:15,319 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, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:15,336 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-10 15:22:15,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:15,524 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:15,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash 410949671, now seen corresponding path program 1 times [2024-11-10 15:22:15,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:15,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314480472] [2024-11-10 15:22:15,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:15,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:15,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:15,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:15,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:22:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:15,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 15:22:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:22:15,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:15,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314480472] [2024-11-10 15:22:15,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314480472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:15,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789024680] [2024-11-10 15:22:15,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:15,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:15,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:15,700 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:15,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:22:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:15,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 15:22:15,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:15,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:15,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:22:15,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:22:15,848 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-10 15:22:15,861 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:22:15,861 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 12 treesize of output 14 [2024-11-10 15:22:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-10 15:22:15,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:15,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789024680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:22:15,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:22:15,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 13 [2024-11-10 15:22:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231465229] [2024-11-10 15:22:15,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:15,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 15:22:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:15,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 15:22:15,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:22:15,955 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 15:22:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:16,118 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2024-11-10 15:22:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:22:16,119 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-11-10 15:22:16,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:16,121 INFO L225 Difference]: With dead ends: 117 [2024-11-10 15:22:16,121 INFO L226 Difference]: Without dead ends: 117 [2024-11-10 15:22:16,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-11-10 15:22:16,122 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 12 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:16,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 487 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 296 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2024-11-10 15:22:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-10 15:22:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-11-10 15:22:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.2717391304347827) internal successors, (117), 106 states have internal predecessors, (117), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:16,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2024-11-10 15:22:16,124 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 42 [2024-11-10 15:22:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:16,124 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2024-11-10 15:22:16,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-10 15:22:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2024-11-10 15:22:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:22:16,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:16,133 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, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:16,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-10 15:22:16,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:16,334 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:16,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:16,336 INFO L85 PathProgramCache]: Analyzing trace with hash 410949672, now seen corresponding path program 1 times [2024-11-10 15:22:16,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:16,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939661301] [2024-11-10 15:22:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:16,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:16,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:22:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:16,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 15:22:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:22:16,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:16,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939661301] [2024-11-10 15:22:16,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939661301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:16,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043831291] [2024-11-10 15:22:16,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:16,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:16,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:16,641 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:16,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:22:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:16,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 15:22:16,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:16,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:16,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:22:16,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:16,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:22:16,803 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-10 15:22:16,814 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:22:16,815 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 12 treesize of output 14 [2024-11-10 15:22:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-10 15:22:16,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:16,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043831291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:16,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:16,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2024-11-10 15:22:16,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689359393] [2024-11-10 15:22:16,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:16,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:22:16,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:16,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:22:16,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-10 15:22:16,865 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:22:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:17,027 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2024-11-10 15:22:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:22:17,028 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-10 15:22:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:17,028 INFO L225 Difference]: With dead ends: 115 [2024-11-10 15:22:17,028 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 15:22:17,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2024-11-10 15:22:17,029 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:17,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 628 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2024-11-10 15:22:17,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 15:22:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2024-11-10 15:22:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:22:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2024-11-10 15:22:17,032 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 42 [2024-11-10 15:22:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:17,032 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2024-11-10 15:22:17,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-10 15:22:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2024-11-10 15:22:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 15:22:17,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:17,033 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:17,047 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-10 15:22:17,237 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,SelfDestructingSolverStorable20 [2024-11-10 15:22:17,237 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:17,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1714872429, now seen corresponding path program 1 times [2024-11-10 15:22:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:17,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880656991] [2024-11-10 15:22:17,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:17,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:17,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:17,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:17,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880656991] [2024-11-10 15:22:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880656991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:17,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175457876] [2024-11-10 15:22:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:17,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:17,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:17,401 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:17,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 15:22:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:17,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 15:22:17,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:17,610 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 8 treesize of output 1 [2024-11-10 15:22:17,612 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 8 treesize of output 1 [2024-11-10 15:22:17,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:17,709 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 15 treesize of output 15 [2024-11-10 15:22:17,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:17,719 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 15 treesize of output 15 [2024-11-10 15:22:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:17,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:17,987 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 33 treesize of output 29 [2024-11-10 15:22:17,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:17,996 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 36 treesize of output 40 [2024-11-10 15:22:18,000 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 39 treesize of output 35 [2024-11-10 15:22:18,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:18,007 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-10 15:22:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:18,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175457876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:22:18,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:22:18,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 18] total 30 [2024-11-10 15:22:18,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616699991] [2024-11-10 15:22:18,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:18,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:22:18,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:18,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:22:18,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2024-11-10 15:22:18,152 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 28 states have internal predecessors, (80), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:22:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:18,669 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2024-11-10 15:22:18,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 15:22:18,669 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 28 states have internal predecessors, (80), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2024-11-10 15:22:18,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:18,670 INFO L225 Difference]: With dead ends: 123 [2024-11-10 15:22:18,670 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 15:22:18,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=1422, Unknown=0, NotChecked=0, Total=1560 [2024-11-10 15:22:18,670 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:18,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1097 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:22:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 15:22:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2024-11-10 15:22:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 113 states have internal predecessors, (127), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-10 15:22:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2024-11-10 15:22:18,676 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 44 [2024-11-10 15:22:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:18,676 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2024-11-10 15:22:18,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 28 states have internal predecessors, (80), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 15:22:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2024-11-10 15:22:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:22:18,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:18,677 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:18,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-10 15:22:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-10 15:22:18,878 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash -598267172, now seen corresponding path program 1 times [2024-11-10 15:22:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841011748] [2024-11-10 15:22:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:18,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:19,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:19,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:22:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:19,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:19,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841011748] [2024-11-10 15:22:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841011748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:19,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459478445] [2024-11-10 15:22:19,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:19,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:19,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:19,788 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:19,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-10 15:22:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:19,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-10 15:22:19,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:19,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:19,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:19,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:19,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:22:19,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:22:20,377 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:22:20,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:22:20,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-10 15:22:20,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-10 15:22:20,545 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-11-10 15:22:20,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:20,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-10 15:22:20,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:20,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-10 15:22:20,589 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:22:20,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:22:20,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-10 15:22:20,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-10 15:22:20,798 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2024-11-10 15:22:20,798 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 3 case distinctions, treesize of input 34 treesize of output 31 [2024-11-10 15:22:20,824 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2024-11-10 15:22:20,824 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 2 case distinctions, treesize of input 34 treesize of output 31 [2024-11-10 15:22:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2024-11-10 15:22:20,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459478445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:21,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:21,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 42 [2024-11-10 15:22:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497861134] [2024-11-10 15:22:21,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:21,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 15:22:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:21,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 15:22:21,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1837, Unknown=8, NotChecked=86, Total=2070 [2024-11-10 15:22:21,332 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 42 states, 40 states have (on average 1.8) internal successors, (72), 34 states have internal predecessors, (72), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:22:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:22,458 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2024-11-10 15:22:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 15:22:22,459 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.8) internal successors, (72), 34 states have internal predecessors, (72), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2024-11-10 15:22:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:22,460 INFO L225 Difference]: With dead ends: 141 [2024-11-10 15:22:22,460 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 15:22:22,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=245, Invalid=3291, Unknown=8, NotChecked=116, Total=3660 [2024-11-10 15:22:22,461 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 47 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:22,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1261 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1020 Invalid, 0 Unknown, 114 Unchecked, 0.6s Time] [2024-11-10 15:22:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 15:22:22,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-11-10 15:22:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 116 states have (on average 1.2327586206896552) internal successors, (143), 128 states have internal predecessors, (143), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 15:22:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2024-11-10 15:22:22,464 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 45 [2024-11-10 15:22:22,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:22,464 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2024-11-10 15:22:22,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.8) internal successors, (72), 34 states have internal predecessors, (72), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:22:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2024-11-10 15:22:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:22:22,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:22,465 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-10 15:22:22,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-10 15:22:22,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:22,666 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:22,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:22,666 INFO L85 PathProgramCache]: Analyzing trace with hash -155701808, now seen corresponding path program 1 times [2024-11-10 15:22:22,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:22,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39182542] [2024-11-10 15:22:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:22,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 15:22:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:23,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 15:22:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39182542] [2024-11-10 15:22:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39182542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621195546] [2024-11-10 15:22:23,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:23,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:23,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:23,255 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:23,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 15:22:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:23,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 15:22:23,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:23,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:23,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:22:23,601 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2024-11-10 15:22:23,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:23,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-10 15:22:23,640 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2024-11-10 15:22:23,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2024-11-10 15:22:23,772 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 37 treesize of output 17 [2024-11-10 15:22:23,782 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 25 treesize of output 13 [2024-11-10 15:22:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:23,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:23,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621195546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:23,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:23,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 32 [2024-11-10 15:22:23,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799418692] [2024-11-10 15:22:23,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:23,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-10 15:22:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:23,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 15:22:23,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1023, Unknown=1, NotChecked=64, Total=1190 [2024-11-10 15:22:23,957 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand has 33 states, 30 states have (on average 2.5) internal successors, (75), 28 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:22:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:24,531 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2024-11-10 15:22:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 15:22:24,532 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.5) internal successors, (75), 28 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2024-11-10 15:22:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:24,533 INFO L225 Difference]: With dead ends: 164 [2024-11-10 15:22:24,533 INFO L226 Difference]: Without dead ends: 164 [2024-11-10 15:22:24,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=1496, Unknown=1, NotChecked=78, Total=1722 [2024-11-10 15:22:24,533 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:24,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1222 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 900 Invalid, 0 Unknown, 117 Unchecked, 0.4s Time] [2024-11-10 15:22:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-10 15:22:24,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2024-11-10 15:22:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 137 states have (on average 1.2262773722627738) internal successors, (168), 149 states have internal predecessors, (168), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:22:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2024-11-10 15:22:24,537 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 46 [2024-11-10 15:22:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:24,537 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2024-11-10 15:22:24,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.5) internal successors, (75), 28 states have internal predecessors, (75), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:22:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2024-11-10 15:22:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:22:24,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:24,538 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-10 15:22:24,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-10 15:22:24,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:24,738 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:24,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash -155701807, now seen corresponding path program 1 times [2024-11-10 15:22:24,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:24,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448414808] [2024-11-10 15:22:24,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:24,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:25,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:25,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 15:22:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:25,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 15:22:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:25,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:25,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448414808] [2024-11-10 15:22:25,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448414808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:25,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920144098] [2024-11-10 15:22:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:25,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:25,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:25,419 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:25,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-10 15:22:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:25,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-10 15:22:25,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:25,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:22:25,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:25,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:22:25,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:25,802 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-11-10 15:22:25,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:25,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-10 15:22:25,847 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-10 15:22:25,848 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 20 treesize of output 22 [2024-11-10 15:22:25,851 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-10 15:22:25,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:22:25,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 15:22:25,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-10 15:22:25,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 15:22:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:25,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:26,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920144098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:26,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:26,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 30 [2024-11-10 15:22:26,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24823317] [2024-11-10 15:22:26,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:26,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-10 15:22:26,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:26,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-10 15:22:26,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1092, Unknown=1, NotChecked=66, Total=1260 [2024-11-10 15:22:26,186 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand has 31 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 27 states have internal predecessors, (69), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:22:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:31,047 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2024-11-10 15:22:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 15:22:31,047 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 27 states have internal predecessors, (69), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2024-11-10 15:22:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:31,048 INFO L225 Difference]: With dead ends: 163 [2024-11-10 15:22:31,049 INFO L226 Difference]: Without dead ends: 163 [2024-11-10 15:22:31,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=150, Invalid=1658, Unknown=2, NotChecked=82, Total=1892 [2024-11-10 15:22:31,049 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 8 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:31,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1352 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 965 Invalid, 0 Unknown, 114 Unchecked, 0.5s Time] [2024-11-10 15:22:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-10 15:22:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2024-11-10 15:22:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 138 states have (on average 1.2173913043478262) internal successors, (168), 150 states have internal predecessors, (168), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:22:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2024-11-10 15:22:31,053 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 46 [2024-11-10 15:22:31,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:31,053 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2024-11-10 15:22:31,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 27 states have internal predecessors, (69), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:22:31,053 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2024-11-10 15:22:31,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 15:22:31,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:31,054 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:31,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-10 15:22:31,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-10 15:22:31,258 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:31,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 870259919, now seen corresponding path program 1 times [2024-11-10 15:22:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:31,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517696594] [2024-11-10 15:22:31,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:31,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:31,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:31,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517696594] [2024-11-10 15:22:31,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517696594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429825756] [2024-11-10 15:22:31,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:31,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:31,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:31,557 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:31,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-10 15:22:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:31,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 15:22:31,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:31,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:31,797 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:22:31,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:22:32,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2024-11-10 15:22:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:32,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:32,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429825756] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:22:32,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:22:32,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 35 [2024-11-10 15:22:32,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983486467] [2024-11-10 15:22:32,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:32,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 15:22:32,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:32,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 15:22:32,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 15:22:32,346 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand has 36 states, 33 states have (on average 2.484848484848485) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:22:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:32,997 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2024-11-10 15:22:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 15:22:32,998 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.484848484848485) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 47 [2024-11-10 15:22:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:32,999 INFO L225 Difference]: With dead ends: 211 [2024-11-10 15:22:32,999 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 15:22:33,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 15:22:33,000 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:33,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 702 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 15:22:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 15:22:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 197. [2024-11-10 15:22:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 174 states have (on average 1.2298850574712643) internal successors, (214), 185 states have internal predecessors, (214), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 15:22:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 232 transitions. [2024-11-10 15:22:33,004 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 232 transitions. Word has length 47 [2024-11-10 15:22:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:33,004 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 232 transitions. [2024-11-10 15:22:33,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.484848484848485) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:22:33,004 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 232 transitions. [2024-11-10 15:22:33,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-10 15:22:33,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:33,005 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:33,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-10 15:22:33,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 15:22:33,210 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:33,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash 870259920, now seen corresponding path program 1 times [2024-11-10 15:22:33,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:33,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238719248] [2024-11-10 15:22:33,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:33,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:33,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:33,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:22:33,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:33,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238719248] [2024-11-10 15:22:33,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238719248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:33,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:33,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:22:33,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553046246] [2024-11-10 15:22:33,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:33,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:22:33,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:33,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:22:33,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:33,353 INFO L87 Difference]: Start difference. First operand 197 states and 232 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:33,509 INFO L93 Difference]: Finished difference Result 261 states and 311 transitions. [2024-11-10 15:22:33,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:22:33,509 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 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 47 [2024-11-10 15:22:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:33,510 INFO L225 Difference]: With dead ends: 261 [2024-11-10 15:22:33,510 INFO L226 Difference]: Without dead ends: 261 [2024-11-10 15:22:33,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:33,511 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 10 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:33,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 462 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-10 15:22:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 253. [2024-11-10 15:22:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 230 states have (on average 1.2652173913043478) internal successors, (291), 241 states have internal predecessors, (291), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 15:22:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2024-11-10 15:22:33,516 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 47 [2024-11-10 15:22:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:33,516 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2024-11-10 15:22:33,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2024-11-10 15:22:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:22:33,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:33,517 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:33,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 15:22:33,517 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:33,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:33,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1135898739, now seen corresponding path program 1 times [2024-11-10 15:22:33,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:33,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252105733] [2024-11-10 15:22:33,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:33,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:33,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 15:22:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 15:22:33,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:33,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252105733] [2024-11-10 15:22:33,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252105733] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:33,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954841877] [2024-11-10 15:22:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:33,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:33,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:33,736 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:33,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-10 15:22:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:33,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-10 15:22:33,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:33,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:22:33,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:34,082 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:22:34,082 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-10 15:22:34,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:34,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:34,188 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:22:34,188 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-10 15:22:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:22:34,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:34,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954841877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:34,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:34,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 26 [2024-11-10 15:22:34,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593614999] [2024-11-10 15:22:34,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:34,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 15:22:34,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:34,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 15:22:34,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2024-11-10 15:22:34,584 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 27 states, 25 states have (on average 3.04) internal successors, (76), 21 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:22:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:35,056 INFO L93 Difference]: Finished difference Result 255 states and 301 transitions. [2024-11-10 15:22:35,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:22:35,057 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.04) internal successors, (76), 21 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2024-11-10 15:22:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:35,059 INFO L225 Difference]: With dead ends: 255 [2024-11-10 15:22:35,059 INFO L226 Difference]: Without dead ends: 255 [2024-11-10 15:22:35,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=1265, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 15:22:35,060 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 38 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:35,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 842 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:22:35,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-10 15:22:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 251. [2024-11-10 15:22:35,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 228 states have (on average 1.2236842105263157) internal successors, (279), 239 states have internal predecessors, (279), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 15:22:35,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 297 transitions. [2024-11-10 15:22:35,068 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 297 transitions. Word has length 48 [2024-11-10 15:22:35,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:35,068 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 297 transitions. [2024-11-10 15:22:35,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.04) internal successors, (76), 21 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:22:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 297 transitions. [2024-11-10 15:22:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 15:22:35,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:35,076 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:35,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-10 15:22:35,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-10 15:22:35,277 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:35,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash 51058942, now seen corresponding path program 1 times [2024-11-10 15:22:35,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:35,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643525633] [2024-11-10 15:22:35,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:35,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:35,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 15:22:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 15:22:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:22:35,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:35,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643525633] [2024-11-10 15:22:35,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643525633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:35,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793053169] [2024-11-10 15:22:35,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:35,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:35,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:35,402 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:35,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-10 15:22:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:35,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 15:22:35,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:35,631 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-10 15:22:35,668 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:22:35,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-10 15:22:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 15:22:35,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:35,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793053169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:35,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:22:35,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2024-11-10 15:22:35,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432311418] [2024-11-10 15:22:35,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:35,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:22:35,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:35,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:22:35,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2024-11-10 15:22:35,736 INFO L87 Difference]: Start difference. First operand 251 states and 297 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:22:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:35,895 INFO L93 Difference]: Finished difference Result 253 states and 297 transitions. [2024-11-10 15:22:35,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:22:35,896 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2024-11-10 15:22:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:35,897 INFO L225 Difference]: With dead ends: 253 [2024-11-10 15:22:35,897 INFO L226 Difference]: Without dead ends: 253 [2024-11-10 15:22:35,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:22:35,897 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 16 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:35,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 559 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 322 Invalid, 0 Unknown, 173 Unchecked, 0.1s Time] [2024-11-10 15:22:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-10 15:22:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 218. [2024-11-10 15:22:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 196 states have (on average 1.2091836734693877) internal successors, (237), 207 states have internal predecessors, (237), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:22:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 253 transitions. [2024-11-10 15:22:35,901 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 253 transitions. Word has length 49 [2024-11-10 15:22:35,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:35,901 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 253 transitions. [2024-11-10 15:22:35,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-10 15:22:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 253 transitions. [2024-11-10 15:22:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-10 15:22:35,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:35,902 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:35,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-10 15:22:36,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 15:22:36,106 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:36,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:36,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1198879579, now seen corresponding path program 1 times [2024-11-10 15:22:36,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:36,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033203601] [2024-11-10 15:22:36,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:36,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:36,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:22:36,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033203601] [2024-11-10 15:22:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033203601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:36,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:36,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:22:36,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932316114] [2024-11-10 15:22:36,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:36,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:22:36,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:36,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:22:36,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:36,203 INFO L87 Difference]: Start difference. First operand 218 states and 253 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:36,289 INFO L93 Difference]: Finished difference Result 227 states and 262 transitions. [2024-11-10 15:22:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:22:36,290 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 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 49 [2024-11-10 15:22:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:36,290 INFO L225 Difference]: With dead ends: 227 [2024-11-10 15:22:36,294 INFO L226 Difference]: Without dead ends: 227 [2024-11-10 15:22:36,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:36,295 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 19 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:36,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 527 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-10 15:22:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 220. [2024-11-10 15:22:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 198 states have (on average 1.1919191919191918) internal successors, (236), 209 states have internal predecessors, (236), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:22:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 252 transitions. [2024-11-10 15:22:36,300 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 252 transitions. Word has length 49 [2024-11-10 15:22:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:36,301 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 252 transitions. [2024-11-10 15:22:36,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 252 transitions. [2024-11-10 15:22:36,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:22:36,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:36,301 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:22:36,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 15:22:36,302 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:36,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:36,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1490640263, now seen corresponding path program 1 times [2024-11-10 15:22:36,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:36,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913477815] [2024-11-10 15:22:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:36,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:36,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-10 15:22:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:22:36,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:36,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913477815] [2024-11-10 15:22:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913477815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:22:36,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:22:36,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:22:36,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500947566] [2024-11-10 15:22:36,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:22:36,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:22:36,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:36,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:22:36,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:36,415 INFO L87 Difference]: Start difference. First operand 220 states and 252 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:36,526 INFO L93 Difference]: Finished difference Result 225 states and 259 transitions. [2024-11-10 15:22:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:22:36,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 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 50 [2024-11-10 15:22:36,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:36,527 INFO L225 Difference]: With dead ends: 225 [2024-11-10 15:22:36,528 INFO L226 Difference]: Without dead ends: 225 [2024-11-10 15:22:36,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:22:36,528 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 15 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:36,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 485 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:22:36,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-10 15:22:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2024-11-10 15:22:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 202 states have (on average 1.202970297029703) internal successors, (243), 213 states have internal predecessors, (243), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 15:22:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 259 transitions. [2024-11-10 15:22:36,532 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 259 transitions. Word has length 50 [2024-11-10 15:22:36,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:36,532 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 259 transitions. [2024-11-10 15:22:36,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 15:22:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 259 transitions. [2024-11-10 15:22:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 15:22:36,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:36,533 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-10 15:22:36,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 15:22:36,533 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-11-10 15:22:36,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:36,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1437484473, now seen corresponding path program 2 times [2024-11-10 15:22:36,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292485366] [2024-11-10 15:22:36,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:37,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:37,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 15:22:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:37,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 15:22:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:37,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:37,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292485366] [2024-11-10 15:22:37,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292485366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:37,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934650792] [2024-11-10 15:22:37,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:22:37,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:37,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:37,632 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:22:37,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-10 15:22:37,787 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:22:37,787 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:22:37,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-10 15:22:37,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:37,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:22:37,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:37,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:22:37,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:22:37,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-10 15:22:38,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:38,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:38,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-10 15:22:38,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-10 15:22:38,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 15:22:38,421 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (<= (select |c_#length| alloc_and_zero_internal_~pi~1.base) 8) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-11-10 15:22:38,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:38,461 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-10 15:22:38,461 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 61 treesize of output 54 [2024-11-10 15:22:38,477 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:38,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:22:38,500 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:22:38,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2024-11-10 15:22:38,926 INFO L349 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2024-11-10 15:22:38,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 74 [2024-11-10 15:22:38,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 90 [2024-11-10 15:22:39,773 INFO L349 Elim1Store]: treesize reduction 222, result has 43.8 percent of original size [2024-11-10 15:22:39,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 203 treesize of output 303 [2024-11-10 15:22:39,980 INFO L349 Elim1Store]: treesize reduction 222, result has 43.8 percent of original size [2024-11-10 15:22:39,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 147 treesize of output 264 [2024-11-10 15:22:40,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:40,011 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 99 treesize of output 117 [2024-11-10 15:22:47,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:48,819 INFO L349 Elim1Store]: treesize reduction 211, result has 77.6 percent of original size [2024-11-10 15:22:48,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 3 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 77 case distinctions, treesize of input 272 treesize of output 919 [2024-11-10 15:22:48,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:48,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:48,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:50,366 INFO L349 Elim1Store]: treesize reduction 943, result has 41.7 percent of original size [2024-11-10 15:22:50,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 10 disjoint index pairs (out of 210 index pairs), introduced 24 new quantified variables, introduced 201 case distinctions, treesize of input 690 treesize of output 1136