./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-middle-data.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-middle-data.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 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:21:23,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:21:23,945 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:23,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:21:23,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:21:23,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:21:23,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:21:23,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:21:23,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:21:23,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:21:23,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:21:23,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:21:23,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:21:23,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:21:23,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:21:23,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:21:23,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:21:23,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:21:23,992 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:21:23,993 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:21:23,993 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:21:23,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:21:23,997 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:21:23,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:21:23,997 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:21:23,998 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:21:23,998 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:21:23,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:21:23,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:21:23,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:21:23,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:21:23,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:21:24,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:21:24,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:21:24,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:21:24,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:21:24,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:21:24,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:21:24,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:21:24,012 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 -> 1f089d84611e193726b0906f7c8f41bdfbd2779029235be3e70f3cbcf8b5071e [2024-11-10 15:21:24,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:21:24,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:21:24,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:21:24,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:21:24,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:21:24,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2024-11-10 15:21:25,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:21:25,942 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:21:25,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-data.i [2024-11-10 15:21:25,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f93d67f2/7806747b2d3b43a0b4c9af741eb7bba2/FLAG41107d557 [2024-11-10 15:21:25,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f93d67f2/7806747b2d3b43a0b4c9af741eb7bba2 [2024-11-10 15:21:25,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:21:25,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:21:25,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:21:25,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:21:25,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:21:25,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:25" (1/1) ... [2024-11-10 15:21:25,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce2185b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:25, skipping insertion in model container [2024-11-10 15:21:25,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:25" (1/1) ... [2024-11-10 15:21:26,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:21:26,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:21:26,421 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:21:26,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:21:26,491 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:21:26,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26 WrapperNode [2024-11-10 15:21:26,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:21:26,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:21:26,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:21:26,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:21:26,498 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:21:26" (1/1) ... [2024-11-10 15:21:26,512 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:21:26" (1/1) ... [2024-11-10 15:21:26,532 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 73 [2024-11-10 15:21:26,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:21:26,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:21:26,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:21:26,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:21:26,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 15:21:26,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 15:21:26,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 15:21:26,564 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:21:26,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 15:21:26,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 15:21:26,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 15:21:26,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 15:21:26,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 15:21:26,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 15:21:26,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:21:26,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:21:26,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:21:26,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:21:26,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (1/1) ... [2024-11-10 15:21:26,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:21:26,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:26,617 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:21:26,619 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:21:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:21:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-10 15:21:26,658 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-10 15:21:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:21:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:21:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:21:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:21:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:21:26,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:21:26,756 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:21:26,758 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:21:27,062 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-10 15:21:27,063 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:21:27,076 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:21:27,076 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:21:27,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:27 BoogieIcfgContainer [2024-11-10 15:21:27,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:21:27,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:21:27,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:21:27,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:21:27,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:21:25" (1/3) ... [2024-11-10 15:21:27,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223f587c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:27, skipping insertion in model container [2024-11-10 15:21:27,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:26" (2/3) ... [2024-11-10 15:21:27,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223f587c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:27, skipping insertion in model container [2024-11-10 15:21:27,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:27" (3/3) ... [2024-11-10 15:21:27,090 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-middle-data.i [2024-11-10 15:21:27,104 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:21:27,104 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-11-10 15:21:27,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:21:27,154 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;@3db6bec8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:21:27,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-10 15:21:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:21:27,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:27,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:21:27,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:27,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash 106853716, now seen corresponding path program 1 times [2024-11-10 15:21:27,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:27,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024687079] [2024-11-10 15:21:27,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:27,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:27,426 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:21:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024687079] [2024-11-10 15:21:27,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024687079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:27,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:27,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:21:27,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114213336] [2024-11-10 15:21:27,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:27,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:21:27,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:27,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:21:27,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:21:27,458 INFO L87 Difference]: Start difference. First operand has 76 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:21:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:27,528 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-11-10 15:21:27,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:21:27,531 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:21:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:27,538 INFO L225 Difference]: With dead ends: 75 [2024-11-10 15:21:27,538 INFO L226 Difference]: Without dead ends: 72 [2024-11-10 15:21:27,540 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:21:27,543 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:27,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 121 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:21:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-10 15:21:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-10 15:21:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 68 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-11-10 15:21:27,575 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 5 [2024-11-10 15:21:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:27,576 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-11-10 15:21:27,576 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:21:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-10 15:21:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:21:27,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:27,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:21:27,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:21:27,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:27,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:27,578 INFO L85 PathProgramCache]: Analyzing trace with hash 106853717, now seen corresponding path program 1 times [2024-11-10 15:21:27,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:27,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236600] [2024-11-10 15:21:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:27,740 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:21:27,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:27,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236600] [2024-11-10 15:21:27,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:27,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:27,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:21:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816065479] [2024-11-10 15:21:27,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:27,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:21:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:21:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:21:27,747 INFO L87 Difference]: Start difference. First operand 72 states and 75 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:21:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:27,802 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-11-10 15:21:27,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:21:27,803 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:21:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:27,805 INFO L225 Difference]: With dead ends: 71 [2024-11-10 15:21:27,805 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 15:21:27,806 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:21:27,807 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:27,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:21:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 15:21:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-10 15:21:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-11-10 15:21:27,821 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 5 [2024-11-10 15:21:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:27,822 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-11-10 15:21:27,823 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:21:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-11-10 15:21:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:21:27,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:27,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:27,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:21:27,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:27,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2030599389, now seen corresponding path program 1 times [2024-11-10 15:21:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:27,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569733968] [2024-11-10 15:21:27,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:27,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:27,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:28,039 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:21:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569733968] [2024-11-10 15:21:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569733968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:28,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:21:28,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117754924] [2024-11-10 15:21:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:28,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:21:28,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:21:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:21:28,043 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:28,220 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2024-11-10 15:21:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:21:28,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-10 15:21:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:28,223 INFO L225 Difference]: With dead ends: 71 [2024-11-10 15:21:28,223 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 15:21:28,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:21:28,224 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:28,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 211 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 15:21:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2024-11-10 15:21:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-11-10 15:21:28,233 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 10 [2024-11-10 15:21:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:28,233 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-11-10 15:21:28,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-11-10 15:21:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:21:28,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:28,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:28,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:21:28,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:28,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2030599390, now seen corresponding path program 1 times [2024-11-10 15:21:28,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:28,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042267890] [2024-11-10 15:21:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:28,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:28,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:28,500 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:21:28,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:28,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042267890] [2024-11-10 15:21:28,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042267890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:28,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:28,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:21:28,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913294713] [2024-11-10 15:21:28,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:28,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:21:28,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:28,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:21:28,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:21:28,503 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:28,638 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-10 15:21:28,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:21:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-10 15:21:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:28,640 INFO L225 Difference]: With dead ends: 70 [2024-11-10 15:21:28,640 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 15:21:28,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:21:28,641 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:28,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 250 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 15:21:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2024-11-10 15:21:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-11-10 15:21:28,649 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 10 [2024-11-10 15:21:28,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:28,649 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-11-10 15:21:28,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-11-10 15:21:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:21:28,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:28,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:28,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:21:28,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:28,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1490861883, now seen corresponding path program 1 times [2024-11-10 15:21:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:28,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760155732] [2024-11-10 15:21:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:28,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:28,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:28,922 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:21:28,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:28,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760155732] [2024-11-10 15:21:28,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760155732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:28,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:28,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:21:28,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902224346] [2024-11-10 15:21:28,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:28,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:21:28,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:28,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:21:28,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:21:28,925 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:29,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:29,050 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2024-11-10 15:21:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:21:29,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-10 15:21:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:29,052 INFO L225 Difference]: With dead ends: 69 [2024-11-10 15:21:29,052 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 15:21:29,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:21:29,053 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 6 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:29,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 250 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 15:21:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2024-11-10 15:21:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 60 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-11-10 15:21:29,065 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 12 [2024-11-10 15:21:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:29,065 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-11-10 15:21:29,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-11-10 15:21:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:21:29,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:29,066 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:29,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:21:29,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:29,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:29,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1300191047, now seen corresponding path program 1 times [2024-11-10 15:21:29,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:29,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123935847] [2024-11-10 15:21:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:29,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:29,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:29,248 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:21:29,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123935847] [2024-11-10 15:21:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123935847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:29,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:21:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330414364] [2024-11-10 15:21:29,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:29,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:21:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:21:29,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:29,251 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:29,408 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2024-11-10 15:21:29,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:21:29,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-10 15:21:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:29,409 INFO L225 Difference]: With dead ends: 73 [2024-11-10 15:21:29,409 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 15:21:29,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:29,410 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:29,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 15:21:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-10 15:21:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 68 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-10 15:21:29,416 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 21 [2024-11-10 15:21:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:29,416 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-10 15:21:29,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-10 15:21:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:21:29,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:29,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:29,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:21:29,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:29,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:29,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1300191048, now seen corresponding path program 1 times [2024-11-10 15:21:29,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:29,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142411859] [2024-11-10 15:21:29,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:29,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:29,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:29,637 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:21:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:29,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142411859] [2024-11-10 15:21:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142411859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:29,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:29,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:21:29,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176054652] [2024-11-10 15:21:29,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:29,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:21:29,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:29,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:21:29,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:29,640 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:29,804 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2024-11-10 15:21:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:21:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-10 15:21:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:29,805 INFO L225 Difference]: With dead ends: 73 [2024-11-10 15:21:29,806 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 15:21:29,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:29,807 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:29,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 301 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 15:21:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-10 15:21:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-10 15:21:29,818 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 21 [2024-11-10 15:21:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:29,818 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-10 15:21:29,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-10 15:21:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:21:29,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:29,821 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:29,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:21:29,822 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:29,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1865616052, now seen corresponding path program 1 times [2024-11-10 15:21:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557593803] [2024-11-10 15:21:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:29,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:29,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:30,068 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:21:30,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557593803] [2024-11-10 15:21:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557593803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:30,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140121314] [2024-11-10 15:21:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:30,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:30,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:30,071 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:21:30,073 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:21:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:30,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 15:21:30,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:30,261 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:21:30,344 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:21:30,345 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:21:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:30,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:21:30,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140121314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:30,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:21:30,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-10 15:21:30,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085668193] [2024-11-10 15:21:30,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:30,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:21:30,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:30,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:21:30,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-10 15:21:30,354 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:21:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:30,410 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2024-11-10 15:21:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:21:30,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 22 [2024-11-10 15:21:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:30,411 INFO L225 Difference]: With dead ends: 74 [2024-11-10 15:21:30,411 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 15:21:30,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-10 15:21:30,414 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:30,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 109 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 85 Unchecked, 0.1s Time] [2024-11-10 15:21:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 15:21:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-10 15:21:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 69 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2024-11-10 15:21:30,420 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 22 [2024-11-10 15:21:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:30,424 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2024-11-10 15:21:30,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:21:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-11-10 15:21:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:21:30,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:30,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:30,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 15:21:30,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:30,629 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:30,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1865616053, now seen corresponding path program 1 times [2024-11-10 15:21:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:30,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337319633] [2024-11-10 15:21:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:30,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:30,962 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:21:30,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:30,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337319633] [2024-11-10 15:21:30,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337319633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:30,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956113760] [2024-11-10 15:21:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:30,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:30,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:30,965 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:21:30,966 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:21:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 15:21:31,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:31,149 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:21:31,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:21:31,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:21:31,193 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:31,194 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:21:31,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:31,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:21:31,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956113760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:31,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:21:31,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-11-10 15:21:31,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35198491] [2024-11-10 15:21:31,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:31,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:21:31,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:31,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:21:31,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:21:31,221 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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:21:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:31,331 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2024-11-10 15:21:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:21:31,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 22 [2024-11-10 15:21:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:31,332 INFO L225 Difference]: With dead ends: 88 [2024-11-10 15:21:31,332 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 15:21:31,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:21:31,333 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:31,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 179 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 108 Unchecked, 0.1s Time] [2024-11-10 15:21:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 15:21:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-11-10 15:21:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 79 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2024-11-10 15:21:31,344 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 22 [2024-11-10 15:21:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:31,344 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2024-11-10 15:21:31,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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:21:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2024-11-10 15:21:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:21:31,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:31,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:31,362 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:21:31,546 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,SelfDestructingSolverStorable8 [2024-11-10 15:21:31,546 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:31,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:31,547 INFO L85 PathProgramCache]: Analyzing trace with hash -353887006, now seen corresponding path program 1 times [2024-11-10 15:21:31,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:31,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124511489] [2024-11-10 15:21:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:31,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,665 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:21:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124511489] [2024-11-10 15:21:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124511489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:31,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:21:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138179927] [2024-11-10 15:21:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:31,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:21:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:21:31,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:31,667 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:31,759 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2024-11-10 15:21:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:21:31,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-10 15:21:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:31,760 INFO L225 Difference]: With dead ends: 88 [2024-11-10 15:21:31,761 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 15:21:31,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:31,761 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 24 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:31,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 403 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 15:21:31,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-11-10 15:21:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-11-10 15:21:31,771 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 23 [2024-11-10 15:21:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:31,771 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-11-10 15:21:31,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-10 15:21:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:21:31,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:31,773 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] [2024-11-10 15:21:31,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:21:31,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:31,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash 882216174, now seen corresponding path program 1 times [2024-11-10 15:21:31,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:31,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77360660] [2024-11-10 15:21:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:31,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:31,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:31,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77360660] [2024-11-10 15:21:31,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77360660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:31,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:31,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:21:31,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130331543] [2024-11-10 15:21:31,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:31,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:31,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:31,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:31,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:31,932 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:21:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:32,078 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-11-10 15:21:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:21:32,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 26 [2024-11-10 15:21:32,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:32,079 INFO L225 Difference]: With dead ends: 85 [2024-11-10 15:21:32,079 INFO L226 Difference]: Without dead ends: 85 [2024-11-10 15:21:32,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:32,080 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:32,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 268 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-10 15:21:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-10 15:21:32,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 80 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2024-11-10 15:21:32,084 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 26 [2024-11-10 15:21:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:32,085 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2024-11-10 15:21:32,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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:21:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2024-11-10 15:21:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:21:32,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:32,086 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] [2024-11-10 15:21:32,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:21:32,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:32,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:32,086 INFO L85 PathProgramCache]: Analyzing trace with hash 882216175, now seen corresponding path program 1 times [2024-11-10 15:21:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:32,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811926707] [2024-11-10 15:21:32,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:32,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811926707] [2024-11-10 15:21:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811926707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:32,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:32,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:21:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843244940] [2024-11-10 15:21:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:32,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:32,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:32,338 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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:21:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:32,463 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2024-11-10 15:21:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:21:32,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 26 [2024-11-10 15:21:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:32,464 INFO L225 Difference]: With dead ends: 84 [2024-11-10 15:21:32,465 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 15:21:32,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:32,466 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:32,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 287 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 15:21:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-10 15:21:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 79 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2024-11-10 15:21:32,473 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 26 [2024-11-10 15:21:32,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:32,474 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2024-11-10 15:21:32,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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:21:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-10 15:21:32,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 15:21:32,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:32,474 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] [2024-11-10 15:21:32,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:21:32,475 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:32,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash 948843379, now seen corresponding path program 1 times [2024-11-10 15:21:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189413490] [2024-11-10 15:21:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:32,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:33,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:33,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189413490] [2024-11-10 15:21:33,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189413490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:33,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004681830] [2024-11-10 15:21:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:33,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:33,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:33,003 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:21:33,005 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:21:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:33,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-10 15:21:33,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:33,116 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:21:33,123 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:21:33,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:21:33,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:21:33,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:21:33,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:21:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:33,327 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:33,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004681830] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:33,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:33,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 21 [2024-11-10 15:21:33,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249619967] [2024-11-10 15:21:33,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:33,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 15:21:33,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:33,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 15:21:33,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:21:33,723 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 2 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:21:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:33,980 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2024-11-10 15:21:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:21:33,981 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 2 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 26 [2024-11-10 15:21:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:33,981 INFO L225 Difference]: With dead ends: 87 [2024-11-10 15:21:33,981 INFO L226 Difference]: Without dead ends: 87 [2024-11-10 15:21:33,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:21:33,982 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 8 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:33,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 652 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-10 15:21:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-10 15:21:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2024-11-10 15:21:33,986 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 26 [2024-11-10 15:21:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:33,987 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2024-11-10 15:21:33,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (2), 2 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:21:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-11-10 15:21:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:21:33,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:33,988 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] [2024-11-10 15:21:34,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 15:21:34,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:34,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:34,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1303420430, now seen corresponding path program 1 times [2024-11-10 15:21:34,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:34,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040122263] [2024-11-10 15:21:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:34,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:34,339 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:21:34,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:34,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040122263] [2024-11-10 15:21:34,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040122263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:34,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:34,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:21:34,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838240472] [2024-11-10 15:21:34,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:34,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:21:34,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:34,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:21:34,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:34,342 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:34,524 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-10 15:21:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:34,525 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-10 15:21:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:34,525 INFO L225 Difference]: With dead ends: 90 [2024-11-10 15:21:34,525 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 15:21:34,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:34,526 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:34,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 272 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:34,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 15:21:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 15:21:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 85 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-11-10 15:21:34,530 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 28 [2024-11-10 15:21:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:34,531 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-11-10 15:21:34,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-11-10 15:21:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 15:21:34,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:34,532 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] [2024-11-10 15:21:34,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:21:34,532 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:34,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1303420431, now seen corresponding path program 1 times [2024-11-10 15:21:34,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:34,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795077873] [2024-11-10 15:21:34,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:34,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:34,736 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:21:34,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:34,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795077873] [2024-11-10 15:21:34,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795077873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:34,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:34,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:21:34,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572977377] [2024-11-10 15:21:34,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:34,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:21:34,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:34,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:21:34,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:34,739 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:34,913 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-11-10 15:21:34,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:34,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-10 15:21:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:34,915 INFO L225 Difference]: With dead ends: 92 [2024-11-10 15:21:34,915 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 15:21:34,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:34,915 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:34,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 298 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 15:21:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-10 15:21:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2024-11-10 15:21:34,920 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 28 [2024-11-10 15:21:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:34,920 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2024-11-10 15:21:34,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2024-11-10 15:21:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:21:34,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:34,921 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:21:34,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:21:34,924 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:34,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:34,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1542152152, now seen corresponding path program 1 times [2024-11-10 15:21:34,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:34,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340166604] [2024-11-10 15:21:34,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:34,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:35,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:35,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340166604] [2024-11-10 15:21:35,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340166604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:35,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:35,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 15:21:35,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985159365] [2024-11-10 15:21:35,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:35,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 15:21:35,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 15:21:35,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:21:35,314 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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:21:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:35,548 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-11-10 15:21:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:21:35,549 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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 30 [2024-11-10 15:21:35,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:35,550 INFO L225 Difference]: With dead ends: 93 [2024-11-10 15:21:35,550 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 15:21:35,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:21:35,550 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:35,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 405 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:35,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 15:21:35,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-10 15:21:35,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 87 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2024-11-10 15:21:35,554 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 30 [2024-11-10 15:21:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:35,555 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2024-11-10 15:21:35,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 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:21:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-10 15:21:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:21:35,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:35,556 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:21:35,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:21:35,556 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:35,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1542152151, now seen corresponding path program 1 times [2024-11-10 15:21:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:35,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834447465] [2024-11-10 15:21:35,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:35,995 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:21:35,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:35,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834447465] [2024-11-10 15:21:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834447465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:35,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985393404] [2024-11-10 15:21:35,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:35,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:35,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:35,997 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:21:35,998 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:21:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 15:21:36,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:36,143 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:21:36,218 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:36,219 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:21:36,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:21:36,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:21:36,363 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:36,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:21:36,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:21:36,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:21:36,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:21:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:36,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:21:36,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985393404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:36,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:21:36,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2024-11-10 15:21:36,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887161387] [2024-11-10 15:21:36,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:36,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:21:36,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:36,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:21:36,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:21:36,437 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:21:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:36,654 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-11-10 15:21:36,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:36,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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 30 [2024-11-10 15:21:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:36,655 INFO L225 Difference]: With dead ends: 92 [2024-11-10 15:21:36,655 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 15:21:36,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2024-11-10 15:21:36,656 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:36,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 298 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 15:21:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-10 15:21:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2024-11-10 15:21:36,661 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 30 [2024-11-10 15:21:36,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:36,661 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2024-11-10 15:21:36,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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:21:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2024-11-10 15:21:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-10 15:21:36,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:36,662 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] [2024-11-10 15:21:36,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 15:21:36,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 15:21:36,863 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:36,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:36,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1543456316, now seen corresponding path program 1 times [2024-11-10 15:21:36,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:36,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733110008] [2024-11-10 15:21:36,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:36,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:36,980 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:21:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:36,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733110008] [2024-11-10 15:21:36,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733110008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:36,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:36,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:21:36,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625134474] [2024-11-10 15:21:36,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:36,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:21:36,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:21:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:36,982 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:37,087 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2024-11-10 15:21:37,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:37,088 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-10 15:21:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:37,088 INFO L225 Difference]: With dead ends: 101 [2024-11-10 15:21:37,088 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 15:21:37,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:37,089 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:37,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 397 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 15:21:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2024-11-10 15:21:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 89 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-10 15:21:37,092 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 30 [2024-11-10 15:21:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:37,093 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-10 15:21:37,093 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-10 15:21:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:21:37,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:37,093 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] [2024-11-10 15:21:37,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:21:37,094 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:37,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash -601303995, now seen corresponding path program 1 times [2024-11-10 15:21:37,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:37,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097596280] [2024-11-10 15:21:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:37,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:37,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:37,230 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:21:37,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:37,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097596280] [2024-11-10 15:21:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097596280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:21:37,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:21:37,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 15:21:37,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785461225] [2024-11-10 15:21:37,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:21:37,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 15:21:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:37,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 15:21:37,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:37,232 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:37,346 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2024-11-10 15:21:37,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:21:37,347 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-10 15:21:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:37,347 INFO L225 Difference]: With dead ends: 99 [2024-11-10 15:21:37,347 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 15:21:37,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:21:37,348 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 25 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:37,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 371 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 15:21:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-10 15:21:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 80 states have (on average 1.25) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-11-10 15:21:37,351 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 31 [2024-11-10 15:21:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:37,351 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-11-10 15:21:37,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:21:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-11-10 15:21:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 15:21:37,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:37,352 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] [2024-11-10 15:21:37,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:21:37,352 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:37,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1258144493, now seen corresponding path program 1 times [2024-11-10 15:21:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:37,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111053511] [2024-11-10 15:21:37,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:37,995 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:21:37,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:37,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111053511] [2024-11-10 15:21:37,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111053511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:37,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448467215] [2024-11-10 15:21:37,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:37,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:37,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:37,997 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:21:37,999 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:21:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:38,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-10 15:21:38,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:38,136 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:21:38,140 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:21:38,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:21:38,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:21:38,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:21:38,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-10 15:21:38,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:38,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-10 15:21:38,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:38,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-10 15:21:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:38,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:39,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-10 15:21:39,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 434 [2024-11-10 15:21:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:21:39,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448467215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:39,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:39,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 16] total 34 [2024-11-10 15:21:39,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985360146] [2024-11-10 15:21:39,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:39,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-10 15:21:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:39,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 15:21:39,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1036, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 15:21:39,099 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:21:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:39,707 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2024-11-10 15:21:39,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:21:39,708 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-10 15:21:39,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:39,709 INFO L225 Difference]: With dead ends: 103 [2024-11-10 15:21:39,709 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 15:21:39,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=134, Invalid=1588, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 15:21:39,711 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 24 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:39,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 831 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:21:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 15:21:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-10 15:21:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 98 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2024-11-10 15:21:39,714 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 36 [2024-11-10 15:21:39,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:39,714 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2024-11-10 15:21:39,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:21:39,715 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2024-11-10 15:21:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:21:39,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:39,715 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] [2024-11-10 15:21:39,735 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:21:39,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:39,920 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:39,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2103880585, now seen corresponding path program 1 times [2024-11-10 15:21:39,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:39,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087910399] [2024-11-10 15:21:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:40,097 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:21:40,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:40,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087910399] [2024-11-10 15:21:40,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087910399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:40,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229569209] [2024-11-10 15:21:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:40,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:40,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:40,100 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:21:40,101 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:21:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:40,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 15:21:40,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:40,281 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 13 treesize of output 9 [2024-11-10 15:21:40,319 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:21:40,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:40,388 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18|) 0)) (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_18| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2024-11-10 15:21:40,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229569209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:40,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:40,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2024-11-10 15:21:40,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266478234] [2024-11-10 15:21:40,390 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:40,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 15:21:40,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:40,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 15:21:40,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:21:40,391 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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:21:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:40,568 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2024-11-10 15:21:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:21:40,569 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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 38 [2024-11-10 15:21:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:40,569 INFO L225 Difference]: With dead ends: 106 [2024-11-10 15:21:40,569 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 15:21:40,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=132, Unknown=1, NotChecked=22, Total=182 [2024-11-10 15:21:40,570 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:40,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 336 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 15:21:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-10 15:21:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 78 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2024-11-10 15:21:40,575 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 38 [2024-11-10 15:21:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:40,575 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2024-11-10 15:21:40,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 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:21:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-11-10 15:21:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:21:40,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:40,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:40,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 15:21:40,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:40,780 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:40,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:40,781 INFO L85 PathProgramCache]: Analyzing trace with hash 933241759, now seen corresponding path program 1 times [2024-11-10 15:21:40,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:40,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115762465] [2024-11-10 15:21:40,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:40,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:40,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:40,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 15:21:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:40,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115762465] [2024-11-10 15:21:40,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115762465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:40,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414329936] [2024-11-10 15:21:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:40,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:40,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:40,913 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:21:40,914 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:21:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:41,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 15:21:41,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 15:21:41,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:41,125 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:21:41,125 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 12 treesize of output 11 [2024-11-10 15:21:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 15:21:41,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414329936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:41,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:41,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2024-11-10 15:21:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936860576] [2024-11-10 15:21:41,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:41,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:21:41,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:41,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:21:41,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:41,146 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:41,250 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2024-11-10 15:21:41,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:21:41,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-10 15:21:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:41,251 INFO L225 Difference]: With dead ends: 93 [2024-11-10 15:21:41,251 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 15:21:41,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:21:41,252 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:41,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 229 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 15:21:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-10 15:21:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 87 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-11-10 15:21:41,255 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 41 [2024-11-10 15:21:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:41,255 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-11-10 15:21:41,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-11-10 15:21:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:21:41,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:41,256 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:41,275 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:21:41,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:41,457 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:41,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash 933241760, now seen corresponding path program 1 times [2024-11-10 15:21:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:41,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859215215] [2024-11-10 15:21:41,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:41,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:41,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:41,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:41,695 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:21:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859215215] [2024-11-10 15:21:41,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859215215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:41,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704906071] [2024-11-10 15:21:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:41,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:41,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:41,698 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:21:41,699 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:21:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:41,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 15:21:41,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:42,036 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:21:42,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:42,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:42,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-10 15:21:42,340 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:21:42,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704906071] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:42,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:42,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-11-10 15:21:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7347726] [2024-11-10 15:21:42,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:42,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 15:21:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 15:21:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2024-11-10 15:21:42,342 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 21 states have internal predecessors, (100), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:21:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:42,521 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2024-11-10 15:21:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:21:42,521 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 21 states have internal predecessors, (100), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2024-11-10 15:21:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:42,522 INFO L225 Difference]: With dead ends: 93 [2024-11-10 15:21:42,522 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 15:21:42,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2024-11-10 15:21:42,523 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:42,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 585 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 15:21:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-10 15:21:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2024-11-10 15:21:42,526 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 41 [2024-11-10 15:21:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:42,527 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2024-11-10 15:21:42,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.166666666666667) internal successors, (100), 21 states have internal predecessors, (100), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:21:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2024-11-10 15:21:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:21:42,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:42,527 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:21:42,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:21:42,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-10 15:21:42,728 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:42,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash -919877284, now seen corresponding path program 1 times [2024-11-10 15:21:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:42,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699561785] [2024-11-10 15:21:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:42,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:43,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:43,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 15:21:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:21:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699561785] [2024-11-10 15:21:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699561785] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022650775] [2024-11-10 15:21:43,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:43,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:43,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:43,250 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:21:43,252 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:21:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:43,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 15:21:43,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:43,461 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:43,461 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:21:43,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:21:43,540 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:43,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:21:43,589 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:43,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:21:43,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:21:43,611 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:21:43,628 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:21:43,628 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:21:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-10 15:21:43,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:43,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1187 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_1187) |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) 1)) is different from false [2024-11-10 15:21:43,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1187 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_1187) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 15:21:43,775 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-10 15:21:43,776 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 33 treesize of output 32 [2024-11-10 15:21:43,826 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1186))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_1187)) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false [2024-11-10 15:21:43,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:43,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2024-11-10 15:21:43,840 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 162 treesize of output 126 [2024-11-10 15:21:43,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-11-10 15:21:43,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:21:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:43,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022650775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:43,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:43,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 14] total 31 [2024-11-10 15:21:43,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478522278] [2024-11-10 15:21:43,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:43,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 15:21:43,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:43,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 15:21:43,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=16, NotChecked=220, Total=992 [2024-11-10 15:21:43,934 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 26 states have internal predecessors, (78), 3 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 15:21:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:44,317 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2024-11-10 15:21:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:21:44,318 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 26 states have internal predecessors, (78), 3 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 42 [2024-11-10 15:21:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:44,319 INFO L225 Difference]: With dead ends: 90 [2024-11-10 15:21:44,319 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 15:21:44,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=16, NotChecked=268, Total=1406 [2024-11-10 15:21:44,320 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 27 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:44,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 620 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 424 Invalid, 0 Unknown, 173 Unchecked, 0.2s Time] [2024-11-10 15:21:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 15:21:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 15:21:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2024-11-10 15:21:44,323 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 42 [2024-11-10 15:21:44,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:44,323 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2024-11-10 15:21:44,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 26 states have internal predecessors, (78), 3 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-10 15:21:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2024-11-10 15:21:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:21:44,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:44,325 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:21:44,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-10 15:21:44,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 15:21:44,530 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:44,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:44,530 INFO L85 PathProgramCache]: Analyzing trace with hash -919877283, now seen corresponding path program 1 times [2024-11-10 15:21:44,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:44,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391446374] [2024-11-10 15:21:44,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:44,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:45,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:45,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:45,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 15:21:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:21:45,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:45,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391446374] [2024-11-10 15:21:45,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391446374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:45,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072107000] [2024-11-10 15:21:45,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:45,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:45,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:45,332 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:21:45,336 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:21:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:45,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-10 15:21:45,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:45,527 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:21:45,576 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:45,576 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:21:45,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:21:45,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:21:45,709 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:45,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:21:45,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:21:45,788 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:45,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:21:45,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:21:45,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:21:45,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:21:45,886 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#length| (store |c_old(#length)| alloc_and_zero_~pi~0.base 16))) is different from true [2024-11-10 15:21:45,902 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:21:45,902 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:21:45,921 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-10 15:21:45,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:46,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072107000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:46,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:46,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 28 [2024-11-10 15:21:46,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880591236] [2024-11-10 15:21:46,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:46,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 15:21:46,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:46,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 15:21:46,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=787, Unknown=1, NotChecked=56, Total=930 [2024-11-10 15:21:46,020 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 23 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:21:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:46,595 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-11-10 15:21:46,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:21:46,596 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 23 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2024-11-10 15:21:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:46,597 INFO L225 Difference]: With dead ends: 86 [2024-11-10 15:21:46,597 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 15:21:46,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=1314, Unknown=1, NotChecked=74, Total=1560 [2024-11-10 15:21:46,598 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 38 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:46,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 866 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 673 Invalid, 0 Unknown, 69 Unchecked, 0.3s Time] [2024-11-10 15:21:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 15:21:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 15:21:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-11-10 15:21:46,601 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 42 [2024-11-10 15:21:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:46,601 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-11-10 15:21:46,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 23 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-10 15:21:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-11-10 15:21:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:21:46,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:46,602 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:21:46,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-10 15:21:46,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-10 15:21:46,802 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:46,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1429691931, now seen corresponding path program 1 times [2024-11-10 15:21:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:46,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165638646] [2024-11-10 15:21:46,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:46,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:47,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:47,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:47,535 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:21:47,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:47,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165638646] [2024-11-10 15:21:47,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165638646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:47,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899844065] [2024-11-10 15:21:47,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:47,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:47,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:47,538 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:21:47,539 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:21:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:47,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-10 15:21:47,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:47,824 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:47,824 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:21:47,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:21:47,927 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:47,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-10 15:21:47,967 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:47,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:21:48,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:21:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:48,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:48,159 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 15:21:48,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 15:21:48,209 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1444) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))))) is different from false [2024-11-10 15:21:48,216 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1443))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= (select (select (store .cse0 .cse1 v_ArrVal_1444) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) .cse1)))) is different from false [2024-11-10 15:21:48,226 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1444 (Array Int Int)) (v_ArrVal_1443 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_1443))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1444) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) .cse1))))) is different from false [2024-11-10 15:21:48,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:48,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2024-11-10 15:21:48,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:48,244 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 272 treesize of output 217 [2024-11-10 15:21:48,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:48,260 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 132 treesize of output 104 [2024-11-10 15:21:48,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2024-11-10 15:21:48,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899844065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:48,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:48,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 31 [2024-11-10 15:21:48,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777022393] [2024-11-10 15:21:48,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:48,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 15:21:48,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 15:21:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1210, Unknown=14, NotChecked=216, Total=1560 [2024-11-10 15:21:48,469 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 27 states have internal predecessors, (77), 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:21:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:48,862 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2024-11-10 15:21:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:21:48,862 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 27 states have internal predecessors, (77), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-11-10 15:21:48,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:48,863 INFO L225 Difference]: With dead ends: 92 [2024-11-10 15:21:48,863 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 15:21:48,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1783, Unknown=15, NotChecked=264, Total=2256 [2024-11-10 15:21:48,864 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:48,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 608 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:21:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 15:21:48,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-10 15:21:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2024-11-10 15:21:48,867 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 46 [2024-11-10 15:21:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:48,867 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2024-11-10 15:21:48,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 27 states have internal predecessors, (77), 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:21:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2024-11-10 15:21:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:21:48,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:48,868 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:21:48,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-10 15:21:49,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 15:21:49,069 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:49,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:49,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1429691932, now seen corresponding path program 1 times [2024-11-10 15:21:49,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:49,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725514920] [2024-11-10 15:21:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:49,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:49,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:49,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:49,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:49,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725514920] [2024-11-10 15:21:49,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725514920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:49,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19012047] [2024-11-10 15:21:49,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:49,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:49,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:49,891 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:21:49,892 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:21:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:50,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-10 15:21:50,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:50,168 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:21:50,240 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:50,241 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:21:50,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:21:50,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:21:50,406 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:50,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:21:50,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:21:50,471 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:50,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:21:50,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:21:50,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:21:50,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:21:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:21:50,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:50,925 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1560 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1560) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1560) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1559) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))) is different from false [2024-11-10 15:21:50,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (and (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1557) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1558) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_1560) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1558))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1557) .cse2 v_ArrVal_1560) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1559) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))))) is different from false [2024-11-10 15:21:50,962 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse4)) (.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4))) (and (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1558))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1557) .cse1 v_ArrVal_1560) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1559) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1557) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1558) |c_ULTIMATE.start_create_~now~0#1.base|) .cse4) v_ArrVal_1560) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 4)))))) is different from false [2024-11-10 15:21:50,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:50,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-10 15:21:50,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:50,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-10 15:21:51,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:51,000 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 754 treesize of output 651 [2024-11-10 15:21:51,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:51,029 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 1369 treesize of output 1278 [2024-11-10 15:21:51,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 655 treesize of output 607 [2024-11-10 15:21:51,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 607 treesize of output 559 [2024-11-10 15:21:51,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 559 treesize of output 543 [2024-11-10 15:21:51,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:51,098 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 543 treesize of output 447 [2024-11-10 15:21:51,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:51,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-11-10 15:21:51,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:51,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-10 15:21:51,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:21:51,381 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 34 treesize of output 22 [2024-11-10 15:21:51,384 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:21:51,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:21:51,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 15:21:51,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19012047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:51,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:51,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 [2024-11-10 15:21:51,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428656985] [2024-11-10 15:21:51,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:51,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-10 15:21:51,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:51,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 15:21:51,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1571, Unknown=16, NotChecked=246, Total=1980 [2024-11-10 15:21:51,504 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:21:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:52,085 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2024-11-10 15:21:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:21:52,086 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-11-10 15:21:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:52,086 INFO L225 Difference]: With dead ends: 92 [2024-11-10 15:21:52,087 INFO L226 Difference]: Without dead ends: 92 [2024-11-10 15:21:52,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=221, Invalid=2224, Unknown=17, NotChecked=294, Total=2756 [2024-11-10 15:21:52,088 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:52,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 802 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:21:52,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-10 15:21:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-10 15:21:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 86 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2024-11-10 15:21:52,091 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 46 [2024-11-10 15:21:52,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:52,091 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2024-11-10 15:21:52,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.484848484848485) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 15:21:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2024-11-10 15:21:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:21:52,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:52,092 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:21:52,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-10 15:21:52,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-10 15:21:52,297 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:52,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:52,297 INFO L85 PathProgramCache]: Analyzing trace with hash -457589066, now seen corresponding path program 1 times [2024-11-10 15:21:52,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:52,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905700147] [2024-11-10 15:21:52,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:52,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:52,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:52,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:52,408 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:21:52,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:52,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905700147] [2024-11-10 15:21:52,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905700147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:52,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398020121] [2024-11-10 15:21:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:52,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:52,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:52,411 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:21:52,412 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:21:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:52,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 15:21:52,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:52,607 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:21:52,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:52,643 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:21:52,643 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 12 treesize of output 11 [2024-11-10 15:21:52,658 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:21:52,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398020121] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:21:52,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:21:52,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2024-11-10 15:21:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822747331] [2024-11-10 15:21:52,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:52,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:21:52,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:21:52,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:52,660 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:52,746 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2024-11-10 15:21:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:21:52,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2024-11-10 15:21:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:52,747 INFO L225 Difference]: With dead ends: 103 [2024-11-10 15:21:52,747 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 15:21:52,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:21:52,747 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 18 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:52,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 216 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:21:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 15:21:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2024-11-10 15:21:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 95 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2024-11-10 15:21:52,751 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 48 [2024-11-10 15:21:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:52,751 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2024-11-10 15:21:52,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:21:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2024-11-10 15:21:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-10 15:21:52,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:52,752 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:21:52,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-10 15:21:52,952 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,SelfDestructingSolverStorable27 [2024-11-10 15:21:52,952 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:52,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash -457589065, now seen corresponding path program 1 times [2024-11-10 15:21:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:52,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133976073] [2024-11-10 15:21:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:52,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:53,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:53,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:21:53,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:53,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133976073] [2024-11-10 15:21:53,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133976073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:53,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466691220] [2024-11-10 15:21:53,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:53,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:53,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:53,149 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:21:53,151 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:21:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:53,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 15:21:53,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:53,360 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:21:53,463 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#length| (store |c_old(#length)| alloc_and_zero_~pi~0.base 16))) is different from true [2024-11-10 15:21:53,479 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:21:53,479 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:21:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2024-11-10 15:21:53,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466691220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:53,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 15:21:53,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2024-11-10 15:21:53,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371006246] [2024-11-10 15:21:53,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 15:21:53,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 15:21:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:21:53,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 15:21:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=589, Unknown=1, NotChecked=48, Total=702 [2024-11-10 15:21:53,913 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 21 states, 20 states have (on average 4.2) internal successors, (84), 17 states have internal predecessors, (84), 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:21:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:21:54,226 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2024-11-10 15:21:54,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:21:54,227 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.2) internal successors, (84), 17 states have internal predecessors, (84), 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 48 [2024-11-10 15:21:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:21:54,227 INFO L225 Difference]: With dead ends: 103 [2024-11-10 15:21:54,228 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 15:21:54,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=1077, Unknown=1, NotChecked=66, Total=1260 [2024-11-10 15:21:54,229 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 21 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:21:54,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 554 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 501 Invalid, 0 Unknown, 65 Unchecked, 0.2s Time] [2024-11-10 15:21:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 15:21:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-10 15:21:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 97 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:21:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2024-11-10 15:21:54,232 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 48 [2024-11-10 15:21:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:21:54,232 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2024-11-10 15:21:54,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.2) internal successors, (84), 17 states have internal predecessors, (84), 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:21:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2024-11-10 15:21:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-10 15:21:54,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:21:54,233 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:21:54,252 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:21:54,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:54,434 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:21:54,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:21:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1655163183, now seen corresponding path program 1 times [2024-11-10 15:21:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:21:54,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326275683] [2024-11-10 15:21:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:21:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:54,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:21:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:55,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:21:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:55,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 15:21:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 15:21:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:21:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326275683] [2024-11-10 15:21:55,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326275683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:21:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522846812] [2024-11-10 15:21:55,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:21:55,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:21:55,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:21:55,145 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:21:55,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 15:21:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:21:55,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-10 15:21:55,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:21:55,520 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:55,520 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:21:55,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:21:55,557 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 19 treesize of output 1 [2024-11-10 15:21:55,589 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 19 treesize of output 7 [2024-11-10 15:21:55,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:21:55,630 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2024-11-10 15:21:55,717 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:55,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 15:21:55,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:21:55,767 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:21:55,835 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:21:55,835 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:21:55,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 15:21:55,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 15:21:55,965 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 15:21:55,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 15:21:55,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 15:21:55,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 15:21:55,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 15:21:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:21:56,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:21:56,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (and (forall ((v_ArrVal_1950 (Array Int Int)) (v_ArrVal_1949 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1949) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1950) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)))) (forall ((v_ArrVal_1949 (Array Int Int))) (<= 0 (+ 12 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_1949) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)))))) is different from false [2024-11-10 15:21:56,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1949 (Array Int Int))) (<= 0 (+ 12 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1949) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) (forall ((v_ArrVal_1950 (Array Int Int)) (v_ArrVal_1949 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1949) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1950) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))))) is different from false [2024-11-10 15:21:56,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:56,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-10 15:21:56,115 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 40 treesize of output 28 [2024-11-10 15:21:56,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:56,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-10 15:21:56,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:21:56,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-10 15:21:56,128 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:21:56,130 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 33 treesize of output 21 [2024-11-10 15:21:56,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:21:56,132 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 24 treesize of output 12 [2024-11-10 15:21:56,422 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 15:21:56,422 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 22 treesize of output 21 [2024-11-10 15:22:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-10 15:22:00,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522846812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:22:00,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:22:00,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 19] total 55 [2024-11-10 15:22:00,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643706118] [2024-11-10 15:22:00,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:22:00,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-10 15:22:00,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:22:00,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-10 15:22:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2650, Unknown=18, NotChecked=210, Total=3080 [2024-11-10 15:22:00,269 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 56 states, 55 states have (on average 2.1272727272727274) internal successors, (117), 46 states have internal predecessors, (117), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-10 15:22:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:22:00,929 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2024-11-10 15:22:00,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:22:00,929 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.1272727272727274) internal successors, (117), 46 states have internal predecessors, (117), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) Word has length 50 [2024-11-10 15:22:00,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:22:00,930 INFO L225 Difference]: With dead ends: 101 [2024-11-10 15:22:00,930 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 15:22:00,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=385, Invalid=4027, Unknown=18, NotChecked=262, Total=4692 [2024-11-10 15:22:00,932 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 85 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:22:00,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 919 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 453 Invalid, 0 Unknown, 86 Unchecked, 0.3s Time] [2024-11-10 15:22:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 15:22:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-10 15:22:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 96 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:22:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2024-11-10 15:22:00,935 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 50 [2024-11-10 15:22:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:22:00,936 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2024-11-10 15:22:00,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.1272727272727274) internal successors, (117), 46 states have internal predecessors, (117), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-10 15:22:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2024-11-10 15:22:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 15:22:00,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:22:00,937 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-10 15:22:00,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-10 15:22:01,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:01,137 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 23 more)] === [2024-11-10 15:22:01,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:22:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash -357740257, now seen corresponding path program 2 times [2024-11-10 15:22:01,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:22:01,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583800737] [2024-11-10 15:22:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:22:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:22:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 15:22:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-10 15:22:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:22:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 15:22:02,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:22:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583800737] [2024-11-10 15:22:02,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583800737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:22:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394568966] [2024-11-10 15:22:02,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 15:22:02,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:22:02,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:22:02,340 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:02,342 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:02,537 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 15:22:02,538 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 15:22:02,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-10 15:22:02,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:22:02,552 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,710 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:02,713 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:02,737 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:22:02,737 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:02,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-10 15:22:02,796 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 26 [2024-11-10 15:22:02,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:02,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:02,976 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 15:22:02,976 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 60 [2024-11-10 15:22:02,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:02,985 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 56 treesize of output 29 [2024-11-10 15:22:03,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:03,146 INFO L349 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2024-11-10 15:22:03,146 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 111 treesize of output 68 [2024-11-10 15:22:03,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:22:03,153 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 60 treesize of output 29 [2024-11-10 15:22:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:22:03,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:22:03,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse4 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base|)) (.cse3 (+ |c_ULTIMATE.start_create_#t~mem11#1.offset| 12))) (and (forall ((v_ArrVal_2073 (Array Int Int))) (or (forall ((v_ArrVal_2074 (Array Int Int))) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2074))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2073) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4)) 0) (not (= v_ArrVal_2074 (store .cse2 .cse3 (select v_ArrVal_2074 .cse3)))))) (not (= (store .cse4 .cse3 (select v_ArrVal_2073 .cse3)) v_ArrVal_2073)))) (forall ((v_ArrVal_2073 (Array Int Int))) (or (forall ((v_ArrVal_2074 (Array Int Int))) (or (= (let ((.cse5 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2073))) (select (select .cse5 (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2074) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)) (+ (select (select .cse5 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))) 0) (not (= v_ArrVal_2074 (store .cse2 .cse3 (select v_ArrVal_2074 .cse3)))))) (not (= (store .cse4 .cse3 (select v_ArrVal_2073 .cse3)) v_ArrVal_2073)))))) is different from false [2024-11-10 15:22:03,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9)) (.cse6 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#0.base| .cse5)) (.cse1 (select |c_#memory_$Pointer$#0.offset| .cse5))) (and (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_36| Int)) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_36| .cse0) (forall ((v_ArrVal_2073 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_36| 12))) (or (not (= (store .cse1 .cse2 (select v_ArrVal_2073 .cse2)) v_ArrVal_2073)) (forall ((v_ArrVal_2074 (Array Int Int))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_2074 .cse2)) v_ArrVal_2074)) (= (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| .cse5 v_ArrVal_2073))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$#0.base| .cse5 v_ArrVal_2074) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6)) (+ (select (select .cse4 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6) 4))) 0)))))))) (forall ((|v_ULTIMATE.start_create_#t~mem11#1.offset_36| Int)) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_36| .cse0) (forall ((v_ArrVal_2073 (Array Int Int))) (let ((.cse8 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_36| 12))) (or (forall ((v_ArrVal_2074 (Array Int Int))) (or (= (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| .cse5 v_ArrVal_2074))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6))) (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse5 v_ArrVal_2073) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6) 4)) 0) (not (= (store .cse3 .cse8 (select v_ArrVal_2074 .cse8)) v_ArrVal_2074)))) (not (= (store .cse1 .cse8 (select v_ArrVal_2073 .cse8)) v_ArrVal_2073))))))))))) is different from false [2024-11-10 15:22:04,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)) (.cse7 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base|)) (.cse8 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|))) (and (forall ((v_ArrVal_2069 Int) (v_ArrVal_2070 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_36| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_2069)))) (or (forall ((v_ArrVal_2073 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_2070)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse5 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_36| 12))) (or (forall ((v_ArrVal_2074 (Array Int Int))) (or (= (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_2074))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (+ (select (select (store .cse4 .cse3 v_ArrVal_2073) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4)) 0) (not (= (store (select .cse2 .cse3) .cse5 (select v_ArrVal_2074 .cse5)) v_ArrVal_2074)))) (not (= v_ArrVal_2073 (store (select .cse4 .cse3) .cse5 (select v_ArrVal_2073 .cse5)))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_36| (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))) (forall ((v_ArrVal_2069 Int) (v_ArrVal_2070 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_36| Int)) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse8 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_2069)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_36| (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (forall ((v_ArrVal_2073 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store .cse7 |c_ULTIMATE.start_create_#t~mem9#1.offset| v_ArrVal_2070)))) (let ((.cse11 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_36| 12)) (.cse10 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))) (or (not (= v_ArrVal_2073 (store (select .cse9 .cse10) .cse11 (select v_ArrVal_2073 .cse11)))) (forall ((v_ArrVal_2074 (Array Int Int))) (or (not (= (store (select .cse12 .cse10) .cse11 (select v_ArrVal_2074 .cse11)) v_ArrVal_2074)) (= (let ((.cse13 (store .cse9 .cse10 v_ArrVal_2073))) (select (select .cse13 (select (select (store .cse12 .cse10 v_ArrVal_2074) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)) (+ (select (select .cse13 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 4))) 0)))))))))))) is different from false [2024-11-10 15:22:04,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (let ((.cse10 (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse6 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select |c_#memory_$Pointer$#0.base| .cse7)) (.cse9 (select |c_#memory_$Pointer$#0.offset| .cse7))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_38| Int)) (or (forall ((v_ArrVal_2069 Int) (v_ArrVal_2070 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_36| Int)) (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_38| v_ArrVal_2069)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_36| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_2073 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_38| v_ArrVal_2070)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse4 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_36| 12))) (or (forall ((v_ArrVal_2074 (Array Int Int))) (or (not (= v_ArrVal_2074 (store (select .cse2 .cse3) .cse4 (select v_ArrVal_2074 .cse4)))) (= (let ((.cse5 (store .cse0 .cse3 v_ArrVal_2073))) (select (select .cse5 (select (select (store .cse2 .cse3 v_ArrVal_2074) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6)) (+ (select (select .cse5 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6) 4))) 0))) (not (= (store (select .cse0 .cse3) .cse4 (select v_ArrVal_2073 .cse4)) v_ArrVal_2073))))))))) (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_38|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_38| Int)) (or (< .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_38|) (forall ((v_ArrVal_2069 Int) (v_ArrVal_2070 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_36| Int)) (let ((.cse11 (store |c_#memory_$Pointer$#0.offset| .cse7 (store .cse9 |v_ULTIMATE.start_create_#t~mem9#1.offset_38| v_ArrVal_2069)))) (or (< |v_ULTIMATE.start_create_#t~mem11#1.offset_36| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_2073 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#0.base| .cse7 (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_38| v_ArrVal_2070)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse14 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_36| 12))) (or (forall ((v_ArrVal_2074 (Array Int Int))) (or (not (= v_ArrVal_2074 (store (select .cse12 .cse13) .cse14 (select v_ArrVal_2074 .cse14)))) (= (select (let ((.cse15 (store .cse12 .cse13 v_ArrVal_2074))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6))) (+ (select (select (store .cse11 .cse13 v_ArrVal_2073) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse6) 4)) 0))) (not (= (store (select .cse11 .cse13) .cse14 (select v_ArrVal_2073 .cse14)) v_ArrVal_2073))))))))))))))) is different from false [2024-11-10 15:22:04,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |c_ULTIMATE.start_create_#t~ret8#1.offset|))) (.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |c_ULTIMATE.start_create_#t~ret8#1.base|)))) (let ((.cse5 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 4)) (.cse8 (select .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base|)) (.cse10 (select .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_38| Int)) (or (forall ((v_ArrVal_2069 Int) (v_ArrVal_2070 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_36| Int)) (let ((.cse0 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_38| v_ArrVal_2069)))) (or (forall ((v_ArrVal_2073 (Array Int Int))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_38| v_ArrVal_2070)))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse2 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_36| 12))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_2073 .cse2)) v_ArrVal_2073)) (forall ((v_ArrVal_2074 (Array Int Int))) (or (= (let ((.cse3 (store .cse0 .cse1 v_ArrVal_2073))) (select (select .cse3 (select (select (store .cse4 .cse1 v_ArrVal_2074) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5)) (+ (select (select .cse3 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4))) 0) (not (= (store (select .cse4 .cse1) .cse2 (select v_ArrVal_2074 .cse2)) v_ArrVal_2074)))))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_36| (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))) (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_38|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_38| Int)) (or (forall ((v_ArrVal_2069 Int) (v_ArrVal_2070 Int) (|v_ULTIMATE.start_create_#t~mem11#1.offset_36| Int)) (let ((.cse14 (store .cse9 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse10 |v_ULTIMATE.start_create_#t~mem9#1.offset_38| v_ArrVal_2069)))) (or (forall ((v_ArrVal_2073 (Array Int Int))) (let ((.cse12 (store .cse7 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse8 |v_ULTIMATE.start_create_#t~mem9#1.offset_38| v_ArrVal_2070)))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6)) (.cse15 (+ |v_ULTIMATE.start_create_#t~mem11#1.offset_36| 12))) (or (forall ((v_ArrVal_2074 (Array Int Int))) (or (= (select (let ((.cse11 (store .cse12 .cse13 v_ArrVal_2074))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5))) (+ (select (select (store .cse14 .cse13 v_ArrVal_2073) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse5) 4)) 0) (not (= (store (select .cse12 .cse13) .cse15 (select v_ArrVal_2074 .cse15)) v_ArrVal_2074)))) (not (= (store (select .cse14 .cse13) .cse15 (select v_ArrVal_2073 .cse15)) v_ArrVal_2073)))))) (< |v_ULTIMATE.start_create_#t~mem11#1.offset_36| (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6))))) (< |c_ULTIMATE.start_create_#t~ret8#1.offset| |v_ULTIMATE.start_create_#t~mem9#1.offset_38|))))))) is different from false [2024-11-10 15:22:05,139 INFO L349 Elim1Store]: treesize reduction 1275, result has 38.3 percent of original size [2024-11-10 15:22:05,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 87246 treesize of output 81267 [2024-11-10 15:22:06,146 INFO L349 Elim1Store]: treesize reduction 291, result has 34.8 percent of original size [2024-11-10 15:22:06,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 15 new quantified variables, introduced 37 case distinctions, treesize of input 2697546 treesize of output 1825520 [2024-11-10 15:22:12,414 WARN L286 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 2183 DAG size of output: 978 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 15:22:13,572 INFO L349 Elim1Store]: treesize reduction 1028, result has 27.6 percent of original size [2024-11-10 15:22:13,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 46 case distinctions, treesize of input 51525 treesize of output 51034 [2024-11-10 15:22:15,096 INFO L349 Elim1Store]: treesize reduction 416, result has 31.1 percent of original size [2024-11-10 15:22:15,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 46 case distinctions, treesize of input 51590 treesize of output 35673 [2024-11-10 15:22:16,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:16,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 51436 treesize of output 37106 [2024-11-10 15:22:18,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:22:18,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 35212 treesize of output 35480