./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-before.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-shared-before.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:53:37,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:53:37,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-19 06:53:37,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:53:37,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:53:37,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:53:37,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:53:37,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:53:37,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:53:37,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:53:37,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:53:37,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:53:37,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:53:37,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:53:37,295 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:53:37,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:53:37,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:53:37,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:53:37,296 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:53:37,296 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:53:37,297 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:53:37,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:53:37,299 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:53:37,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:53:37,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:53:37,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:53:37,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:53:37,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:53:37,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:53:37,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:53:37,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:53:37,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:53:37,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:53:37,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:53:37,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:53:37,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:53:37,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:53:37,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:53:37,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:53:37,302 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f [2024-11-19 06:53:37,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:53:37,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:53:37,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:53:37,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:53:37,542 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:53:37,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2024-11-19 06:53:38,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:53:38,950 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:53:38,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2024-11-19 06:53:38,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d17a94c9/314a67bd35c84d0bb57685debada1c07/FLAG77204de39 [2024-11-19 06:53:39,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d17a94c9/314a67bd35c84d0bb57685debada1c07 [2024-11-19 06:53:39,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:53:39,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:53:39,294 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:53:39,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:53:39,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:53:39,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a46da3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39, skipping insertion in model container [2024-11-19 06:53:39,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:53:39,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:53:39,559 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:53:39,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:53:39,622 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:53:39,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39 WrapperNode [2024-11-19 06:53:39,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:53:39,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:53:39,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:53:39,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:53:39,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,653 INFO L138 Inliner]: procedures = 120, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-11-19 06:53:39,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:53:39,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:53:39,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:53:39,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:53:39,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,680 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2024-11-19 06:53:39,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:53:39,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:53:39,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:53:39,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:53:39,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (1/1) ... [2024-11-19 06:53:39,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:53:39,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:39,720 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-19 06:53:39,721 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-19 06:53:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:53:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-19 06:53:39,754 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-19 06:53:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:53:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:53:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:53:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:53:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:53:39,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:53:39,832 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:53:39,834 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:53:39,971 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2024-11-19 06:53:39,971 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:53:39,984 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:53:39,984 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:53:39,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:53:39 BoogieIcfgContainer [2024-11-19 06:53:39,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:53:39,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:53:39,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:53:39,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:53:39,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:53:39" (1/3) ... [2024-11-19 06:53:39,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9fe098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:53:39, skipping insertion in model container [2024-11-19 06:53:39,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:53:39" (2/3) ... [2024-11-19 06:53:39,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9fe098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:53:39, skipping insertion in model container [2024-11-19 06:53:39,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:53:39" (3/3) ... [2024-11-19 06:53:39,993 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-shared-before.i [2024-11-19 06:53:40,006 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:53:40,007 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2024-11-19 06:53:40,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:53:40,052 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;@1bfe9000, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:53:40,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2024-11-19 06:53:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:40,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:53:40,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:40,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:53:40,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:40,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash 35815, now seen corresponding path program 1 times [2024-11-19 06:53:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:40,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466186485] [2024-11-19 06:53:40,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:40,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:40,227 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-19 06:53:40,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:40,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466186485] [2024-11-19 06:53:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466186485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:40,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:40,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762175967] [2024-11-19 06:53:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:40,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:40,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:40,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:40,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:40,260 INFO L87 Difference]: Start difference. First operand has 60 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:40,326 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2024-11-19 06:53:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:40,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 06:53:40,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:40,334 INFO L225 Difference]: With dead ends: 59 [2024-11-19 06:53:40,334 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 06:53:40,336 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-19 06:53:40,338 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:40,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:53:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 06:53:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-19 06:53:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.71875) internal successors, (55), 53 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2024-11-19 06:53:40,398 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 3 [2024-11-19 06:53:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:40,399 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2024-11-19 06:53:40,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2024-11-19 06:53:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:53:40,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:40,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:53:40,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:53:40,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:40,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash 35816, now seen corresponding path program 1 times [2024-11-19 06:53:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:40,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739302860] [2024-11-19 06:53:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:40,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:40,490 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-19 06:53:40,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:40,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739302860] [2024-11-19 06:53:40,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739302860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:40,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:40,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:40,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430694772] [2024-11-19 06:53:40,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:40,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:40,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:40,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:40,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:40,493 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:40,540 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-11-19 06:53:40,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:40,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 06:53:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:40,541 INFO L225 Difference]: With dead ends: 56 [2024-11-19 06:53:40,541 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 06:53:40,542 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-19 06:53:40,542 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:40,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:53:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 06:53:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-19 06:53:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.6875) internal successors, (54), 52 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2024-11-19 06:53:40,551 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 3 [2024-11-19 06:53:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:40,551 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-19 06:53:40,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2024-11-19 06:53:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:53:40,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:40,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:40,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:53:40,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:40,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:40,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1284320017, now seen corresponding path program 1 times [2024-11-19 06:53:40,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:40,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823387609] [2024-11-19 06:53:40,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:40,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:40,631 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-19 06:53:40,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:40,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823387609] [2024-11-19 06:53:40,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823387609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:40,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:40,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:40,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464587571] [2024-11-19 06:53:40,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:40,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:40,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:40,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:40,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:40,633 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:40,675 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2024-11-19 06:53:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:40,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:53:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:40,676 INFO L225 Difference]: With dead ends: 55 [2024-11-19 06:53:40,676 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 06:53:40,676 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-19 06:53:40,677 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:40,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:53:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 06:53:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-19 06:53:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.65625) internal successors, (53), 51 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:40,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2024-11-19 06:53:40,683 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 7 [2024-11-19 06:53:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:40,683 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-11-19 06:53:40,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2024-11-19 06:53:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:53:40,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:40,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:40,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:53:40,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:40,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1284320016, now seen corresponding path program 1 times [2024-11-19 06:53:40,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:40,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558085724] [2024-11-19 06:53:40,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:40,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:40,778 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-19 06:53:40,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:40,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558085724] [2024-11-19 06:53:40,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558085724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:40,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:40,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:40,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063401711] [2024-11-19 06:53:40,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:40,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:40,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:40,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:40,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:40,783 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:40,809 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2024-11-19 06:53:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:40,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:53:40,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:40,810 INFO L225 Difference]: With dead ends: 54 [2024-11-19 06:53:40,810 INFO L226 Difference]: Without dead ends: 54 [2024-11-19 06:53:40,810 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-19 06:53:40,811 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:40,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:53:40,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-19 06:53:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-19 06:53:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.625) internal successors, (52), 50 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-11-19 06:53:40,820 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 7 [2024-11-19 06:53:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:40,820 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-11-19 06:53:40,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:53:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2024-11-19 06:53:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:53:40,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:40,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:40,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:53:40,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:40,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:40,823 INFO L85 PathProgramCache]: Analyzing trace with hash -40963897, now seen corresponding path program 1 times [2024-11-19 06:53:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222074496] [2024-11-19 06:53:40,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:40,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:40,914 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-19 06:53:40,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:40,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222074496] [2024-11-19 06:53:40,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222074496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:40,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:40,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:53:40,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000261811] [2024-11-19 06:53:40,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:40,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:53:40,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:40,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:53:40,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:53:40,916 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 6 states, 5 states have (on average 2.0) 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-19 06:53:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:41,010 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-11-19 06:53:41,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:53:41,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) 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-19 06:53:41,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:41,014 INFO L225 Difference]: With dead ends: 56 [2024-11-19 06:53:41,014 INFO L226 Difference]: Without dead ends: 56 [2024-11-19 06:53:41,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:53:41,015 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:41,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 136 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:41,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-19 06:53:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-19 06:53:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.53125) internal successors, (49), 47 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2024-11-19 06:53:41,028 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 12 [2024-11-19 06:53:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:41,028 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-11-19 06:53:41,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) 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-19 06:53:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2024-11-19 06:53:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:53:41,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:41,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:41,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:53:41,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:41,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash -40963896, now seen corresponding path program 1 times [2024-11-19 06:53:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:41,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857748492] [2024-11-19 06:53:41,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:41,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:41,178 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-19 06:53:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857748492] [2024-11-19 06:53:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857748492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:41,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:41,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:53:41,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26605121] [2024-11-19 06:53:41,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:41,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:53:41,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:41,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:53:41,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:53:41,181 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 6 states, 5 states have (on average 2.0) 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-19 06:53:41,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:41,246 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-11-19 06:53:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:53:41,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) 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-19 06:53:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:41,247 INFO L225 Difference]: With dead ends: 55 [2024-11-19 06:53:41,247 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 06:53:41,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:53:41,248 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 5 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:41,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 169 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 06:53:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-11-19 06:53:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.5) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-11-19 06:53:41,256 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 12 [2024-11-19 06:53:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:41,256 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-19 06:53:41,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) 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-19 06:53:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2024-11-19 06:53:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:53:41,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:41,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:41,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:53:41,258 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:41,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:41,258 INFO L85 PathProgramCache]: Analyzing trace with hash 694727655, now seen corresponding path program 1 times [2024-11-19 06:53:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:41,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740161743] [2024-11-19 06:53:41,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:41,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:41,330 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-19 06:53:41,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740161743] [2024-11-19 06:53:41,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740161743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090729496] [2024-11-19 06:53:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:41,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:41,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:41,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:41,336 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:41,344 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2024-11-19 06:53:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:41,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 06:53:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:41,345 INFO L225 Difference]: With dead ends: 49 [2024-11-19 06:53:41,345 INFO L226 Difference]: Without dead ends: 49 [2024-11-19 06:53:41,345 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-19 06:53:41,346 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 14 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:41,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 73 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:53:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-19 06:53:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-19 06:53:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.46875) internal successors, (47), 45 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2024-11-19 06:53:41,353 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 17 [2024-11-19 06:53:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:41,354 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2024-11-19 06:53:41,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2024-11-19 06:53:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:53:41,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:41,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:41,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:53:41,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:41,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash 61720908, now seen corresponding path program 1 times [2024-11-19 06:53:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:41,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117633309] [2024-11-19 06:53:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:41,385 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-19 06:53:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117633309] [2024-11-19 06:53:41,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117633309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:41,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:41,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:53:41,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639577929] [2024-11-19 06:53:41,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:41,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:53:41,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:41,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:53:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:53:41,389 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:41,403 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-11-19 06:53:41,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:53:41,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-19 06:53:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:41,404 INFO L225 Difference]: With dead ends: 48 [2024-11-19 06:53:41,404 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 06:53:41,405 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-19 06:53:41,405 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:41,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 60 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:53:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 06:53:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-19 06:53:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.4375) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-11-19 06:53:41,412 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 18 [2024-11-19 06:53:41,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:41,412 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-11-19 06:53:41,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-11-19 06:53:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:53:41,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:41,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:41,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:53:41,413 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:41,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:41,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1913348233, now seen corresponding path program 1 times [2024-11-19 06:53:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332628018] [2024-11-19 06:53:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:41,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:41,528 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-19 06:53:41,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:41,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332628018] [2024-11-19 06:53:41,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332628018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:41,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:41,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751041178] [2024-11-19 06:53:41,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:41,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:41,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:41,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:41,531 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:41,594 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2024-11-19 06:53:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:53:41,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-19 06:53:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:41,597 INFO L225 Difference]: With dead ends: 47 [2024-11-19 06:53:41,597 INFO L226 Difference]: Without dead ends: 47 [2024-11-19 06:53:41,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:41,598 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:41,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-19 06:53:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-19 06:53:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.40625) internal successors, (45), 43 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2024-11-19 06:53:41,603 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 19 [2024-11-19 06:53:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:41,603 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2024-11-19 06:53:41,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2024-11-19 06:53:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:53:41,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:41,604 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:41,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:53:41,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:41,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1882162804, now seen corresponding path program 1 times [2024-11-19 06:53:41,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:41,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160944261] [2024-11-19 06:53:41,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:41,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160944261] [2024-11-19 06:53:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160944261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:41,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573993185] [2024-11-19 06:53:41,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:41,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:41,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:41,772 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-19 06:53:41,773 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-19 06:53:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:41,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:53:41,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:41,909 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-19 06:53:41,986 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:53:41,987 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-19 06:53:41,998 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-19 06:53:41,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:53:41,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573993185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:41,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:53:41,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2024-11-19 06:53:41,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248255522] [2024-11-19 06:53:41,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:41,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:53:41,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:42,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:53:42,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-11-19 06:53:42,000 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:42,043 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2024-11-19 06:53:42,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:53:42,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-11-19 06:53:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:42,044 INFO L225 Difference]: With dead ends: 53 [2024-11-19 06:53:42,044 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 06:53:42,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-11-19 06:53:42,045 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:42,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 77 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 67 Unchecked, 0.0s Time] [2024-11-19 06:53:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 06:53:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-19 06:53:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-19 06:53:42,050 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 21 [2024-11-19 06:53:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:42,051 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-19 06:53:42,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-11-19 06:53:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:53:42,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:42,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:42,069 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-19 06:53:42,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 06:53:42,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:42,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:42,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1882162805, now seen corresponding path program 1 times [2024-11-19 06:53:42,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:42,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57258000] [2024-11-19 06:53:42,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:42,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:42,479 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-19 06:53:42,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57258000] [2024-11-19 06:53:42,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57258000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135102093] [2024-11-19 06:53:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:42,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:42,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:42,481 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-19 06:53:42,482 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-19 06:53:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:42,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:53:42,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:42,556 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-19 06:53:42,663 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-19 06:53:42,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:42,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:53:42,700 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:42,701 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-19 06:53:42,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-19 06:53:42,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:42,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135102093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:42,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:42,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 06:53:42,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161907021] [2024-11-19 06:53:42,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:42,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:53:42,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:42,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:53:42,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2024-11-19 06:53:42,828 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:43,012 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2024-11-19 06:53:43,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:53:43,013 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2024-11-19 06:53:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:43,014 INFO L225 Difference]: With dead ends: 60 [2024-11-19 06:53:43,014 INFO L226 Difference]: Without dead ends: 60 [2024-11-19 06:53:43,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=322, Unknown=1, NotChecked=36, Total=420 [2024-11-19 06:53:43,014 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 26 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:43,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 306 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2024-11-19 06:53:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-19 06:53:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-11-19 06:53:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.4) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-19 06:53:43,018 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 21 [2024-11-19 06:53:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:43,018 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-19 06:53:43,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-19 06:53:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:53:43,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:43,019 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-19 06:53:43,036 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-19 06:53:43,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 06:53:43,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:43,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash 481652236, now seen corresponding path program 1 times [2024-11-19 06:53:43,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:43,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029484085] [2024-11-19 06:53:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:43,400 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-19 06:53:43,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:43,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029484085] [2024-11-19 06:53:43,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029484085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:43,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:43,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:53:43,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043620739] [2024-11-19 06:53:43,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:43,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:53:43,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:43,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:53:43,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:53:43,402 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:43,545 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2024-11-19 06:53:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:53:43,546 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-19 06:53:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:43,549 INFO L225 Difference]: With dead ends: 62 [2024-11-19 06:53:43,549 INFO L226 Difference]: Without dead ends: 62 [2024-11-19 06:53:43,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:53:43,549 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:43,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 193 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-19 06:53:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-19 06:53:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 57 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-19 06:53:43,555 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 21 [2024-11-19 06:53:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:43,555 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-19 06:53:43,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-11-19 06:53:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:53:43,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:43,557 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-19 06:53:43,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:53:43,557 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:43,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:43,558 INFO L85 PathProgramCache]: Analyzing trace with hash 481652237, now seen corresponding path program 1 times [2024-11-19 06:53:43,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:43,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053173301] [2024-11-19 06:53:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:43,703 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-19 06:53:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053173301] [2024-11-19 06:53:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053173301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:43,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:43,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:53:43,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368023064] [2024-11-19 06:53:43,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:43,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:43,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:43,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:43,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:43,705 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:43,805 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2024-11-19 06:53:43,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:53:43,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-19 06:53:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:43,806 INFO L225 Difference]: With dead ends: 64 [2024-11-19 06:53:43,806 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 06:53:43,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-19 06:53:43,807 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:43,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 181 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 06:53:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-19 06:53:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 59 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2024-11-19 06:53:43,810 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 21 [2024-11-19 06:53:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:43,810 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2024-11-19 06:53:43,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2024-11-19 06:53:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:53:43,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:43,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:43,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:53:43,812 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:43,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2046315958, now seen corresponding path program 1 times [2024-11-19 06:53:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:43,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431387884] [2024-11-19 06:53:43,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:43,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:43,873 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-19 06:53:43,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:43,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431387884] [2024-11-19 06:53:43,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431387884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:43,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:43,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:53:43,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660109463] [2024-11-19 06:53:43,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:43,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:43,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:43,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:43,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:43,875 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:43,924 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2024-11-19 06:53:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:53:43,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-19 06:53:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:43,924 INFO L225 Difference]: With dead ends: 71 [2024-11-19 06:53:43,925 INFO L226 Difference]: Without dead ends: 71 [2024-11-19 06:53:43,925 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-19 06:53:43,925 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 20 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:43,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 272 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:53:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-19 06:53:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2024-11-19 06:53:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.3) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-19 06:53:43,928 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 22 [2024-11-19 06:53:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:43,928 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-19 06:53:43,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-19 06:53:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:53:43,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:43,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:43,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:53:43,929 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:43,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash 714046705, now seen corresponding path program 1 times [2024-11-19 06:53:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:43,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571850834] [2024-11-19 06:53:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:44,001 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-19 06:53:44,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:44,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571850834] [2024-11-19 06:53:44,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571850834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:44,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:44,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:44,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482962823] [2024-11-19 06:53:44,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:44,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:44,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:44,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:44,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:44,003 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:44,069 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-11-19 06:53:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:53:44,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-19 06:53:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:44,070 INFO L225 Difference]: With dead ends: 64 [2024-11-19 06:53:44,070 INFO L226 Difference]: Without dead ends: 64 [2024-11-19 06:53:44,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:44,071 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:44,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 154 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-19 06:53:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-19 06:53:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.26) internal successors, (63), 59 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2024-11-19 06:53:44,073 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 24 [2024-11-19 06:53:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:44,073 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2024-11-19 06:53:44,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2024-11-19 06:53:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:53:44,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:44,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:44,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:53:44,075 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:44,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:44,075 INFO L85 PathProgramCache]: Analyzing trace with hash 714046706, now seen corresponding path program 1 times [2024-11-19 06:53:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:44,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615273054] [2024-11-19 06:53:44,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:44,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:44,215 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-19 06:53:44,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:44,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615273054] [2024-11-19 06:53:44,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615273054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:44,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:44,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:53:44,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070791468] [2024-11-19 06:53:44,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:44,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:53:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:44,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:53:44,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:53:44,217 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:44,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:44,281 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2024-11-19 06:53:44,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:53:44,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-19 06:53:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:44,282 INFO L225 Difference]: With dead ends: 63 [2024-11-19 06:53:44,282 INFO L226 Difference]: Without dead ends: 63 [2024-11-19 06:53:44,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:53:44,282 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:44,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 170 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-19 06:53:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-19 06:53:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.22) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2024-11-19 06:53:44,285 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 24 [2024-11-19 06:53:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:44,285 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-11-19 06:53:44,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:53:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2024-11-19 06:53:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:53:44,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:44,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:44,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:53:44,286 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:44,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash -583935462, now seen corresponding path program 1 times [2024-11-19 06:53:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:44,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132132501] [2024-11-19 06:53:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:44,360 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-19 06:53:44,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:44,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132132501] [2024-11-19 06:53:44,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132132501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:53:44,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:53:44,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:53:44,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4744709] [2024-11-19 06:53:44,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:53:44,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:53:44,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:44,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:53:44,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:53:44,362 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:44,446 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-11-19 06:53:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:53:44,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-19 06:53:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:44,446 INFO L225 Difference]: With dead ends: 68 [2024-11-19 06:53:44,447 INFO L226 Difference]: Without dead ends: 68 [2024-11-19 06:53:44,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-19 06:53:44,447 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:44,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 213 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-19 06:53:44,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-11-19 06:53:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 62 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2024-11-19 06:53:44,450 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 24 [2024-11-19 06:53:44,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:44,450 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2024-11-19 06:53:44,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:53:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2024-11-19 06:53:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:53:44,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:44,451 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:44,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:53:44,451 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:44,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1403696687, now seen corresponding path program 1 times [2024-11-19 06:53:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:44,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620084053] [2024-11-19 06:53:44,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:44,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:44,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620084053] [2024-11-19 06:53:44,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620084053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:44,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840749581] [2024-11-19 06:53:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:44,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:44,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:44,792 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-19 06:53:44,793 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-19 06:53:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:44,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 06:53:44,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:44,881 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-19 06:53:44,884 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-19 06:53:44,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:44,972 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-19 06:53:44,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:44,978 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-19 06:53:45,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:45,074 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-19 06:53:45,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:45,080 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-19 06:53:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:45,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:45,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-19 06:53:45,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2024-11-19 06:53:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:45,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840749581] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:53:45,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:53:45,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2024-11-19 06:53:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768457963] [2024-11-19 06:53:45,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:45,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 06:53:45,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:45,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 06:53:45,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2024-11-19 06:53:45,626 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:53:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:45,925 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-11-19 06:53:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:53:45,926 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-19 06:53:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:45,927 INFO L225 Difference]: With dead ends: 70 [2024-11-19 06:53:45,928 INFO L226 Difference]: Without dead ends: 70 [2024-11-19 06:53:45,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-11-19 06:53:45,928 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:45,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 499 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:45,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-19 06:53:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-19 06:53:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 65 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2024-11-19 06:53:45,931 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 27 [2024-11-19 06:53:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:45,931 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2024-11-19 06:53:45,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:53:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2024-11-19 06:53:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 06:53:45,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:45,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:45,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:46,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 06:53:46,133 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:46,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:46,133 INFO L85 PathProgramCache]: Analyzing trace with hash -564925807, now seen corresponding path program 1 times [2024-11-19 06:53:46,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:46,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536971213] [2024-11-19 06:53:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:46,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:46,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:46,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536971213] [2024-11-19 06:53:46,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536971213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524987555] [2024-11-19 06:53:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:46,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:46,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:46,394 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-19 06:53:46,395 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-19 06:53:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:46,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 06:53:46,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:46,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 16 treesize of output 31 [2024-11-19 06:53:46,668 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:53:46,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2024-11-19 06:53:46,676 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~l#1.base_16| Int) (|v_ULTIMATE.start_main_~data~0#1.base_12| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_12| 1) |v_ULTIMATE.start_destroy_~l#1.base_16|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_12| 0) |v_ULTIMATE.start_destroy_~l#1.base_16| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_12|) 0))) is different from true [2024-11-19 06:53:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-19 06:53:46,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:46,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524987555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:46,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:46,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2024-11-19 06:53:46,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034227282] [2024-11-19 06:53:46,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:46,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 06:53:46,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:46,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 06:53:46,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=533, Unknown=1, NotChecked=46, Total=650 [2024-11-19 06:53:46,801 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:47,087 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-11-19 06:53:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:53:47,088 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-19 06:53:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:47,088 INFO L225 Difference]: With dead ends: 72 [2024-11-19 06:53:47,088 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 06:53:47,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=580, Unknown=1, NotChecked=48, Total=702 [2024-11-19 06:53:47,089 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:47,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 304 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 460 Invalid, 0 Unknown, 61 Unchecked, 0.3s Time] [2024-11-19 06:53:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 06:53:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-19 06:53:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.288888888888889) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2024-11-19 06:53:47,091 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 28 [2024-11-19 06:53:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:47,092 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2024-11-19 06:53:47,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2024-11-19 06:53:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:53:47,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:47,092 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:47,105 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-19 06:53:47,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:47,293 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:47,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:47,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1722766016, now seen corresponding path program 1 times [2024-11-19 06:53:47,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:47,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913990408] [2024-11-19 06:53:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:47,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:53:47,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:47,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913990408] [2024-11-19 06:53:47,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913990408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:47,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110184898] [2024-11-19 06:53:47,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:47,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:47,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:47,598 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-19 06:53:47,600 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-19 06:53:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:47,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 06:53:47,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:47,715 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:47,716 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-19 06:53:47,732 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-19 06:53:47,774 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:47,774 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-19 06:53:47,784 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-19 06:53:47,795 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-19 06:53:47,817 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:53:47,817 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-19 06:53:47,819 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-19 06:53:47,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:47,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110184898] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:47,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:47,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 22 [2024-11-19 06:53:47,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146441701] [2024-11-19 06:53:47,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:47,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 06:53:47,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:47,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 06:53:47,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2024-11-19 06:53:47,860 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 06:53:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:48,083 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-19 06:53:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:53:48,083 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2024-11-19 06:53:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:48,084 INFO L225 Difference]: With dead ends: 57 [2024-11-19 06:53:48,084 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 06:53:48,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=662, Unknown=1, NotChecked=52, Total=812 [2024-11-19 06:53:48,085 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:48,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 353 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2024-11-19 06:53:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 06:53:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-19 06:53:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 52 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-19 06:53:48,086 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 36 [2024-11-19 06:53:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:48,087 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-19 06:53:48,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 06:53:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-19 06:53:48,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:53:48,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:48,088 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:48,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:48,291 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-19 06:53:48,292 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:48,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:48,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1722766015, now seen corresponding path program 1 times [2024-11-19 06:53:48,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:48,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32757262] [2024-11-19 06:53:48,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32757262] [2024-11-19 06:53:48,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32757262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:48,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772549585] [2024-11-19 06:53:48,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:48,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:48,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:48,780 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-19 06:53:48,781 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-19 06:53:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:48,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-19 06:53:48,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:48,917 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-19 06:53:48,980 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:48,981 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-19 06:53:49,012 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-19 06:53:49,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:53:49,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:53:49,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-19 06:53:49,093 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-19 06:53:49,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-19 06:53:49,149 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-19 06:53:49,251 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alloc_and_zero_#res.base| Int)) (and (= (store |c_old(#length)| |alloc_and_zero_#res.base| (select |c_#length| |alloc_and_zero_#res.base|)) |c_#length|) (= (select |c_old(#valid)| |alloc_and_zero_#res.base|) 0))) is different from true [2024-11-19 06:53:49,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:53:49,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:53:49,266 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:49,266 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-19 06:53:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-19 06:53:49,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:49,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772549585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:49,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:49,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-11-19 06:53:49,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755183190] [2024-11-19 06:53:49,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:49,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 06:53:49,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:49,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 06:53:49,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=971, Unknown=1, NotChecked=62, Total=1122 [2024-11-19 06:53:49,385 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 25 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:53:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:49,824 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-11-19 06:53:49,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:53:49,824 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 25 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 36 [2024-11-19 06:53:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:49,824 INFO L225 Difference]: With dead ends: 54 [2024-11-19 06:53:49,824 INFO L226 Difference]: Without dead ends: 54 [2024-11-19 06:53:49,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=1698, Unknown=1, NotChecked=84, Total=1980 [2024-11-19 06:53:49,825 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 27 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:49,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 570 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 548 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2024-11-19 06:53:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-19 06:53:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2024-11-19 06:53:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:53:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-19 06:53:49,827 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 36 [2024-11-19 06:53:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:49,827 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-19 06:53:49,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 25 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-19 06:53:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-19 06:53:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:53:49,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:49,828 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:49,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 06:53:50,028 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-19 06:53:50,028 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:50,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:50,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1171690712, now seen corresponding path program 1 times [2024-11-19 06:53:50,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:50,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223253298] [2024-11-19 06:53:50,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:50,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:50,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:50,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223253298] [2024-11-19 06:53:50,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223253298] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:50,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288269674] [2024-11-19 06:53:50,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:50,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:50,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:50,230 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-19 06:53:50,231 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-19 06:53:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:50,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 06:53:50,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:50,323 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-19 06:53:50,338 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:50,339 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-19 06:53:50,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:53:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:50,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:50,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:50,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 06:53:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288269674] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:53:50,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:53:50,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2024-11-19 06:53:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129731446] [2024-11-19 06:53:50,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:50,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:53:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:53:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:53:50,513 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:50,721 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2024-11-19 06:53:50,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:53:50,722 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2024-11-19 06:53:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:50,723 INFO L225 Difference]: With dead ends: 65 [2024-11-19 06:53:50,723 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 06:53:50,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:53:50,727 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:50,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 06:53:50,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-11-19 06:53:50,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2) internal successors, (66), 59 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-19 06:53:50,729 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 36 [2024-11-19 06:53:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:50,729 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-19 06:53:50,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-11-19 06:53:50,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:53:50,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:50,729 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:50,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:50,930 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-19 06:53:50,931 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:50,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1171690713, now seen corresponding path program 1 times [2024-11-19 06:53:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238996353] [2024-11-19 06:53:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:51,133 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-19 06:53:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238996353] [2024-11-19 06:53:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238996353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426206187] [2024-11-19 06:53:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:51,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:51,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:51,135 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-19 06:53:51,136 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-19 06:53:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:51,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:53:51,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:51,344 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-19 06:53:51,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:51,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:51,441 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-19 06:53:51,548 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-19 06:53:51,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426206187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:53:51,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:53:51,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2024-11-19 06:53:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858363566] [2024-11-19 06:53:51,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:51,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 06:53:51,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:51,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 06:53:51,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:53:51,550 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:53:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:51,690 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-11-19 06:53:51,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:53:51,690 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2024-11-19 06:53:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:51,691 INFO L225 Difference]: With dead ends: 67 [2024-11-19 06:53:51,691 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 06:53:51,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:53:51,691 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:51,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 389 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:53:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 06:53:51,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-11-19 06:53:51,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 61 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2024-11-19 06:53:51,694 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 36 [2024-11-19 06:53:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:51,694 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2024-11-19 06:53:51,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 06:53:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2024-11-19 06:53:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:53:51,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:51,695 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:51,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:51,895 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-19 06:53:51,895 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:51,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash 217655197, now seen corresponding path program 1 times [2024-11-19 06:53:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:51,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628848739] [2024-11-19 06:53:51,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:52,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:52,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628848739] [2024-11-19 06:53:52,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628848739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:52,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050756060] [2024-11-19 06:53:52,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:52,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:52,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:52,572 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-19 06:53:52,588 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-19 06:53:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:52,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-19 06:53:52,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:52,697 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-19 06:53:52,746 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:53:52,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 06:53:52,917 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-11-19 06:53:52,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2024-11-19 06:53:52,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:53:53,059 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:53:53,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-19 06:53:53,204 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-19 06:53:53,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 28 [2024-11-19 06:53:53,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:53,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-19 06:53:53,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:53:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:53:53,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:53,557 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1006 (Array Int Int)) (v_ArrVal_1007 Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base| v_ArrVal_1007) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1006) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) 1)) (forall ((v_ArrVal_1006 (Array Int Int))) (not (= |c_ULTIMATE.start_create_~sll~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1006) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))))) is different from false [2024-11-19 06:53:53,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:53,630 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 25 treesize of output 26 [2024-11-19 06:53:53,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:53,636 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 42 treesize of output 43 [2024-11-19 06:53:53,640 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 14 treesize of output 12 [2024-11-19 06:53:53,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:53,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-19 06:53:53,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:53,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-19 06:53:53,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-19 06:53:53,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050756060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:53,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:53,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 37 [2024-11-19 06:53:53,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175110500] [2024-11-19 06:53:53,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:53,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 06:53:53,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:53,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 06:53:53,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1896, Unknown=30, NotChecked=88, Total=2162 [2024-11-19 06:53:53,852 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 38 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:54,499 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2024-11-19 06:53:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:53:54,500 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2024-11-19 06:53:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:54,500 INFO L225 Difference]: With dead ends: 71 [2024-11-19 06:53:54,500 INFO L226 Difference]: Without dead ends: 71 [2024-11-19 06:53:54,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=245, Invalid=2918, Unknown=33, NotChecked=110, Total=3306 [2024-11-19 06:53:54,501 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:54,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 307 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:53:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-19 06:53:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-19 06:53:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 65 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-11-19 06:53:54,503 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 42 [2024-11-19 06:53:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:54,503 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-19 06:53:54,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 33 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-11-19 06:53:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:53:54,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:54,504 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:54,516 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-19 06:53:54,704 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-19 06:53:54,704 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:54,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash 217655198, now seen corresponding path program 1 times [2024-11-19 06:53:54,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:54,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677061598] [2024-11-19 06:53:54,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:54,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:55,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:55,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677061598] [2024-11-19 06:53:55,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677061598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:55,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573107830] [2024-11-19 06:53:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:55,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:55,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:55,320 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-19 06:53:55,321 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-19 06:53:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:55,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-19 06:53:55,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:55,511 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-19 06:53:55,573 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:55,574 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-19 06:53:55,606 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-19 06:53:55,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:53:55,681 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:53:55,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-19 06:53:55,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 06:53:55,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:55,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-19 06:53:55,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:55,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-19 06:53:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:55,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:56,217 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1102 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1102) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 8))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1102) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1103) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))))) is different from false [2024-11-19 06:53:56,224 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (and (forall ((v_ArrVal_1102 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1102) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1102) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1103) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))))) is different from false [2024-11-19 06:53:56,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:56,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2024-11-19 06:53:56,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:56,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 31 treesize of output 32 [2024-11-19 06:53:56,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:56,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2024-11-19 06:53:56,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:56,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 81 [2024-11-19 06:53:56,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-19 06:53:56,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-19 06:53:56,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:56,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-19 06:53:56,276 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:53:56,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 06:53:56,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573107830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:56,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:56,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2024-11-19 06:53:56,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797575159] [2024-11-19 06:53:56,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:56,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-19 06:53:56,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:56,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-19 06:53:56,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2290, Unknown=2, NotChecked=194, Total=2652 [2024-11-19 06:53:56,376 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 35 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:56,949 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2024-11-19 06:53:56,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 06:53:56,950 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 35 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2024-11-19 06:53:56,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:56,950 INFO L225 Difference]: With dead ends: 73 [2024-11-19 06:53:56,950 INFO L226 Difference]: Without dead ends: 73 [2024-11-19 06:53:56,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=271, Invalid=3517, Unknown=2, NotChecked=242, Total=4032 [2024-11-19 06:53:56,952 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:56,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 492 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:53:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-19 06:53:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-19 06:53:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 67 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-11-19 06:53:56,954 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 42 [2024-11-19 06:53:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:56,954 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-11-19 06:53:56,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 35 states have internal predecessors, (73), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-11-19 06:53:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 06:53:56,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:56,955 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:56,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 06:53:57,158 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-19 06:53:57,158 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:57,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:57,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1842624955, now seen corresponding path program 1 times [2024-11-19 06:53:57,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:57,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232416456] [2024-11-19 06:53:57,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:57,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:57,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:57,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232416456] [2024-11-19 06:53:57,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232416456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:57,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023755355] [2024-11-19 06:53:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:57,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:57,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:57,592 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-19 06:53:57,593 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-19 06:53:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:57,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-19 06:53:57,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:57,778 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:57,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:53:57,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:53:57,877 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:53:57,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-19 06:53:57,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:57,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2024-11-19 06:53:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:58,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:53:58,201 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1197 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_1197) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0))) is different from false [2024-11-19 06:53:58,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:58,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-19 06:53:58,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:58,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-19 06:53:58,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-19 06:53:58,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023755355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:58,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:53:58,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 35 [2024-11-19 06:53:58,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333256065] [2024-11-19 06:53:58,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:53:58,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 06:53:58,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:53:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 06:53:58,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1508, Unknown=12, NotChecked=78, Total=1722 [2024-11-19 06:53:58,315 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:53:58,734 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-19 06:53:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:53:58,735 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2024-11-19 06:53:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:53:58,735 INFO L225 Difference]: With dead ends: 75 [2024-11-19 06:53:58,735 INFO L226 Difference]: Without dead ends: 75 [2024-11-19 06:53:58,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=2526, Unknown=13, NotChecked=102, Total=2862 [2024-11-19 06:53:58,736 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:53:58,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 510 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:53:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-19 06:53:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2024-11-19 06:53:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:53:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-19 06:53:58,739 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 43 [2024-11-19 06:53:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:53:58,739 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-19 06:53:58,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 30 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:53:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-19 06:53:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:53:58,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:53:58,739 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:53:58,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 06:53:58,940 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-19 06:53:58,940 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:53:58,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:53:58,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1234605335, now seen corresponding path program 1 times [2024-11-19 06:53:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:53:58,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145885521] [2024-11-19 06:53:58,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:53:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:59,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:53:59,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145885521] [2024-11-19 06:53:59,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145885521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:53:59,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519249460] [2024-11-19 06:53:59,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:53:59,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:53:59,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:53:59,416 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-19 06:53:59,417 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-19 06:53:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:53:59,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 06:53:59,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:53:59,636 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:53:59,636 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-19 06:53:59,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:53:59,726 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:53:59,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 06:53:59,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:53:59,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-19 06:53:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:53:59,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:54:00,045 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_1288) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2024-11-19 06:54:00,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:00,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-19 06:54:00,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:00,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2024-11-19 06:54:00,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 06:54:00,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519249460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:54:00,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:54:00,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 34 [2024-11-19 06:54:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976315355] [2024-11-19 06:54:00,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:54:00,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 06:54:00,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:00,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 06:54:00,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1493, Unknown=27, NotChecked=78, Total=1722 [2024-11-19 06:54:00,143 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:54:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:54:00,648 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-11-19 06:54:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:54:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2024-11-19 06:54:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:54:00,648 INFO L225 Difference]: With dead ends: 74 [2024-11-19 06:54:00,648 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 06:54:00,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=2514, Unknown=29, NotChecked=102, Total=2862 [2024-11-19 06:54:00,650 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:54:00,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 537 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:54:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 06:54:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-11-19 06:54:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:54:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-19 06:54:00,652 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 45 [2024-11-19 06:54:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:54:00,652 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-19 06:54:00,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:54:00,652 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-19 06:54:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 06:54:00,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:54:00,652 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:54:00,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 06:54:00,853 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-19 06:54:00,853 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:54:00,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:54:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1972490914, now seen corresponding path program 2 times [2024-11-19 06:54:00,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:54:00,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795078074] [2024-11-19 06:54:00,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:54:00,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:54:00,872 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:54:00,872 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:54:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:01,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:54:01,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795078074] [2024-11-19 06:54:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795078074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:54:01,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531111026] [2024-11-19 06:54:01,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:54:01,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:54:01,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:54:01,696 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-19 06:54:01,697 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-19 06:54:01,821 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:54:01,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:54:01,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-11-19 06:54:01,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:54:01,830 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-19 06:54:01,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:54:01,990 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-19 06:54:01,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-11-19 06:54:02,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:54:02,193 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:54:02,193 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-19 06:54:02,202 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 06:54:02,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-19 06:54:02,269 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-19 06:54:02,288 INFO L349 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2024-11-19 06:54:02,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 45 [2024-11-19 06:54:02,647 INFO L349 Elim1Store]: treesize reduction 400, result has 12.9 percent of original size [2024-11-19 06:54:02,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 234 treesize of output 202 [2024-11-19 06:54:02,722 INFO L349 Elim1Store]: treesize reduction 372, result has 13.7 percent of original size [2024-11-19 06:54:02,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 234 treesize of output 223 [2024-11-19 06:54:04,783 INFO L349 Elim1Store]: treesize reduction 184, result has 59.6 percent of original size [2024-11-19 06:54:04,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 163 treesize of output 361 [2024-11-19 06:54:04,881 INFO L349 Elim1Store]: treesize reduction 28, result has 74.3 percent of original size [2024-11-19 06:54:04,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 137 [2024-11-19 06:54:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:54:51,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:54:52,739 INFO L349 Elim1Store]: treesize reduction 576, result has 28.6 percent of original size [2024-11-19 06:54:52,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 762 treesize of output 887 [2024-11-19 06:54:52,820 INFO L349 Elim1Store]: treesize reduction 444, result has 30.6 percent of original size [2024-11-19 06:54:52,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 771 treesize of output 880 [2024-11-19 06:54:52,866 INFO L349 Elim1Store]: treesize reduction 64, result has 53.3 percent of original size [2024-11-19 06:54:52,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 907 treesize of output 859 [2024-11-19 06:54:53,140 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 314 treesize of output 312 [2024-11-19 06:54:53,349 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 410 treesize of output 404 [2024-11-19 06:54:53,407 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 28 [2024-11-19 06:54:54,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:54:54,251 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 2078 treesize of output 2032 [2024-11-19 06:54:59,266 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse26 (= |c_ULTIMATE.start_create_~now~0#1.offset| 0))) (let ((.cse7 (not .cse26)) (.cse6 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse5)) (.cse1 (select (store .cse4 |c_ULTIMATE.start_create_~now~0#1.base| .cse5) |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (or (forall ((v_prenex_36 Int)) (= |c_ULTIMATE.start_create_~now~0#1.base| (select (select (store .cse0 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse1 v_prenex_36 |c_ULTIMATE.start_create_~data#1.base|)) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_37 Int)) (let ((.cse3 (store .cse0 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse1 v_prenex_37 |c_ULTIMATE.start_create_~data#1.base|)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (< 0 v_prenex_37) (= .cse2 0) (= (select (select .cse3 .cse2) 8) 0)))))))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (= |v_ULTIMATE.start_create_#t~ret6#1.base_50| |c_ULTIMATE.start_create_~now~0#1.base|) (forall ((v_prenex_27 Int)) (let ((.cse8 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse9 (store (select .cse10 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse9) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse10 |c_ULTIMATE.start_create_~now~0#1.base| .cse9) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_27 |c_ULTIMATE.start_create_~data#1.base|)))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (not (= .cse8 |c_ULTIMATE.start_create_~now~0#1.base|)) (< 0 (+ v_prenex_27 1)) (= .cse8 0)))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (let ((.cse15 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse16 (store (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (let ((.cse13 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse16)) (.cse14 (select (store .cse15 |c_ULTIMATE.start_create_~now~0#1.base| .cse16) |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_32 Int)) (let ((.cse12 (store .cse13 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse14 v_prenex_32 |c_ULTIMATE.start_create_~data#1.base|)))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= .cse11 0) (< 0 v_prenex_32) (= (select (select .cse12 .cse11) 8) 0))))) (= |v_ULTIMATE.start_create_#t~ret6#1.base_50| |c_ULTIMATE.start_create_~now~0#1.base|) (forall ((v_prenex_31 Int)) (not (= (select (select (store .cse13 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse14 v_prenex_31 |c_ULTIMATE.start_create_~data#1.base|)) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_ULTIMATE.start_create_~now~0#1.base|)))))))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (forall ((v_prenex_33 Int)) (let ((.cse17 (select (select (let ((.cse19 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse18 (store (select .cse19 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse18) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse19 |c_ULTIMATE.start_create_~now~0#1.base| .cse18) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_33 |c_ULTIMATE.start_create_~data#1.base|)))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= .cse17 |c_ULTIMATE.start_create_~now~0#1.base|) (= .cse17 0) (= .cse17 |v_ULTIMATE.start_create_#t~ret6#1.base_50|) (< 0 v_prenex_33)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)))) (or (and (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (= |v_ULTIMATE.start_create_#t~ret6#1.base_50| |c_ULTIMATE.start_create_~now~0#1.base|) (forall ((v_prenex_30 Int)) (let ((.cse20 (select (select (let ((.cse22 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse21 (store (select .cse22 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse21) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse22 |c_ULTIMATE.start_create_~now~0#1.base| .cse21) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_30 |c_ULTIMATE.start_create_~data#1.base|)))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= .cse20 |v_ULTIMATE.start_create_#t~ret6#1.base_50|) (= .cse20 0) (< 0 v_prenex_30)))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (= |v_ULTIMATE.start_create_#t~ret6#1.base_50| |c_ULTIMATE.start_create_~now~0#1.base|) (forall ((v_prenex_28 Int)) (let ((.cse23 (select (select (let ((.cse25 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse24 (store (select .cse25 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse24) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse25 |c_ULTIMATE.start_create_~now~0#1.base| .cse24) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_28 |c_ULTIMATE.start_create_~data#1.base|)))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (< 0 v_prenex_28) (= .cse23 0) (not (= .cse23 |c_ULTIMATE.start_create_~now~0#1.base|)))))))) .cse26) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (= |v_ULTIMATE.start_create_#t~ret6#1.base_50| |c_ULTIMATE.start_create_~now~0#1.base|) (forall ((v_prenex_28 Int)) (let ((.cse27 (select (select (let ((.cse29 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse28 (store (select .cse29 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse28) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse29 |c_ULTIMATE.start_create_~now~0#1.base| .cse28) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_28 |c_ULTIMATE.start_create_~data#1.base|)))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= .cse27 0) (not (= .cse27 |c_ULTIMATE.start_create_~now~0#1.base|)) (< 0 (+ v_prenex_28 1))))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (let ((.cse34 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse35 (store (select .cse34 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (let ((.cse32 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse35)) (.cse33 (select (store .cse34 |c_ULTIMATE.start_create_~now~0#1.base| .cse35) |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (or (forall ((v_prenex_29 Int)) (let ((.cse30 (store .cse32 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse33 v_prenex_29 |c_ULTIMATE.start_create_~data#1.base|)))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= (select (select .cse30 .cse31) 8) 0) (< 0 v_prenex_29) (= .cse31 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_26 Int)) (not (= (select (select (store .cse32 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse33 v_prenex_26 |c_ULTIMATE.start_create_~data#1.base|)) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_ULTIMATE.start_create_~now~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_35 Int)) (let ((.cse36 (let ((.cse39 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse38 (store (select .cse39 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse38) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse39 |c_ULTIMATE.start_create_~now~0#1.base| .cse38) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_35 |c_ULTIMATE.start_create_~data#1.base|)))))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (< 0 v_prenex_35) (= (select (select .cse36 .cse37) 8) 0) (= .cse37 0))))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (let ((.cse45 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse46 (store (select .cse45 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (let ((.cse42 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse46)) (.cse43 (select (store .cse45 |c_ULTIMATE.start_create_~now~0#1.base| .cse46) |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((|v_ULTIMATE.start_create_#t~mem7#1.offset_31| Int)) (let ((.cse40 (store .cse42 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse43 |v_ULTIMATE.start_create_#t~mem7#1.offset_31| |c_ULTIMATE.start_create_~data#1.base|)))) (let ((.cse41 (select (select .cse40 |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= (select (select .cse40 .cse41) 8) 0) (< 0 |v_ULTIMATE.start_create_#t~mem7#1.offset_31|) (= .cse41 0))))) (forall ((v_prenex_11 Int)) (let ((.cse44 (select (select (store .cse42 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse43 v_prenex_11 |c_ULTIMATE.start_create_~data#1.base|)) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (not (= |v_ULTIMATE.start_create_#t~ret6#1.base_50| .cse44)) (not (= |c_ULTIMATE.start_create_~now~0#1.base| .cse44)))))))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (let ((.cse51 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse52 (store (select .cse51 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (let ((.cse49 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse52)) (.cse50 (select (store .cse51 |c_ULTIMATE.start_create_~now~0#1.base| .cse52) |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_32 Int)) (let ((.cse48 (store .cse49 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse50 v_prenex_32 |c_ULTIMATE.start_create_~data#1.base|)))) (let ((.cse47 (select (select .cse48 |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= .cse47 0) (< 0 v_prenex_32) (= (select (select .cse48 .cse47) 8) 0))))) (forall ((v_prenex_31 Int)) (not (= (select (select (store .cse49 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse50 v_prenex_31 |c_ULTIMATE.start_create_~data#1.base|)) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_ULTIMATE.start_create_~now~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_33 Int)) (let ((.cse53 (select (select (let ((.cse55 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse54 (store (select .cse55 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse54) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse55 |c_ULTIMATE.start_create_~now~0#1.base| .cse54) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_33 |c_ULTIMATE.start_create_~data#1.base|)))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= .cse53 |v_ULTIMATE.start_create_#t~ret6#1.base_50|) (= .cse53 |c_ULTIMATE.start_create_~now~0#1.base|) (< 0 v_prenex_33) (= .cse53 0)))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (let ((.cse60 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse61 (store (select .cse60 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (let ((.cse56 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse61)) (.cse57 (select (store .cse60 |c_ULTIMATE.start_create_~now~0#1.base| .cse61) |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (or (forall ((v_prenex_36 Int)) (= (select (select (store .cse56 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse57 v_prenex_36 |c_ULTIMATE.start_create_~data#1.base|)) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_ULTIMATE.start_create_~now~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_37 Int)) (let ((.cse59 (store .cse56 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse57 v_prenex_37 |c_ULTIMATE.start_create_~data#1.base|)))) (let ((.cse58 (select (select .cse59 |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (< 0 v_prenex_37) (= .cse58 0) (= (select (select .cse59 .cse58) 8) 0)))))))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_35 Int)) (let ((.cse62 (let ((.cse65 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse64 (store (select .cse65 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse64) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse65 |c_ULTIMATE.start_create_~now~0#1.base| .cse64) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_35 |c_ULTIMATE.start_create_~data#1.base|)))))) (let ((.cse63 (select (select .cse62 |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (< 0 v_prenex_35) (= (select (select .cse62 .cse63) 8) 0) (= .cse63 0))))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (forall ((v_prenex_28 Int)) (let ((.cse66 (select (select (let ((.cse68 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse67 (store (select .cse68 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse67) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse68 |c_ULTIMATE.start_create_~now~0#1.base| .cse67) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_28 |c_ULTIMATE.start_create_~data#1.base|)))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= 0 .cse66) (not (= |c_ULTIMATE.start_create_~now~0#1.base| .cse66)) (< 0 (+ v_prenex_28 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (= |v_ULTIMATE.start_create_#t~ret6#1.base_50| |c_ULTIMATE.start_create_~now~0#1.base|))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_27 Int)) (let ((.cse69 (select (select (let ((.cse71 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse70 (store (select .cse71 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse70) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse71 |c_ULTIMATE.start_create_~now~0#1.base| .cse70) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_27 |c_ULTIMATE.start_create_~data#1.base|)))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (not (= .cse69 |c_ULTIMATE.start_create_~now~0#1.base|)) (< 0 (+ v_prenex_27 1)) (= .cse69 0)))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_30 Int)) (let ((.cse72 (select (select (let ((.cse74 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse73 (store (select .cse74 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse73) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse74 |c_ULTIMATE.start_create_~now~0#1.base| .cse73) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_30 |c_ULTIMATE.start_create_~data#1.base|)))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= .cse72 |v_ULTIMATE.start_create_#t~ret6#1.base_50|) (= .cse72 0) (< 0 (+ v_prenex_30 1))))) (= |v_ULTIMATE.start_create_#t~ret6#1.base_50| |c_ULTIMATE.start_create_~now~0#1.base|))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (let ((.cse79 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse80 (store (select .cse79 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (let ((.cse77 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse80)) (.cse78 (select (store .cse79 |c_ULTIMATE.start_create_~now~0#1.base| .cse80) |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (or (forall ((v_prenex_29 Int)) (let ((.cse76 (store .cse77 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse78 v_prenex_29 |c_ULTIMATE.start_create_~data#1.base|)))) (let ((.cse75 (select (select .cse76 |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= .cse75 0) (= (select (select .cse76 .cse75) 8) 0) (< 0 v_prenex_29))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_26 Int)) (not (= (select (select (store .cse77 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse78 v_prenex_26 |c_ULTIMATE.start_create_~data#1.base|)) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_ULTIMATE.start_create_~now~0#1.base|)))))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (forall ((v_prenex_38 Int)) (let ((.cse81 (select (select (let ((.cse83 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse82 (store (select .cse83 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse82) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse83 |c_ULTIMATE.start_create_~now~0#1.base| .cse82) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_38 |c_ULTIMATE.start_create_~data#1.base|)))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (< 0 (+ v_prenex_38 1)) (= .cse81 0) (not (= |c_ULTIMATE.start_create_~now~0#1.base| .cse81)) (not (= |v_ULTIMATE.start_create_#t~ret6#1.base_50| .cse81))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)))))) (or .cse7 (forall ((v_prenex_32 Int) (|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int) (v_prenex_31 Int)) (let ((.cse88 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse89 (store (select .cse88 |c_ULTIMATE.start_create_~now~0#1.base|) 8 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (let ((.cse85 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse89)) (.cse86 (select (store .cse88 |c_ULTIMATE.start_create_~now~0#1.base| .cse89) |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (let ((.cse87 (store .cse85 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse86 v_prenex_32 |c_ULTIMATE.start_create_~data#1.base|)))) (let ((.cse84 (select (select .cse87 |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= .cse84 0) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (not (= (select (select (store .cse85 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse86 v_prenex_31 |c_ULTIMATE.start_create_~data#1.base|)) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_ULTIMATE.start_create_~now~0#1.base|)) (< 0 v_prenex_32) (= (select (select .cse87 .cse84) 8) 0))))))))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (or (forall ((v_prenex_30 Int)) (let ((.cse90 (select (select (let ((.cse92 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse91 (store (select .cse92 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse91) |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select (store .cse92 |c_ULTIMATE.start_create_~now~0#1.base| .cse91) |v_ULTIMATE.start_create_#t~ret6#1.base_50|) v_prenex_30 |c_ULTIMATE.start_create_~data#1.base|)))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= .cse90 |v_ULTIMATE.start_create_#t~ret6#1.base_50|) (= .cse90 0) (< 0 (+ v_prenex_30 1))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (= |v_ULTIMATE.start_create_#t~ret6#1.base_50| |c_ULTIMATE.start_create_~now~0#1.base|))) (forall ((|v_ULTIMATE.start_create_#t~ret6#1.base_50| Int)) (let ((.cse98 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 8 0)))) (let ((.cse99 (store (select .cse98 |c_ULTIMATE.start_create_~now~0#1.base|) .cse6 |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (let ((.cse94 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base| .cse99)) (.cse95 (select (store .cse98 |c_ULTIMATE.start_create_~now~0#1.base| .cse99) |v_ULTIMATE.start_create_#t~ret6#1.base_50|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_50|) 0)) (forall ((v_prenex_11 Int)) (let ((.cse93 (select (select (store .cse94 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse95 v_prenex_11 |c_ULTIMATE.start_create_~data#1.base|)) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (not (= .cse93 |v_ULTIMATE.start_create_#t~ret6#1.base_50|)) (not (= .cse93 |c_ULTIMATE.start_create_~now~0#1.base|))))) (forall ((|v_ULTIMATE.start_create_#t~mem7#1.offset_31| Int)) (let ((.cse97 (store .cse94 |v_ULTIMATE.start_create_#t~ret6#1.base_50| (store .cse95 |v_ULTIMATE.start_create_#t~mem7#1.offset_31| |c_ULTIMATE.start_create_~data#1.base|)))) (let ((.cse96 (select (select .cse97 |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) (or (= .cse96 0) (< 0 |v_ULTIMATE.start_create_#t~mem7#1.offset_31|) (= (select (select .cse97 .cse96) 8) 0))))))))))))) (< 0 |c_ULTIMATE.start_create_~sll~0#1.offset|)) is different from true [2024-11-19 06:54:59,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531111026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:54:59,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:54:59,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 49 [2024-11-19 06:54:59,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233503786] [2024-11-19 06:54:59,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:54:59,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-19 06:54:59,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:54:59,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-19 06:54:59,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3373, Unknown=2, NotChecked=116, Total=3660 [2024-11-19 06:54:59,273 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 43 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:55:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:02,345 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2024-11-19 06:55:02,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 06:55:02,346 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 43 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2024-11-19 06:55:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:02,346 INFO L225 Difference]: With dead ends: 76 [2024-11-19 06:55:02,346 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 06:55:02,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=326, Invalid=5993, Unknown=5, NotChecked=156, Total=6480 [2024-11-19 06:55:02,348 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 12 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:02,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 763 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1452 Invalid, 6 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 06:55:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 06:55:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2024-11-19 06:55:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 70 states have internal predecessors, (76), 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-19 06:55:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2024-11-19 06:55:02,350 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 48 [2024-11-19 06:55:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:02,351 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2024-11-19 06:55:02,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 43 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:55:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-19 06:55:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 06:55:02,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:02,351 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:02,365 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-19 06:55:02,555 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-19 06:55:02,556 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:55:02,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1017674720, now seen corresponding path program 2 times [2024-11-19 06:55:02,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:02,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91633862] [2024-11-19 06:55:02,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:55:02,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:02,579 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:55:02,579 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:55:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:55:03,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91633862] [2024-11-19 06:55:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91633862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244068871] [2024-11-19 06:55:03,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:55:03,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:03,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:03,526 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-19 06:55:03,527 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-19 06:55:03,644 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:55:03,644 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:55:03,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-19 06:55:03,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:03,827 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-19 06:55:03,931 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:55:03,931 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 53 treesize of output 52 [2024-11-19 06:55:04,090 INFO L349 Elim1Store]: treesize reduction 49, result has 29.0 percent of original size [2024-11-19 06:55:04,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 76 [2024-11-19 06:55:04,197 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 60 treesize of output 30 [2024-11-19 06:55:04,696 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~l#1.base_35| Int) (|v_ULTIMATE.start_destroy_~l#1.base_36| Int) (|v_ULTIMATE.start_main_~data~0#1.base_16| Int) (v_DerPreprocessor_2 Int)) (let ((.cse1 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_36| v_DerPreprocessor_2) |v_ULTIMATE.start_main_~data~0#1.base_16| 0) |v_ULTIMATE.start_destroy_~l#1.base_35| 0) |v_ULTIMATE.start_destroy_~l#1.base_36|))) (let ((.cse0 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_36| .cse1) |v_ULTIMATE.start_destroy_~l#1.base_35| 1) |v_ULTIMATE.start_main_~data~0#1.base_16| 0))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_16| 0) |v_ULTIMATE.start_destroy_~l#1.base_35| 0) |v_ULTIMATE.start_destroy_~l#1.base_36| 0)) (= (select .cse0 |v_ULTIMATE.start_destroy_~l#1.base_35|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_36|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_35|) 0) (not (= |v_ULTIMATE.start_destroy_~l#1.base_36| |v_ULTIMATE.start_main_~data~0#1.base_16|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_16|) 0) (= (select .cse0 |v_ULTIMATE.start_destroy_~l#1.base_36|) .cse1))))) is different from true [2024-11-19 06:55:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-19 06:55:04,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:04,927 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1486 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base| 0) |c_ULTIMATE.start_create_~sll~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1486) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) 0))) is different from false [2024-11-19 06:55:04,932 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1486 (Array Int Int))) (= (store (store (store |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base| 0) |c_ULTIMATE.start_create_~sll~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_1486) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-19 06:55:04,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:04,940 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 35 treesize of output 36 [2024-11-19 06:55:04,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:55:04,946 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 62 treesize of output 61 [2024-11-19 06:55:04,948 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 24 treesize of output 20 [2024-11-19 06:55:08,986 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (store (store |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base| 0) |c_ULTIMATE.start_create_~sll~0#1.base| 0))) (let ((.cse0 (forall ((v_arrayElimCell_140 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_138 Int)) (let ((.cse8 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse8 (select (store .cse3 v_arrayElimCell_140 0) v_antiDerIndex_entry0_1)) (= .cse8 (select (store .cse3 v_arrayElimCell_138 0) v_antiDerIndex_entry0_1)))))) (.cse2 (= |c_ULTIMATE.start_create_~sll~0#1.base| |c_ULTIMATE.start_create_#t~ret6#1.base|)) (.cse1 (= |c_ULTIMATE.start_create_~sll~0#1.offset| |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse6 (= |c_ULTIMATE.start_create_~sll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|)) (.cse5 (store .cse3 |c_ULTIMATE.start_create_#t~ret6#1.base| 0))) (and (or .cse0 .cse1) (or (not .cse2) (forall ((v_arrayElimCell_140 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse3 v_arrayElimCell_140 0) v_antiDerIndex_entry0_1)))) (forall ((v_arrayElimCell_140 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse4 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse4 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse4 (select (store .cse3 v_arrayElimCell_140 0) v_antiDerIndex_entry0_1))))) (or .cse6 .cse0) (or .cse2 (let ((.cse7 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_138 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse3 v_arrayElimCell_138 0) v_antiDerIndex_entry0_1))))) (and (or .cse7 .cse1) (or .cse6 .cse7) (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse5 v_antiDerIndex_entry0_1))))))))) is different from false [2024-11-19 06:55:09,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244068871] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:09,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:55:09,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 37 [2024-11-19 06:55:09,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945708287] [2024-11-19 06:55:09,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:09,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 06:55:09,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:09,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 06:55:09,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1776, Unknown=4, NotChecked=348, Total=2256 [2024-11-19 06:55:09,226 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 33 states have internal predecessors, (85), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:55:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:10,082 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-19 06:55:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 06:55:10,083 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 33 states have internal predecessors, (85), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2024-11-19 06:55:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:10,083 INFO L225 Difference]: With dead ends: 78 [2024-11-19 06:55:10,083 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 06:55:10,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=170, Invalid=2292, Unknown=4, NotChecked=396, Total=2862 [2024-11-19 06:55:10,084 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:10,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 393 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 878 Invalid, 0 Unknown, 74 Unchecked, 0.6s Time] [2024-11-19 06:55:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 06:55:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-11-19 06:55:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1875) internal successors, (57), 52 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:55:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2024-11-19 06:55:10,086 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 49 [2024-11-19 06:55:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:10,086 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2024-11-19 06:55:10,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 33 states have internal predecessors, (85), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 06:55:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2024-11-19 06:55:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 06:55:10,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:10,087 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:10,102 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-19 06:55:10,287 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-19 06:55:10,288 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:55:10,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash -37651316, now seen corresponding path program 2 times [2024-11-19 06:55:10,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:10,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268622390] [2024-11-19 06:55:10,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:55:10,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:10,316 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:55:10,316 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:55:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:55:10,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:10,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268622390] [2024-11-19 06:55:10,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268622390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:10,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955079332] [2024-11-19 06:55:10,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:55:10,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:10,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:10,553 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-19 06:55:10,554 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-19 06:55:10,677 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:55:10,677 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:55:10,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 06:55:10,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:10,682 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-19 06:55:10,703 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:55:10,703 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-19 06:55:10,741 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-19 06:55:10,759 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:55:10,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:55:10,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:55:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2024-11-19 06:55:10,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:10,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955079332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:10,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:55:10,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2024-11-19 06:55:10,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708710445] [2024-11-19 06:55:10,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:10,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:55:10,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:10,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:55:10,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2024-11-19 06:55:10,879 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:55:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:55:11,078 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-11-19 06:55:11,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:55:11,078 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 51 [2024-11-19 06:55:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:55:11,079 INFO L225 Difference]: With dead ends: 57 [2024-11-19 06:55:11,079 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 06:55:11,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=474, Unknown=1, NotChecked=44, Total=600 [2024-11-19 06:55:11,080 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 55 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:55:11,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 171 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 315 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2024-11-19 06:55:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 06:55:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-19 06:55:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 52 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:55:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-11-19 06:55:11,082 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 51 [2024-11-19 06:55:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:55:11,082 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-11-19 06:55:11,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 06:55:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-11-19 06:55:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 06:55:11,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:55:11,083 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:55:11,096 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-19 06:55:11,283 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-19 06:55:11,284 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2024-11-19 06:55:11,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:55:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash -37651315, now seen corresponding path program 2 times [2024-11-19 06:55:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:55:11,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394799540] [2024-11-19 06:55:11,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:55:11,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:55:11,300 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:55:11,300 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:55:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:55:11,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:55:11,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394799540] [2024-11-19 06:55:11,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394799540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:11,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578148406] [2024-11-19 06:55:11,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:55:11,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:55:11,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:55:11,596 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-19 06:55:11,596 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-19 06:55:11,721 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:55:11,721 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:55:11,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 06:55:11,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:55:11,873 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:55:11,873 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 16 treesize of output 15 [2024-11-19 06:55:11,881 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:55:11,881 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-19 06:55:11,903 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-19 06:55:11,930 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 10 treesize of output 4 [2024-11-19 06:55:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:55:12,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:55:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578148406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:55:12,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:55:12,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-11-19 06:55:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663407123] [2024-11-19 06:55:12,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:55:12,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 06:55:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:55:12,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 06:55:12,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 06:55:12,208 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 28 states, 27 states have (on average 2.962962962962963) internal successors, (80), 24 states have internal predecessors, (80), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6)