./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-middle-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-middle-shared.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 003ead3201cb38ecc17dca4c0dd7fb7b12eace11010ba9f6077aefef97bddb9b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:55:34,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:55:34,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:55:34,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:55:34,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:55:34,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:55:34,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:55:34,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:55:34,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:55:34,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:55:34,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:55:34,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:55:34,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:55:34,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:55:34,303 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:55:34,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:55:34,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:55:34,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:55:34,304 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:55:34,304 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:55:34,305 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:55:34,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:55:34,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:55:34,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:55:34,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:55:34,306 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:55:34,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:55:34,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:55:34,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:55:34,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:55:34,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:55:34,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:55:34,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:55:34,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:55:34,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:55:34,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:55:34,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:55:34,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:55:34,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:55:34,309 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 -> 003ead3201cb38ecc17dca4c0dd7fb7b12eace11010ba9f6077aefef97bddb9b [2024-11-09 07:55:34,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:55:34,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:55:34,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:55:34,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:55:34,541 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:55:34,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-middle-shared.i [2024-11-09 07:55:35,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:55:36,013 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:55:36,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-middle-shared.i [2024-11-09 07:55:36,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dfddacc7/9c7dec189bae4ef4ae0387eef41539d4/FLAG70fbed43d [2024-11-09 07:55:36,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dfddacc7/9c7dec189bae4ef4ae0387eef41539d4 [2024-11-09 07:55:36,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:55:36,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:55:36,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:55:36,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:55:36,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:55:36,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59320863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36, skipping insertion in model container [2024-11-09 07:55:36,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:55:36,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:55:36,724 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:55:36,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:55:36,798 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:55:36,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36 WrapperNode [2024-11-09 07:55:36,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:55:36,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:55:36,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:55:36,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:55:36,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,838 INFO L138 Inliner]: procedures = 121, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 95 [2024-11-09 07:55:36,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:55:36,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:55:36,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:55:36,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:55:36,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,870 INFO L175 MemorySlicer]: Split 17 memory accesses to 1 slices as follows [17]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 8 writes are split as follows [8]. [2024-11-09 07:55:36,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:55:36,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:55:36,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:55:36,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:55:36,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (1/1) ... [2024-11-09 07:55:36,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:55:36,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:36,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:55:36,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:55:36,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:55:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-09 07:55:36,969 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-09 07:55:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:55:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:55:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:55:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:55:36,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:55:36,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:55:37,088 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:55:37,090 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:55:37,373 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-11-09 07:55:37,373 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:55:37,386 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:55:37,386 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:55:37,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:55:37 BoogieIcfgContainer [2024-11-09 07:55:37,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:55:37,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:55:37,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:55:37,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:55:37,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:55:36" (1/3) ... [2024-11-09 07:55:37,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6f221d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:55:37, skipping insertion in model container [2024-11-09 07:55:37,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:36" (2/3) ... [2024-11-09 07:55:37,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6f221d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:55:37, skipping insertion in model container [2024-11-09 07:55:37,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:55:37" (3/3) ... [2024-11-09 07:55:37,398 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-middle-shared.i [2024-11-09 07:55:37,418 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:55:37,418 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-09 07:55:37,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:55:37,462 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;@21a3aa09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:55:37,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-09 07:55:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 97 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:55:37,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:37,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:55:37,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:37,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash 34543147, now seen corresponding path program 1 times [2024-11-09 07:55:37,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:37,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25412919] [2024-11-09 07:55:37,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:37,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25412919] [2024-11-09 07:55:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25412919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:37,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:37,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:55:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348511449] [2024-11-09 07:55:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:37,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:55:37,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:37,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:55:37,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:37,717 INFO L87 Difference]: Start difference. First operand has 101 states, 53 states have (on average 1.9622641509433962) internal successors, (104), 97 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:55:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:37,808 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2024-11-09 07:55:37,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:55:37,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:55:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:37,816 INFO L225 Difference]: With dead ends: 100 [2024-11-09 07:55:37,816 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 07:55:37,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:37,821 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:37,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 157 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 07:55:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 07:55:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 94 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2024-11-09 07:55:37,918 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 5 [2024-11-09 07:55:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:37,919 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2024-11-09 07:55:37,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:55:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2024-11-09 07:55:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:55:37,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:37,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:55:37,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:55:37,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:37,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash 34543148, now seen corresponding path program 1 times [2024-11-09 07:55:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:37,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031001551] [2024-11-09 07:55:37,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:37,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:38,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:38,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031001551] [2024-11-09 07:55:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031001551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:38,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:38,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:55:38,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950113197] [2024-11-09 07:55:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:38,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:55:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:38,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:55:38,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:38,037 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:55:38,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:38,132 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2024-11-09 07:55:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:55:38,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:55:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:38,134 INFO L225 Difference]: With dead ends: 97 [2024-11-09 07:55:38,134 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 07:55:38,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:38,135 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:38,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 07:55:38,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 07:55:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 93 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:38,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2024-11-09 07:55:38,145 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 5 [2024-11-09 07:55:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:38,146 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2024-11-09 07:55:38,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:55:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2024-11-09 07:55:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:55:38,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:38,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:38,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:55:38,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:38,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:38,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1042879868, now seen corresponding path program 1 times [2024-11-09 07:55:38,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:38,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658386428] [2024-11-09 07:55:38,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:38,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:38,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658386428] [2024-11-09 07:55:38,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658386428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:38,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:38,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:55:38,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862966726] [2024-11-09 07:55:38,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:38,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:55:38,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:38,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:55:38,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:38,252 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:38,380 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2024-11-09 07:55:38,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:55:38,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-09 07:55:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:38,383 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:55:38,383 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 07:55:38,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:38,386 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 15 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:38,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 176 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 07:55:38,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2024-11-09 07:55:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 92 states have internal predecessors, (96), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2024-11-09 07:55:38,396 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 10 [2024-11-09 07:55:38,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:38,397 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2024-11-09 07:55:38,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2024-11-09 07:55:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:55:38,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:38,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:38,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:55:38,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:38,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:38,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1042879867, now seen corresponding path program 1 times [2024-11-09 07:55:38,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:38,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200548487] [2024-11-09 07:55:38,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:38,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:38,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:38,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200548487] [2024-11-09 07:55:38,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200548487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:38,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:38,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:55:38,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231930297] [2024-11-09 07:55:38,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:38,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:55:38,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:38,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:55:38,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:38,526 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:38,634 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2024-11-09 07:55:38,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:55:38,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-09 07:55:38,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:38,636 INFO L225 Difference]: With dead ends: 100 [2024-11-09 07:55:38,636 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:55:38,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:38,637 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 15 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:38,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 184 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:55:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2024-11-09 07:55:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 91 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2024-11-09 07:55:38,642 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 10 [2024-11-09 07:55:38,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:38,642 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2024-11-09 07:55:38,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2024-11-09 07:55:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:55:38,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:38,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:38,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:55:38,643 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 41 more)] === [2024-11-09 07:55:38,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1480173691, now seen corresponding path program 1 times [2024-11-09 07:55:38,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:38,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270517122] [2024-11-09 07:55:38,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:38,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:38,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270517122] [2024-11-09 07:55:38,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270517122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:38,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:38,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:55:38,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339365417] [2024-11-09 07:55:38,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:38,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:55:38,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:38,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:55:38,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:38,724 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:38,808 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2024-11-09 07:55:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:55:38,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:55:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:38,809 INFO L225 Difference]: With dead ends: 99 [2024-11-09 07:55:38,809 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 07:55:38,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:38,810 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:38,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 177 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 07:55:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2024-11-09 07:55:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 90 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2024-11-09 07:55:38,815 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 12 [2024-11-09 07:55:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:38,815 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-09 07:55:38,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2024-11-09 07:55:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:55:38,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:38,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:38,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:55:38,817 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 41 more)] === [2024-11-09 07:55:38,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1480173690, now seen corresponding path program 1 times [2024-11-09 07:55:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:38,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822421160] [2024-11-09 07:55:38,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:38,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-09 07:55:38,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:38,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822421160] [2024-11-09 07:55:38,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822421160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:38,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:38,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:55:38,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644804804] [2024-11-09 07:55:38,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:38,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:55:38,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:38,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:55:38,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:38,917 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:39,092 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-09 07:55:39,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:55:39,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 07:55:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:39,093 INFO L225 Difference]: With dead ends: 98 [2024-11-09 07:55:39,093 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 07:55:39,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:39,094 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:39,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 185 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 07:55:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2024-11-09 07:55:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 89 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2024-11-09 07:55:39,103 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 12 [2024-11-09 07:55:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:39,104 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2024-11-09 07:55:39,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2024-11-09 07:55:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:55:39,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:39,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:39,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:55:39,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:39,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:39,105 INFO L85 PathProgramCache]: Analyzing trace with hash -812742458, now seen corresponding path program 1 times [2024-11-09 07:55:39,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:39,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121175105] [2024-11-09 07:55:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:39,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:39,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121175105] [2024-11-09 07:55:39,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121175105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:39,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:39,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:55:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818531092] [2024-11-09 07:55:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:39,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:39,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:39,308 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:39,465 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-11-09 07:55:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:55:39,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 14 [2024-11-09 07:55:39,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:39,466 INFO L225 Difference]: With dead ends: 93 [2024-11-09 07:55:39,467 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 07:55:39,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:39,468 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 17 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:39,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 311 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 07:55:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2024-11-09 07:55:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.6923076923076923) internal successors, (88), 84 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-11-09 07:55:39,475 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 14 [2024-11-09 07:55:39,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:39,475 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-11-09 07:55:39,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-11-09 07:55:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:55:39,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:39,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:39,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:55:39,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:39,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash -812742457, now seen corresponding path program 1 times [2024-11-09 07:55:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:39,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270149205] [2024-11-09 07:55:39,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:39,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:39,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:39,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270149205] [2024-11-09 07:55:39,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270149205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:39,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:39,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:55:39,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51678598] [2024-11-09 07:55:39,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:39,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:55:39,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:39,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:55:39,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:39,803 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:39,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:39,974 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-11-09 07:55:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:55:39,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 14 [2024-11-09 07:55:39,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:39,975 INFO L225 Difference]: With dead ends: 91 [2024-11-09 07:55:39,975 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 07:55:39,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:39,976 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 8 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:39,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 322 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:39,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 07:55:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2024-11-09 07:55:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-11-09 07:55:39,981 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 14 [2024-11-09 07:55:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:39,981 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-11-09 07:55:39,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-11-09 07:55:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:55:39,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:39,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:39,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:55:39,982 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:39,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2081078920, now seen corresponding path program 1 times [2024-11-09 07:55:39,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:39,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018547948] [2024-11-09 07:55:39,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:39,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:40,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:40,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018547948] [2024-11-09 07:55:40,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018547948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:40,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:40,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:55:40,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054658125] [2024-11-09 07:55:40,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:40,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:40,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:40,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:40,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:40,098 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:40,272 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-09 07:55:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:40,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-09 07:55:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:40,273 INFO L225 Difference]: With dead ends: 112 [2024-11-09 07:55:40,274 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 07:55:40,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:40,274 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 25 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:40,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 310 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 07:55:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2024-11-09 07:55:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 98 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2024-11-09 07:55:40,288 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 21 [2024-11-09 07:55:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:40,289 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2024-11-09 07:55:40,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2024-11-09 07:55:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:55:40,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:40,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:40,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:55:40,290 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:40,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2081078919, now seen corresponding path program 1 times [2024-11-09 07:55:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:40,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330238115] [2024-11-09 07:55:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:40,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:40,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:40,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330238115] [2024-11-09 07:55:40,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330238115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:40,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:40,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:55:40,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957227666] [2024-11-09 07:55:40,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:40,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:55:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:40,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:55:40,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:40,544 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:40,707 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2024-11-09 07:55:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:40,708 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-09 07:55:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:40,708 INFO L225 Difference]: With dead ends: 115 [2024-11-09 07:55:40,708 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 07:55:40,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:40,709 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 21 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:40,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 495 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:40,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 07:55:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2024-11-09 07:55:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.5897435897435896) internal successors, (124), 106 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2024-11-09 07:55:40,713 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 21 [2024-11-09 07:55:40,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:40,713 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2024-11-09 07:55:40,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2024-11-09 07:55:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:55:40,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:40,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:40,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:55:40,714 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:40,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:40,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1537875595, now seen corresponding path program 1 times [2024-11-09 07:55:40,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:40,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365788328] [2024-11-09 07:55:40,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:40,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:40,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365788328] [2024-11-09 07:55:40,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365788328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:40,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:40,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:55:40,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152754517] [2024-11-09 07:55:40,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:40,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:55:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:40,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:55:40,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:40,846 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:40,946 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2024-11-09 07:55:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:55:40,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-09 07:55:40,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:40,948 INFO L225 Difference]: With dead ends: 117 [2024-11-09 07:55:40,948 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 07:55:40,948 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-09 07:55:40,949 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 25 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:40,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 539 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 07:55:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2024-11-09 07:55:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 107 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2024-11-09 07:55:40,955 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 23 [2024-11-09 07:55:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:40,956 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2024-11-09 07:55:40,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2024-11-09 07:55:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:55:40,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:40,957 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:40,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:55:40,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:40,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:40,958 INFO L85 PathProgramCache]: Analyzing trace with hash 918504240, now seen corresponding path program 1 times [2024-11-09 07:55:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:40,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041304202] [2024-11-09 07:55:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:41,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 07:55:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:41,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:41,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041304202] [2024-11-09 07:55:41,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041304202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:41,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:41,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:55:41,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773516691] [2024-11-09 07:55:41,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:41,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:55:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:41,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:55:41,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:55:41,094 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:41,196 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2024-11-09 07:55:41,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:55:41,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-09 07:55:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:41,215 INFO L225 Difference]: With dead ends: 112 [2024-11-09 07:55:41,215 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 07:55:41,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:55:41,215 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 14 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:41,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 194 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:41,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 07:55:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 07:55:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 107 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2024-11-09 07:55:41,218 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 24 [2024-11-09 07:55:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:41,219 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2024-11-09 07:55:41,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2024-11-09 07:55:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:55:41,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:41,220 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:41,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:55:41,220 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:41,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash 918504241, now seen corresponding path program 1 times [2024-11-09 07:55:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:41,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107195639] [2024-11-09 07:55:41,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:41,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:41,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 07:55:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107195639] [2024-11-09 07:55:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107195639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147642329] [2024-11-09 07:55:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:41,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:41,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:41,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:41,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:55:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:41,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 07:55:41,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:41,705 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 07:55:41,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:55:41,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:55:41,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:55:41,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:55:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:41,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:55:41,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147642329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:41,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:55:41,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-11-09 07:55:41,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394664565] [2024-11-09 07:55:41,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:41,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:55:41,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:41,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:55:41,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-11-09 07:55:41,795 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:41,900 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2024-11-09 07:55:41,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:55:41,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2024-11-09 07:55:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:41,901 INFO L225 Difference]: With dead ends: 116 [2024-11-09 07:55:41,901 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 07:55:41,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=196, Unknown=1, NotChecked=28, Total=272 [2024-11-09 07:55:41,901 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 26 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:41,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 199 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 125 Unchecked, 0.1s Time] [2024-11-09 07:55:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 07:55:41,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2024-11-09 07:55:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 107 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-09 07:55:41,905 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 24 [2024-11-09 07:55:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:41,906 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-09 07:55:41,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-09 07:55:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:55:41,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:41,909 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:41,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:55:42,109 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,SelfDestructingSolverStorable12 [2024-11-09 07:55:42,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:42,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash -76820004, now seen corresponding path program 1 times [2024-11-09 07:55:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:42,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076647385] [2024-11-09 07:55:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:42,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:42,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:42,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 07:55:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:55:42,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:42,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076647385] [2024-11-09 07:55:42,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076647385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:42,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:42,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:55:42,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933252865] [2024-11-09 07:55:42,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:42,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:42,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:42,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:42,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:42,261 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:55:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:42,416 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2024-11-09 07:55:42,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:42,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-09 07:55:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:42,417 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:55:42,417 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:55:42,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:42,418 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 4 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:42,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 336 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:55:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 07:55:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 106 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2024-11-09 07:55:42,420 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 27 [2024-11-09 07:55:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:42,421 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2024-11-09 07:55:42,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:55:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2024-11-09 07:55:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:55:42,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:42,421 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:42,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:55:42,421 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:42,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash -76820003, now seen corresponding path program 1 times [2024-11-09 07:55:42,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:42,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607717390] [2024-11-09 07:55:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:42,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:42,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 07:55:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:42,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:42,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607717390] [2024-11-09 07:55:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607717390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:42,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:42,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:55:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604057516] [2024-11-09 07:55:42,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:42,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:42,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:42,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:42,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:55:42,653 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:55:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:42,810 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2024-11-09 07:55:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:42,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 27 [2024-11-09 07:55:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:42,812 INFO L225 Difference]: With dead ends: 110 [2024-11-09 07:55:42,812 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 07:55:42,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:42,812 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:42,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 360 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 07:55:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 07:55:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 105 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2024-11-09 07:55:42,815 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 27 [2024-11-09 07:55:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:42,816 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2024-11-09 07:55:42,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:55:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2024-11-09 07:55:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:55:42,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:42,817 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:42,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:55:42,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:42,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1002444452, now seen corresponding path program 1 times [2024-11-09 07:55:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:42,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284391720] [2024-11-09 07:55:42,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:42,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:43,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:43,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284391720] [2024-11-09 07:55:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284391720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:43,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005728102] [2024-11-09 07:55:43,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:43,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:43,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:43,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:43,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:55:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:43,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-09 07:55:43,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:43,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:55:43,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:55:43,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:55:43,774 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:55:43,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:55:43,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:55:43,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:55:43,874 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 07:55:43,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 07:55:43,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:55:43,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:55:43,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:55:44,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:55:44,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:44,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 37 treesize of output 24 [2024-11-09 07:55:44,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 07:55:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:44,184 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:45,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:45,395 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-09 07:55:45,403 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 140 treesize of output 122 [2024-11-09 07:55:45,409 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 28 treesize of output 20 [2024-11-09 07:55:45,413 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 17 treesize of output 13 [2024-11-09 07:55:45,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:45,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-09 07:55:45,446 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 70 treesize of output 58 [2024-11-09 07:55:45,450 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 46 treesize of output 38 [2024-11-09 07:55:45,455 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-09 07:55:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:45,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005728102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:55:45,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:55:45,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 39 [2024-11-09 07:55:45,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147380006] [2024-11-09 07:55:45,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:45,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 07:55:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 07:55:45,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1330, Unknown=21, NotChecked=0, Total=1482 [2024-11-09 07:55:45,559 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 35 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:55:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:46,456 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-11-09 07:55:46,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:55:46,456 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 35 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-09 07:55:46,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:46,457 INFO L225 Difference]: With dead ends: 112 [2024-11-09 07:55:46,457 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 07:55:46,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=197, Invalid=1761, Unknown=22, NotChecked=0, Total=1980 [2024-11-09 07:55:46,458 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 32 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:46,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1182 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:55:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 07:55:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 07:55:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 107 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2024-11-09 07:55:46,461 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 28 [2024-11-09 07:55:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:46,462 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2024-11-09 07:55:46,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 35 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:55:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2024-11-09 07:55:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:55:46,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:46,463 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:46,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:55:46,666 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,SelfDestructingSolverStorable15 [2024-11-09 07:55:46,667 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:46,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:46,668 INFO L85 PathProgramCache]: Analyzing trace with hash 672845527, now seen corresponding path program 1 times [2024-11-09 07:55:46,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:46,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019373315] [2024-11-09 07:55:46,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:46,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:46,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:46,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 07:55:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:46,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019373315] [2024-11-09 07:55:46,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019373315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:46,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:46,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:55:46,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805768261] [2024-11-09 07:55:46,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:46,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:55:46,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:46,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:55:46,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:46,903 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:47,099 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2024-11-09 07:55:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:55:47,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-09 07:55:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:47,100 INFO L225 Difference]: With dead ends: 113 [2024-11-09 07:55:47,100 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 07:55:47,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:55:47,101 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:47,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 535 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 07:55:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-09 07:55:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2024-11-09 07:55:47,105 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 30 [2024-11-09 07:55:47,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:47,105 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2024-11-09 07:55:47,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2024-11-09 07:55:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:55:47,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:47,106 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:47,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:55:47,106 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:47,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:47,106 INFO L85 PathProgramCache]: Analyzing trace with hash 672845528, now seen corresponding path program 1 times [2024-11-09 07:55:47,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:47,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528565448] [2024-11-09 07:55:47,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:47,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:47,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:47,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 07:55:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:47,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:47,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528565448] [2024-11-09 07:55:47,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528565448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:47,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:47,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:55:47,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575570656] [2024-11-09 07:55:47,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:47,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:55:47,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:47,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:55:47,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:47,421 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:47,662 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2024-11-09 07:55:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:47,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-09 07:55:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:47,664 INFO L225 Difference]: With dead ends: 112 [2024-11-09 07:55:47,664 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 07:55:47,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:55:47,665 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:47,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 475 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 07:55:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 07:55:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2024-11-09 07:55:47,668 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 30 [2024-11-09 07:55:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:47,668 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2024-11-09 07:55:47,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2024-11-09 07:55:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:55:47,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:47,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:47,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:55:47,670 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:47,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1276486289, now seen corresponding path program 1 times [2024-11-09 07:55:47,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:47,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913746712] [2024-11-09 07:55:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:47,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:47,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:47,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:47,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913746712] [2024-11-09 07:55:47,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913746712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:47,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:47,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:55:47,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376150098] [2024-11-09 07:55:47,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:47,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:55:47,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:47,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:55:47,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:47,779 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:47,971 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2024-11-09 07:55:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:55:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-09 07:55:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:47,973 INFO L225 Difference]: With dead ends: 128 [2024-11-09 07:55:47,973 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 07:55:47,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:55:47,974 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 44 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:47,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 271 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 07:55:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2024-11-09 07:55:47,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 118 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2024-11-09 07:55:47,977 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 30 [2024-11-09 07:55:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:47,978 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2024-11-09 07:55:47,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2024-11-09 07:55:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:55:47,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:47,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:47,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:55:47,979 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:47,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1276486288, now seen corresponding path program 1 times [2024-11-09 07:55:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:47,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733593868] [2024-11-09 07:55:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:47,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:48,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:48,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:48,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733593868] [2024-11-09 07:55:48,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733593868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:48,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349538673] [2024-11-09 07:55:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:48,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:48,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:48,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:48,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:55:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:48,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:55:48,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:48,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:48,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:48,582 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 15 treesize of output 19 [2024-11-09 07:55:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:48,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349538673] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:48,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:55:48,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 7] total 23 [2024-11-09 07:55:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166178587] [2024-11-09 07:55:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:48,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:48,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:55:48,644 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:48,817 INFO L93 Difference]: Finished difference Result 132 states and 156 transitions. [2024-11-09 07:55:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:48,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-09 07:55:48,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:48,819 INFO L225 Difference]: With dead ends: 132 [2024-11-09 07:55:48,819 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 07:55:48,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:55:48,820 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 31 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:48,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 293 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 07:55:48,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2024-11-09 07:55:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 96 states have (on average 1.4375) internal successors, (138), 121 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2024-11-09 07:55:48,824 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 30 [2024-11-09 07:55:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:48,824 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2024-11-09 07:55:48,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2024-11-09 07:55:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:55:48,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:48,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:48,839 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-09 07:55:49,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:49,029 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:49,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:49,029 INFO L85 PathProgramCache]: Analyzing trace with hash -916349114, now seen corresponding path program 1 times [2024-11-09 07:55:49,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:49,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425100024] [2024-11-09 07:55:49,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:49,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:49,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:49,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425100024] [2024-11-09 07:55:49,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425100024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:49,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:49,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:55:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754628217] [2024-11-09 07:55:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:49,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:55:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:49,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:55:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:49,130 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:49,251 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2024-11-09 07:55:49,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:49,251 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-09 07:55:49,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:49,252 INFO L225 Difference]: With dead ends: 131 [2024-11-09 07:55:49,252 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 07:55:49,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:49,253 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 43 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:49,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 474 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 07:55:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2024-11-09 07:55:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 120 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2024-11-09 07:55:49,255 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 31 [2024-11-09 07:55:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:49,255 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2024-11-09 07:55:49,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2024-11-09 07:55:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:55:49,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:49,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:49,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:55:49,256 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:49,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash -916369230, now seen corresponding path program 1 times [2024-11-09 07:55:49,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:49,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484271718] [2024-11-09 07:55:49,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:49,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:49,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:49,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484271718] [2024-11-09 07:55:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484271718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582180615] [2024-11-09 07:55:49,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:49,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:49,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:49,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:49,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:55:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:49,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:55:49,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:49,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:55:49,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:55:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:49,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:55:49,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582180615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:49,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:55:49,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2024-11-09 07:55:49,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080430225] [2024-11-09 07:55:49,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:49,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:55:49,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:49,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:55:49,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:49,581 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:49,726 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2024-11-09 07:55:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:49,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-09 07:55:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:49,727 INFO L225 Difference]: With dead ends: 141 [2024-11-09 07:55:49,727 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 07:55:49,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:55:49,727 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 32 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:49,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 410 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 07:55:49,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 126. [2024-11-09 07:55:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 121 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2024-11-09 07:55:49,730 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 31 [2024-11-09 07:55:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:49,732 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2024-11-09 07:55:49,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2024-11-09 07:55:49,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:55:49,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:49,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:49,745 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-09 07:55:49,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:49,937 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:49,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1657325071, now seen corresponding path program 1 times [2024-11-09 07:55:49,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:49,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554161080] [2024-11-09 07:55:49,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:50,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:50,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554161080] [2024-11-09 07:55:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554161080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:50,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781897938] [2024-11-09 07:55:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:50,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:50,189 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:50,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:55:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:50,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:55:50,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:50,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:55:50,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 07:55:50,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 07:55:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:50,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:55:50,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781897938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:50,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:55:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2024-11-09 07:55:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452008876] [2024-11-09 07:55:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:50,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:55:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:50,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:55:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:50,393 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:50,588 INFO L93 Difference]: Finished difference Result 140 states and 158 transitions. [2024-11-09 07:55:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:55:50,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 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 32 [2024-11-09 07:55:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:50,589 INFO L225 Difference]: With dead ends: 140 [2024-11-09 07:55:50,589 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 07:55:50,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:55:50,589 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 32 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:50,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 329 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 07:55:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-11-09 07:55:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 122 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2024-11-09 07:55:50,592 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 32 [2024-11-09 07:55:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:50,592 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2024-11-09 07:55:50,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2024-11-09 07:55:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:55:50,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:50,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:50,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:55:50,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 07:55:50,794 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:50,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:50,794 INFO L85 PathProgramCache]: Analyzing trace with hash -162530220, now seen corresponding path program 1 times [2024-11-09 07:55:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:50,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649331390] [2024-11-09 07:55:50,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:50,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:51,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:51,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649331390] [2024-11-09 07:55:51,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649331390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:51,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899088588] [2024-11-09 07:55:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:51,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:51,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:51,073 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:51,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:55:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:51,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 07:55:51,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:51,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:55:51,218 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:55:51,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:55:51,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:55:51,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 07:55:51,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 07:55:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:51,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:55:51,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899088588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:51,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:55:51,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 12 [2024-11-09 07:55:51,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994571783] [2024-11-09 07:55:51,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:51,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:55:51,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:51,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:55:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:55:51,287 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:51,470 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2024-11-09 07:55:51,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:51,471 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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 33 [2024-11-09 07:55:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:51,471 INFO L225 Difference]: With dead ends: 128 [2024-11-09 07:55:51,471 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 07:55:51,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:55:51,472 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 11 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:51,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 352 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 07:55:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 07:55:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 123 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2024-11-09 07:55:51,475 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 33 [2024-11-09 07:55:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:51,475 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2024-11-09 07:55:51,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2024-11-09 07:55:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:55:51,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:51,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:51,493 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-09 07:55:51,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:51,680 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:51,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash -743469390, now seen corresponding path program 1 times [2024-11-09 07:55:51,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:51,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953239184] [2024-11-09 07:55:51,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:51,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:51,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953239184] [2024-11-09 07:55:51,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953239184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:51,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155047994] [2024-11-09 07:55:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:51,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:51,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:51,954 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:51,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:55:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 07:55:52,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:52,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:55:52,097 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:55:52,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:55:52,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:55:52,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-09 07:55:52,220 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 16 treesize of output 8 [2024-11-09 07:55:52,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:55:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:52,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:55:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155047994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:52,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:55:52,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 19 [2024-11-09 07:55:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101293960] [2024-11-09 07:55:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:52,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:55:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:52,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:55:52,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:55:52,236 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:52,456 INFO L93 Difference]: Finished difference Result 139 states and 156 transitions. [2024-11-09 07:55:52,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:55:52,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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 34 [2024-11-09 07:55:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:52,457 INFO L225 Difference]: With dead ends: 139 [2024-11-09 07:55:52,457 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 07:55:52,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:55:52,458 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 53 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:52,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 437 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 07:55:52,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2024-11-09 07:55:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 124 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2024-11-09 07:55:52,461 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 34 [2024-11-09 07:55:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:52,462 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2024-11-09 07:55:52,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2024-11-09 07:55:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:55:52,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:52,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:52,476 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-09 07:55:52,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:52,663 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:52,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash -743469389, now seen corresponding path program 1 times [2024-11-09 07:55:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:52,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713524735] [2024-11-09 07:55:52,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:52,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:52,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:52,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713524735] [2024-11-09 07:55:52,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713524735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:52,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161298346] [2024-11-09 07:55:52,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:52,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:52,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:52,854 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:52,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:55:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 07:55:52,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:53,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:55:53,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161298346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:53,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:55:53,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-11-09 07:55:53,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940725015] [2024-11-09 07:55:53,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:53,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:55:53,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:53,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:55:53,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:55:53,091 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:53,224 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2024-11-09 07:55:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:53,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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 34 [2024-11-09 07:55:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:53,225 INFO L225 Difference]: With dead ends: 142 [2024-11-09 07:55:53,225 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 07:55:53,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:55:53,226 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 42 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:53,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 282 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 07:55:53,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2024-11-09 07:55:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 129 states have internal predecessors, (145), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2024-11-09 07:55:53,232 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 34 [2024-11-09 07:55:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:53,232 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2024-11-09 07:55:53,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2024-11-09 07:55:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:55:53,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:53,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:53,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:55:53,437 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,SelfDestructingSolverStorable25 [2024-11-09 07:55:53,438 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:53,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:53,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1572714536, now seen corresponding path program 1 times [2024-11-09 07:55:53,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:53,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651208083] [2024-11-09 07:55:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:53,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:53,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:53,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651208083] [2024-11-09 07:55:53,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651208083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:53,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:53,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:55:53,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866141782] [2024-11-09 07:55:53,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:53,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:55:53,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:53,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:55:53,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:55:53,693 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:53,867 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2024-11-09 07:55:53,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:55:53,868 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 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 35 [2024-11-09 07:55:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:53,868 INFO L225 Difference]: With dead ends: 138 [2024-11-09 07:55:53,868 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 07:55:53,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:55:53,869 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:53,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 569 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 07:55:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2024-11-09 07:55:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 131 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2024-11-09 07:55:53,873 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 35 [2024-11-09 07:55:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:53,873 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2024-11-09 07:55:53,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2024-11-09 07:55:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:55:53,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:53,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:53,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 07:55:53,875 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:53,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:53,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1509510222, now seen corresponding path program 1 times [2024-11-09 07:55:53,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:53,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169690954] [2024-11-09 07:55:53,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:53,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:54,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:54,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169690954] [2024-11-09 07:55:54,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169690954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:54,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:54,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:55:54,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294900297] [2024-11-09 07:55:54,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:54,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:55:54,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:54,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:55:54,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:55:54,138 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:54,376 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2024-11-09 07:55:54,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:55:54,376 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 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 36 [2024-11-09 07:55:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:54,377 INFO L225 Difference]: With dead ends: 137 [2024-11-09 07:55:54,377 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 07:55:54,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:55:54,378 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 22 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:54,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 545 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 07:55:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-09 07:55:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 131 states have internal predecessors, (145), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:54,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2024-11-09 07:55:54,380 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 36 [2024-11-09 07:55:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:54,380 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2024-11-09 07:55:54,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-11-09 07:55:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:55:54,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:54,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:54,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 07:55:54,381 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:55:54,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash 449823514, now seen corresponding path program 1 times [2024-11-09 07:55:54,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:54,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419467122] [2024-11-09 07:55:54,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:54,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:54,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:54,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419467122] [2024-11-09 07:55:54,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419467122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:54,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683422588] [2024-11-09 07:55:54,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:54,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:54,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:54,825 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:54,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:55:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 07:55:54,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:55,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:55:55,049 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:55:55,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:55:55,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:55:55,141 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 43 treesize of output 23 [2024-11-09 07:55:55,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2024-11-09 07:55:55,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:55,394 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 29 treesize of output 13 [2024-11-09 07:55:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:55,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:55,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:55,700 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 449 treesize of output 409 [2024-11-09 07:55:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:58,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683422588] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:58,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:55:58,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18, 15] total 40 [2024-11-09 07:55:58,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009467759] [2024-11-09 07:55:58,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:58,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:55:58,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:58,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:55:58,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1510, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 07:55:58,445 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:04,781 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2024-11-09 07:56:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:56:04,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 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 37 [2024-11-09 07:56:04,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:04,782 INFO L225 Difference]: With dead ends: 136 [2024-11-09 07:56:04,782 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 07:56:04,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=169, Invalid=1993, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 07:56:04,783 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 26 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:04,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 452 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 07:56:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 07:56:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-09 07:56:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 131 states have internal predecessors, (144), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:56:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2024-11-09 07:56:04,785 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 37 [2024-11-09 07:56:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:04,786 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2024-11-09 07:56:04,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2024-11-09 07:56:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:56:04,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:04,786 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] [2024-11-09 07:56:04,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 07:56:04,987 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,SelfDestructingSolverStorable28 [2024-11-09 07:56:04,987 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:56:04,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash 970674154, now seen corresponding path program 1 times [2024-11-09 07:56:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:04,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604175923] [2024-11-09 07:56:04,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:04,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:05,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:05,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 07:56:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:05,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:05,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604175923] [2024-11-09 07:56:05,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604175923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:05,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473174812] [2024-11-09 07:56:05,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:05,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:05,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:05,179 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:05,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:56:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:05,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 07:56:05,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:05,422 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 07:56:05,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:05,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:56:05,439 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:05,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:56:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 07:56:05,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:05,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473174812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:05,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:05,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2024-11-09 07:56:05,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156727676] [2024-11-09 07:56:05,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:05,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:56:05,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:05,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:56:05,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=535, Unknown=1, NotChecked=46, Total=650 [2024-11-09 07:56:05,662 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:06,023 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2024-11-09 07:56:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:56:06,023 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2024-11-09 07:56:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:06,024 INFO L225 Difference]: With dead ends: 169 [2024-11-09 07:56:06,024 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 07:56:06,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=995, Unknown=3, NotChecked=64, Total=1190 [2024-11-09 07:56:06,025 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 60 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:06,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 838 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 603 Invalid, 0 Unknown, 133 Unchecked, 0.2s Time] [2024-11-09 07:56:06,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 07:56:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-11-09 07:56:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.353846153846154) internal successors, (176), 155 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2024-11-09 07:56:06,028 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 39 [2024-11-09 07:56:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:06,028 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2024-11-09 07:56:06,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2024-11-09 07:56:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:56:06,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:06,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:06,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:56:06,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:06,229 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:56:06,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1511295107, now seen corresponding path program 1 times [2024-11-09 07:56:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:06,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931327723] [2024-11-09 07:56:06,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:06,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:06,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:06,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931327723] [2024-11-09 07:56:06,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931327723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:06,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:06,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 07:56:06,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559127002] [2024-11-09 07:56:06,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:06,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:56:06,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:06,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:56:06,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:56:06,589 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:06,857 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2024-11-09 07:56:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:56:06,858 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 39 [2024-11-09 07:56:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:06,858 INFO L225 Difference]: With dead ends: 161 [2024-11-09 07:56:06,858 INFO L226 Difference]: Without dead ends: 161 [2024-11-09 07:56:06,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:56:06,859 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 44 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:06,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 560 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:56:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-09 07:56:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-09 07:56:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 155 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2024-11-09 07:56:06,862 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 39 [2024-11-09 07:56:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:06,862 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2024-11-09 07:56:06,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2024-11-09 07:56:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:56:06,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:06,862 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:06,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 07:56:06,862 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:56:06,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash -173419745, now seen corresponding path program 1 times [2024-11-09 07:56:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:06,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34520513] [2024-11-09 07:56:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 07:56:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 07:56:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:56:07,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:07,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34520513] [2024-11-09 07:56:07,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34520513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:07,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272400471] [2024-11-09 07:56:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:07,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:07,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:07,206 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:07,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:56:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:56:07,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:07,371 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:07,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:56:07,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:56:07,421 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:07,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 07:56:07,452 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:07,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 07:56:07,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 07:56:07,474 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-09 07:56:07,494 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:56:07,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:56:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-09 07:56:07,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:07,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272400471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:07,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:07,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2024-11-09 07:56:07,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516279804] [2024-11-09 07:56:07,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:07,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:56:07,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:07,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:56:07,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2024-11-09 07:56:07,530 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 07:56:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:07,776 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2024-11-09 07:56:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:56:07,777 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-09 07:56:07,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:07,777 INFO L225 Difference]: With dead ends: 159 [2024-11-09 07:56:07,777 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 07:56:07,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2024-11-09 07:56:07,782 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 13 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:07,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 560 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 392 Invalid, 0 Unknown, 78 Unchecked, 0.2s Time] [2024-11-09 07:56:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 07:56:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-09 07:56:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 130 states have (on average 1.3153846153846154) internal successors, (171), 153 states have internal predecessors, (171), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2024-11-09 07:56:07,786 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 42 [2024-11-09 07:56:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:07,787 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2024-11-09 07:56:07,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 18 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 07:56:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2024-11-09 07:56:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:56:07,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:07,787 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:07,802 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-09 07:56:07,988 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,SelfDestructingSolverStorable31 [2024-11-09 07:56:07,988 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:56:07,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:07,988 INFO L85 PathProgramCache]: Analyzing trace with hash -173419744, now seen corresponding path program 1 times [2024-11-09 07:56:07,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:07,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998548922] [2024-11-09 07:56:07,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:07,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:08,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:08,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 07:56:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:08,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 07:56:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:56:08,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:08,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998548922] [2024-11-09 07:56:08,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998548922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:08,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237519682] [2024-11-09 07:56:08,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:08,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:08,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:08,455 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:08,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:56:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:08,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 07:56:08,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:08,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:56:08,680 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:08,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:56:08,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:56:08,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:56:08,773 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:08,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 07:56:08,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:56:08,856 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:08,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 07:56:08,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:56:08,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-09 07:56:08,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:56:08,949 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 07:56:08,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:08,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:56:08,969 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:08,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:56:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 07:56:08,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:09,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237519682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:09,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:09,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2024-11-09 07:56:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009242811] [2024-11-09 07:56:09,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:09,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 07:56:09,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:09,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 07:56:09,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=732, Unknown=1, NotChecked=54, Total=870 [2024-11-09 07:56:09,074 INFO L87 Difference]: Start difference. First operand 159 states and 179 transitions. Second operand has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:56:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:09,754 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2024-11-09 07:56:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:56:09,754 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2024-11-09 07:56:09,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:09,755 INFO L225 Difference]: With dead ends: 155 [2024-11-09 07:56:09,755 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 07:56:09,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=1512, Unknown=1, NotChecked=80, Total=1806 [2024-11-09 07:56:09,756 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 35 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:09,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 831 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 673 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2024-11-09 07:56:09,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 07:56:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-09 07:56:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 149 states have internal predecessors, (163), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2024-11-09 07:56:09,764 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 42 [2024-11-09 07:56:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:09,764 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2024-11-09 07:56:09,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 22 states have internal predecessors, (58), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:56:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2024-11-09 07:56:09,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:56:09,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:09,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:09,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 07:56:09,969 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,SelfDestructingSolverStorable32 [2024-11-09 07:56:09,969 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:56:09,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:09,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1149725730, now seen corresponding path program 1 times [2024-11-09 07:56:09,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:09,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023832137] [2024-11-09 07:56:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:09,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:10,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:10,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:10,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023832137] [2024-11-09 07:56:10,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023832137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:10,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:10,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:56:10,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682476333] [2024-11-09 07:56:10,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:10,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:56:10,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:10,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:56:10,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:56:10,109 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:10,258 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2024-11-09 07:56:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:56:10,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 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 42 [2024-11-09 07:56:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:10,260 INFO L225 Difference]: With dead ends: 160 [2024-11-09 07:56:10,260 INFO L226 Difference]: Without dead ends: 160 [2024-11-09 07:56:10,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:56:10,260 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 24 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:10,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 389 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-09 07:56:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2024-11-09 07:56:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 153 states have internal predecessors, (170), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 178 transitions. [2024-11-09 07:56:10,263 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 178 transitions. Word has length 42 [2024-11-09 07:56:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:10,263 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 178 transitions. [2024-11-09 07:56:10,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 178 transitions. [2024-11-09 07:56:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:56:10,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:10,264 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:10,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 07:56:10,264 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:56:10,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash -884803614, now seen corresponding path program 1 times [2024-11-09 07:56:10,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:10,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219360980] [2024-11-09 07:56:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:10,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:10,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:10,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:10,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219360980] [2024-11-09 07:56:10,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219360980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:10,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579174805] [2024-11-09 07:56:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:10,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:10,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:10,959 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:10,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 07:56:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:11,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 07:56:11,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:11,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:56:11,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:56:11,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:56:11,152 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:11,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:56:11,167 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 16 treesize of output 11 [2024-11-09 07:56:11,171 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 16 treesize of output 11 [2024-11-09 07:56:11,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:56:11,220 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:56:11,221 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:56:11,232 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:56:11,232 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:56:11,298 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 42 treesize of output 30 [2024-11-09 07:56:11,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-09 07:56:11,353 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 42 treesize of output 30 [2024-11-09 07:56:11,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:11,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2024-11-09 07:56:11,523 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:11,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:56:11,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:11,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:11,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 19 [2024-11-09 07:56:11,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:11,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-09 07:56:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:11,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:12,297 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 22 treesize of output 20 [2024-11-09 07:56:12,314 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 16 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_~data2~0#1.base_17| Int)) (or (= |c_ULTIMATE.start_create_~sll~0#1.base| |v_ULTIMATE.start_create_~data2~0#1.base_17|) (forall ((v_ArrVal_2276 Int) (v_ArrVal_2272 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_~data2~0#1.base_17| v_ArrVal_2272))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |c_ULTIMATE.start_create_~data1~0#1.base|) .cse1 v_ArrVal_2276))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)))) (or (< 0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 20)) (and (forall ((|v_ULTIMATE.start_create_~data2~0#1.base_17| Int) (v_ArrVal_2273 Int) (v_ArrVal_2278 Int) (v_ArrVal_2271 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_create_~data2~0#1.base_17| v_ArrVal_2271))) (store .cse2 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_2273) .cse1 v_ArrVal_2278))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)) (forall ((|v_ULTIMATE.start_create_~data2~0#1.base_17| Int) (v_ArrVal_2276 Int) (v_ArrVal_2272 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_~data2~0#1.base_17| v_ArrVal_2272))) (store .cse3 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |c_ULTIMATE.start_create_~data1~0#1.base|) .cse1 v_ArrVal_2276))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)))) (forall ((|v_ULTIMATE.start_create_~data2~0#1.base_17| Int)) (or (forall ((v_ArrVal_2273 Int) (v_ArrVal_2278 Int) (v_ArrVal_2271 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_create_~data2~0#1.base_17| v_ArrVal_2271))) (store .cse4 |c_ULTIMATE.start_create_~now~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_2273) .cse1 v_ArrVal_2278))) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0)) (= |c_ULTIMATE.start_create_~sll~0#1.base| |v_ULTIMATE.start_create_~data2~0#1.base_17|))))) is different from false [2024-11-09 07:56:13,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:13,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 07:56:13,007 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,009 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 48 treesize of output 44 [2024-11-09 07:56:13,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:13,019 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 66 treesize of output 68 [2024-11-09 07:56:13,030 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 56 treesize of output 54 [2024-11-09 07:56:13,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:13,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 07:56:13,067 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,068 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 48 treesize of output 44 [2024-11-09 07:56:13,078 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:56:13,079 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 124 treesize of output 119 [2024-11-09 07:56:13,095 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 56 treesize of output 54 [2024-11-09 07:56:13,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:13,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 07:56:13,117 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,118 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 48 treesize of output 44 [2024-11-09 07:56:13,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,122 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 07:56:13,126 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,126 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,129 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,130 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 0 case distinctions, treesize of input 19 treesize of output 13 [2024-11-09 07:56:13,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:13,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 07:56:13,137 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,138 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 48 treesize of output 44 [2024-11-09 07:56:13,140 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,141 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,144 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,146 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 0 case distinctions, treesize of input 19 treesize of output 13 [2024-11-09 07:56:13,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:13,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 07:56:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:13,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579174805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:13,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:13,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 48 [2024-11-09 07:56:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448661698] [2024-11-09 07:56:13,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:13,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 07:56:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:13,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 07:56:13,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1953, Unknown=48, NotChecked=90, Total=2256 [2024-11-09 07:56:13,226 INFO L87 Difference]: Start difference. First operand 159 states and 178 transitions. Second operand has 48 states, 48 states have (on average 2.375) internal successors, (114), 45 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:56:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:14,423 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2024-11-09 07:56:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:56:14,423 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.375) internal successors, (114), 45 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-09 07:56:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:14,424 INFO L225 Difference]: With dead ends: 162 [2024-11-09 07:56:14,424 INFO L226 Difference]: Without dead ends: 162 [2024-11-09 07:56:14,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=266, Invalid=2872, Unknown=58, NotChecked=110, Total=3306 [2024-11-09 07:56:14,425 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 36 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:14,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1136 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1137 Invalid, 0 Unknown, 60 Unchecked, 0.7s Time] [2024-11-09 07:56:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-09 07:56:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-09 07:56:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 156 states have internal predecessors, (173), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 181 transitions. [2024-11-09 07:56:14,428 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 181 transitions. Word has length 45 [2024-11-09 07:56:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:14,429 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 181 transitions. [2024-11-09 07:56:14,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.375) internal successors, (114), 45 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:56:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 181 transitions. [2024-11-09 07:56:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:56:14,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:14,429 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:14,449 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-09 07:56:14,630 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,SelfDestructingSolverStorable34 [2024-11-09 07:56:14,630 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:56:14,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash -361567797, now seen corresponding path program 1 times [2024-11-09 07:56:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:14,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580578874] [2024-11-09 07:56:14,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:15,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 07:56:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:15,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:15,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580578874] [2024-11-09 07:56:15,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580578874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:15,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885573954] [2024-11-09 07:56:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:15,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:15,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:15,194 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-09 07:56:15,195 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-09 07:56:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:15,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 07:56:15,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:15,452 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:15,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:56:15,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:56:15,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:15,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 07:56:15,571 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:15,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 07:56:15,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 07:56:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:15,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:15,740 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 07:56:15,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 07:56:15,780 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2426 (Array Int Int))) (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|)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2426) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))))) is different from false [2024-11-09 07:56:15,833 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2426 (Array Int Int)) (v_ArrVal_2425 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2425))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2426) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))))))) is different from false [2024-11-09 07:56:15,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:15,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 44 [2024-11-09 07:56:15,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:15,848 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 420 treesize of output 317 [2024-11-09 07:56:15,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:15,857 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 82 treesize of output 63 [2024-11-09 07:56:15,864 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 80 treesize of output 68 [2024-11-09 07:56:15,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885573954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:15,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:15,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 30 [2024-11-09 07:56:15,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994329820] [2024-11-09 07:56:15,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:15,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 07:56:15,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:15,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 07:56:15,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1185, Unknown=31, NotChecked=142, Total=1482 [2024-11-09 07:56:15,950 INFO L87 Difference]: Start difference. First operand 162 states and 181 transitions. Second operand has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 26 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:16,454 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2024-11-09 07:56:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:56:16,455 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 26 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-11-09 07:56:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:16,456 INFO L225 Difference]: With dead ends: 165 [2024-11-09 07:56:16,456 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 07:56:16,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=1923, Unknown=34, NotChecked=182, Total=2352 [2024-11-09 07:56:16,456 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:16,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1111 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:56:16,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 07:56:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-11-09 07:56:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 140 states have (on average 1.2714285714285714) internal successors, (178), 159 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2024-11-09 07:56:16,459 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 46 [2024-11-09 07:56:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:16,459 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2024-11-09 07:56:16,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.533333333333333) internal successors, (76), 26 states have internal predecessors, (76), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2024-11-09 07:56:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:56:16,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:16,460 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:16,477 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-09 07:56:16,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:16,661 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:56:16,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:16,661 INFO L85 PathProgramCache]: Analyzing trace with hash -361567796, now seen corresponding path program 1 times [2024-11-09 07:56:16,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:16,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225017460] [2024-11-09 07:56:16,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:16,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:17,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:17,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 07:56:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:17,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:17,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225017460] [2024-11-09 07:56:17,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225017460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:17,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082176791] [2024-11-09 07:56:17,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:17,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:17,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:17,369 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-09 07:56:17,370 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-09 07:56:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:17,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 07:56:17,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:17,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:56:17,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:17,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:56:17,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:56:17,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:56:17,782 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:17,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 07:56:17,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:56:17,833 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:56:17,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 07:56:17,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:56:17,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 07:56:17,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:56:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:17,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:18,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2574 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0))) (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2573 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2573) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse0)))))) is different from false [2024-11-09 07:56:18,099 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|))) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2574 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))) (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2573 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2573) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))) is different from false [2024-11-09 07:56:18,112 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8))) (and (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2571))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2572) .cse0 v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2573) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2572 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2572) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_2571) |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse1))))) is different from false [2024-11-09 07:56:18,120 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) (.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2572 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2572) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2571) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))) (forall ((v_ArrVal_2574 (Array Int Int)) (v_ArrVal_2573 (Array Int Int)) (v_ArrVal_2572 (Array Int Int)) (v_ArrVal_2571 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2571))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2572) .cse3 v_ArrVal_2574) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2573) |c_ULTIMATE.start_create_~sll~0#1.base|) .cse2))))))))) is different from false [2024-11-09 07:56:18,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:18,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2024-11-09 07:56:18,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:18,135 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 36 treesize of output 37 [2024-11-09 07:56:18,137 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 64 treesize of output 52 [2024-11-09 07:56:18,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:18,143 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 122 treesize of output 115 [2024-11-09 07:56:18,147 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 74 treesize of output 58 [2024-11-09 07:56:18,150 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 84 treesize of output 72 [2024-11-09 07:56:18,153 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 50 treesize of output 46 [2024-11-09 07:56:18,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:18,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-09 07:56:18,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:18,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-09 07:56:18,198 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:18,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:18,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:18,202 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 92 treesize of output 56 [2024-11-09 07:56:18,205 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:18,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:18,207 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 50 treesize of output 32 [2024-11-09 07:56:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082176791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:18,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:18,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2024-11-09 07:56:18,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696600815] [2024-11-09 07:56:18,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:18,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 07:56:18,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:18,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 07:56:18,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1349, Unknown=4, NotChecked=308, Total=1806 [2024-11-09 07:56:18,310 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 27 states have internal predecessors, (79), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:18,830 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2024-11-09 07:56:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:56:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 27 states have internal predecessors, (79), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2024-11-09 07:56:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:18,831 INFO L225 Difference]: With dead ends: 169 [2024-11-09 07:56:18,831 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 07:56:18,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=1864, Unknown=4, NotChecked=364, Total=2450 [2024-11-09 07:56:18,832 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 27 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:18,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1073 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:56:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 07:56:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-09 07:56:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.2569444444444444) internal successors, (181), 163 states have internal predecessors, (181), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 189 transitions. [2024-11-09 07:56:18,839 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 189 transitions. Word has length 46 [2024-11-09 07:56:18,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:18,839 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 189 transitions. [2024-11-09 07:56:18,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 27 states have internal predecessors, (79), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 189 transitions. [2024-11-09 07:56:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:56:18,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:18,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:18,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 07:56:19,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 07:56:19,040 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-09 07:56:19,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1659109671, now seen corresponding path program 1 times [2024-11-09 07:56:19,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:19,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117337932] [2024-11-09 07:56:19,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:19,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:19,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117337932] [2024-11-09 07:56:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117337932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914590920] [2024-11-09 07:56:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:20,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:20,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:20,082 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-09 07:56:20,083 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-09 07:56:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:20,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-09 07:56:20,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:20,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:56:21,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 458 treesize of output 342 [2024-11-09 07:56:24,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:24,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:24,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1632 treesize of output 818 [2024-11-09 07:56:48,677 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse5 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| 1))) (let ((.cse10 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int)) (let ((.cse76 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (let ((.cse75 (store .cse76 v_arrayElimCell_132 0))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse75 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse75 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse76 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 v_prenex_14) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))))))) (.cse27 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int)) (let ((.cse72 (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)))) (let ((.cse74 (store (store .cse72 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (= |c_#valid| (store (store .cse72 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (let ((.cse73 (store (store .cse5 v_arrayElimCell_134 (select .cse74 v_arrayElimCell_134)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse73 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse73 v_arrayElimCell_134))) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select .cse74 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) (.cse13 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_7 Int)) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select (let ((.cse71 (store (store .cse5 v_arrayElimCell_132 v_DerPreprocessor_7) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse71 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 (select .cse71 v_arrayElimCell_132))) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0)))) (.cse7 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (.cse16 (not (= |c_ULTIMATE.start_destroy_~l#1.base| 0))) (.cse1 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 16))) (.cse37 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 0)))) (or (and (let ((.cse0 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_135 Int)) (let ((.cse36 (store .cse5 v_arrayElimCell_135 0))) (and (= (select .cse36 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse36 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse36 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))))) (or .cse0 (and .cse1 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse4 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1)) (.cse6 (select |c_#valid| v_arrayElimCell_135))) (let ((.cse2 (store (store .cse4 v_arrayElimCell_135 .cse6) v_arrayElimCell_132 0))) (and (= (select .cse2 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse3 (store .cse4 v_arrayElimCell_135 (select .cse2 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse3 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select .cse3 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))) v_arrayElimCell_135) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_135 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= |c_#valid| (store (store (store .cse5 v_arrayElimCell_135 .cse6) v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_135 0)))))) .cse7 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse8 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse8 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse8 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse8 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) .cse0 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse9 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse9 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 (select .cse9 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse9 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse9 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) .cse10 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int)) (let ((.cse11 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store .cse11 v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse11 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse12 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse12 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse12 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 (select .cse12 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse12 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) .cse13 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse15 (store (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select (let ((.cse14 (store (store .cse5 v_arrayElimCell_134 (select .cse15 v_arrayElimCell_134)) v_arrayElimCell_135 (select .cse15 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse14 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse14 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (= (select .cse15 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse15 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse15 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_135 0))))) (and .cse16 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_prenex_9 Int)) (let ((.cse17 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| 1))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store .cse17 v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select .cse17 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse18 (store .cse5 v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse18 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse18 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select .cse18 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_11 Int) (v_DerPreprocessor_9 Int) (v_arrayElimCell_132 Int)) (let ((.cse19 (store .cse5 v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse19 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_132 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 v_DerPreprocessor_9) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select .cse19 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int) (v_prenex_9 Int)) (let ((.cse20 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) v_arrayElimCell_134 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select .cse20 v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select .cse20 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (= |c_#valid| (store .cse20 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse20 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse21 (store .cse5 v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store .cse21 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select .cse21 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select .cse21 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_DerPreprocessor_7 Int)) (let ((.cse22 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse22 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse22 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (let ((.cse23 (store (store .cse5 v_arrayElimCell_132 v_DerPreprocessor_7) v_arrayElimCell_135 (select .cse22 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse23 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 (select .cse23 v_arrayElimCell_132))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse22 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (exists ((v_prenex_7 Int) (|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int) (v_DerPreprocessor_5 Int)) (let ((.cse24 (store .cse5 v_arrayElimCell_135 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select .cse24 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse24 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse24 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 v_DerPreprocessor_5) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_7) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (let ((.cse25 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_135 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store .cse25 v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse26 (store .cse25 v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse26 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select .cse26 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))) v_arrayElimCell_135) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_135 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)))) .cse27 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse28 (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_132 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= (select .cse28 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select .cse28 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= |c_#valid| (store .cse28 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (let ((.cse29 (store (store .cse5 v_arrayElimCell_134 (select .cse28 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse29 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse29 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse30 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse30 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select .cse30 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse30 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_135 0))))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (let ((.cse32 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (let ((.cse33 (store .cse32 v_arrayElimCell_135 0))) (and (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (let ((.cse31 (store .cse32 v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse31 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select .cse31 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))) v_arrayElimCell_135) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_135 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse33 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= (select .cse33 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_135 0)))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse35 (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= (select (let ((.cse34 (store (store .cse5 v_arrayElimCell_134 (select .cse35 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse34 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse34 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select .cse35 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse35 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_135 0)) (= (select .cse35 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))))) .cse37) (and (or .cse10 (and .cse37 (or .cse13 .cse27)) .cse13 (and (or .cse7 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse38 (store (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select .cse38 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse38 |c_ULTIMATE.start_destroy_~l#1.base|) 1))))) .cse37) (and .cse16 (let ((.cse39 (exists ((v_prenex_11 Int) (v_DerPreprocessor_9 Int) (v_arrayElimCell_132 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_132 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 v_DerPreprocessor_9) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0))))) (or .cse39 (and (or (exists ((v_arrayElimCell_132 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (= (select (store .cse5 v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base|) 1))) .cse39 (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int) (v_prenex_9 Int)) (let ((.cse41 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)))) (let ((.cse40 (store (store .cse41 |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) v_arrayElimCell_134 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select .cse40 v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store (store .cse41 v_arrayElimCell_132 0) |c_ULTIMATE.start_destroy_~l#1.base| 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (= (select .cse40 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) .cse37)))) (and .cse37 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int)) (let ((.cse43 (store .cse5 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (let ((.cse42 (store .cse43 v_arrayElimCell_132 0))) (and (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select .cse42 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse42 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse43 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0))))))) .cse1) (and (let ((.cse46 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse65 (exists ((v_arrayElimCell_135 Int)) (let ((.cse70 (store .cse5 v_arrayElimCell_135 0))) (and (= |c_#valid| (store .cse70 0 0)) (= (select .cse70 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))))) (or (and (exists ((v_DerPreprocessor_25 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (let ((.cse44 (store (store .cse5 0 v_DerPreprocessor_25) v_arrayElimCell_135 0))) (and (= (select .cse44 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (let ((.cse45 (store (store .cse5 0 (select .cse44 0)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse45 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse45 0))) v_arrayElimCell_135) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_135 0) 0 0)) (not (= v_arrayElimCell_135 0))))) .cse46 .cse16) (and (or (exists ((v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse47 (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_132 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= (select .cse47 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse47 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (not (= v_arrayElimCell_134 0)) (= (select (let ((.cse48 (store (store .cse5 v_arrayElimCell_134 (select .cse47 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse48 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse48 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse49 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse49 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse49 0 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse50 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse50 0 0)) (= (select .cse50 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_prenex_7 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int) (v_DerPreprocessor_5 Int)) (let ((.cse51 (store .cse5 v_arrayElimCell_135 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store .cse51 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select .cse51 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 v_DerPreprocessor_5) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_7) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int)) (let ((.cse52 (store .cse5 v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store .cse52 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select .cse52 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (and .cse16 (or (and .cse46 (exists ((v_DerPreprocessor_23 Int) (v_arrayElimCell_132 Int) (v_prenex_9 Int)) (let ((.cse53 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_23) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select .cse53 0)) |c_ULTIMATE.start_destroy_~l#1.base| 1) 0)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select .cse53 |c_ULTIMATE.start_destroy_~l#1.base|) 1))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int) (v_prenex_9 Int)) (let ((.cse54 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) v_arrayElimCell_134 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select .cse54 v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store .cse54 0 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= v_arrayElimCell_134 0)) (= (select .cse54 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))) (exists ((v_prenex_11 Int) (v_DerPreprocessor_9 Int) (v_arrayElimCell_132 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_132 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 v_DerPreprocessor_9) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0))) (exists ((v_arrayElimCell_132 Int)) (let ((.cse55 (store .cse5 v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse55 0 0)) (= (select .cse55 |c_ULTIMATE.start_destroy_~l#1.base|) 1)))))) (exists ((v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse56 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse56 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse56 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 (select .cse56 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_DerPreprocessor_7 Int)) (let ((.cse57 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse57 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse57 0 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select (let ((.cse58 (store (store .cse5 v_arrayElimCell_132 v_DerPreprocessor_7) v_arrayElimCell_135 (select .cse57 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse58 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 (select .cse58 v_arrayElimCell_132))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse60 (store (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select (let ((.cse59 (store (store .cse5 v_arrayElimCell_134 (select .cse60 v_arrayElimCell_134)) v_arrayElimCell_135 (select .cse60 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse59 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse59 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= |c_#valid| (store .cse60 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= v_arrayElimCell_134 0)) (= (select .cse60 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_135 0))))) (exists ((v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse61 (store (store .cse5 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse61 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (= |c_#valid| (store .cse61 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse5 v_arrayElimCell_135 (select .cse61 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (and .cse46 (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_DerPreprocessor_19 Int)) (let ((.cse62 (select |c_#valid| v_arrayElimCell_135))) (let ((.cse63 (store (store (store .cse5 0 v_DerPreprocessor_19) v_arrayElimCell_135 .cse62) v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store (store .cse5 v_arrayElimCell_135 .cse62) v_arrayElimCell_132 0) 0 0)) (= (select .cse63 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select (let ((.cse64 (store (store .cse5 0 (select .cse63 0)) v_arrayElimCell_135 (select .cse63 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse64 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse64 0))) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)))))) .cse16) .cse65 (and .cse46 (exists ((v_DerPreprocessor_24 Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (let ((.cse67 (store (store .cse5 0 v_DerPreprocessor_24) v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store .cse5 v_arrayElimCell_132 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= (select (let ((.cse66 (store (store .cse5 0 (select .cse67 0)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse66 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse66 0))) v_arrayElimCell_135) 0) (= (select .cse67 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_135 0))))) .cse16)) .cse1) (exists ((v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse69 (store (store .cse5 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= (select (let ((.cse68 (store (store .cse5 v_arrayElimCell_134 (select .cse69 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse68 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse68 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select .cse69 |c_ULTIMATE.start_destroy_~l#1.base|) 1) (not (= v_arrayElimCell_134 0)) (not (= v_arrayElimCell_135 0)) (= |c_#valid| (store .cse69 0 0))))) .cse65)) .cse37)))) (<= 0 |c_ULTIMATE.start_destroy_~l#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base|) 0)) is different from false [2024-11-09 07:56:55,504 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_destroy_~l#1.base|) 1) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| 1))) (let ((.cse3 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_7 Int)) (and (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select (let ((.cse54 (store (store .cse0 v_arrayElimCell_132 v_DerPreprocessor_7) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse54 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 (select .cse54 v_arrayElimCell_132))) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0)))) (.cse5 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int)) (let ((.cse53 (store .cse0 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (and (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store .cse53 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse53 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 v_prenex_14) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)))))) (.cse4 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int)) (let ((.cse51 (store .cse0 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (= |c_#valid| (store (store .cse51 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (let ((.cse52 (store (store .cse0 v_arrayElimCell_134 (select (store (store .cse51 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0) v_arrayElimCell_134)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse52 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse52 v_arrayElimCell_134))) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)))))) (.cse6 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 16))) (.cse27 (not (= |c_ULTIMATE.start_destroy_~l#1.base| 0))) (.cse2 (not (= |c_ULTIMATE.start_destroy_~l#1.offset| 0)))) (or (and (or (and (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int)) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (and (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select (store .cse1 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse1 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0)))) .cse2) .cse3 (and .cse2 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (and (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store .cse0 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (and (or .cse3 .cse4) .cse2) .cse5) .cse6) (and (let ((.cse15 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_135 Int)) (let ((.cse32 (store .cse0 v_arrayElimCell_135 0))) (and (= (select .cse32 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse32 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))))) (or (and .cse6 (or (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse7 (store (store .cse0 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse7 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse0 v_arrayElimCell_135 (select .cse7 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse7 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse8 (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select .cse8 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse8 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_135 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse11 (select |c_#valid| v_arrayElimCell_135))) (and (= (select (let ((.cse9 (let ((.cse10 (store .cse0 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (store .cse10 v_arrayElimCell_135 (select (store (store .cse10 v_arrayElimCell_135 .cse11) v_arrayElimCell_132 0) v_arrayElimCell_135))))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse9 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select .cse9 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= |c_#valid| (store (store (store .cse0 v_arrayElimCell_135 .cse11) v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_135 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse12 (store (store .cse0 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse12 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse12 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_DerPreprocessor_7 Int)) (let ((.cse13 (store (store .cse0 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse13 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (let ((.cse14 (store (store .cse0 v_arrayElimCell_132 v_DerPreprocessor_7) v_arrayElimCell_135 (select .cse13 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse14 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 (select .cse14 v_arrayElimCell_132))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse13 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) .cse15 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse16 (store (store .cse0 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse0 v_arrayElimCell_135 (select .cse16 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= |c_#valid| (store .cse16 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0)) (= (select .cse16 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse18 (store (store (store .cse0 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select (let ((.cse17 (store (store .cse0 v_arrayElimCell_134 (select .cse18 v_arrayElimCell_134)) v_arrayElimCell_135 (select .cse18 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse17 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse17 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (= (select .cse18 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse18 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_135 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse19 (store (store .cse0 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_132 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= (select .cse19 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= |c_#valid| (store .cse19 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (let ((.cse20 (store (store .cse0 v_arrayElimCell_134 (select .cse19 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse20 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse20 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) .cse3 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (and (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_135 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (let ((.cse21 (store (store .cse0 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse21 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select .cse21 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))) v_arrayElimCell_135) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (not (= v_arrayElimCell_135 0)))) (exists ((v_prenex_7 Int) (|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int) (v_DerPreprocessor_5 Int)) (let ((.cse22 (store .cse0 v_arrayElimCell_135 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select .cse22 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (= |c_#valid| (store .cse22 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse0 v_arrayElimCell_135 v_DerPreprocessor_5) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_7) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse23 (store .cse0 v_arrayElimCell_132 0))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store .cse23 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select .cse23 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (and (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)))) (and (or (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_prenex_9 Int)) (and (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base| 1) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_11 Int) (v_DerPreprocessor_9 Int) (v_arrayElimCell_132 Int)) (let ((.cse24 (store .cse0 v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse24 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_132 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 v_DerPreprocessor_9) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (= (select .cse24 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int) (v_prenex_9 Int)) (let ((.cse25 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) v_arrayElimCell_134 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select .cse25 v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= (select .cse25 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (= |c_#valid| (store .cse25 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0))))) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_arrayElimCell_132 Int)) (let ((.cse26 (store .cse0 v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse26 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select .cse26 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1))))) .cse27) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int)) (and (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse0 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0))) .cse5 .cse4)) (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (let ((.cse29 (store .cse0 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 0) (= (select (let ((.cse28 (store .cse29 v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse28 |c_ULTIMATE.start_destroy_~l#1.base|)) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| (select .cse28 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|))) v_arrayElimCell_135) 0) (= |c_#valid| (store (store .cse0 v_arrayElimCell_135 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (= (select (store .cse29 v_arrayElimCell_135 0) |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1) (not (= v_arrayElimCell_135 0))))) .cse15 (exists ((|v_ULTIMATE.start_destroy_#t~mem18#1.base_14| Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse31 (store (store .cse0 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= (select (let ((.cse30 (store (store .cse0 v_arrayElimCell_134 (select .cse31 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse30 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse30 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= |c_#valid| (store .cse31 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14| 0)) (not (= v_arrayElimCell_135 0)) (= (select .cse31 |v_ULTIMATE.start_destroy_#t~mem18#1.base_14|) 1)))))) .cse2) (and (let ((.cse35 (exists ((v_arrayElimCell_135 Int)) (and (= |c_#valid| (store (store .cse0 v_arrayElimCell_135 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (.cse33 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0))) (or (and .cse33 .cse27 (exists ((v_DerPreprocessor_25 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (and (= (select (let ((.cse34 (store (store .cse0 0 (select (store (store .cse0 0 v_DerPreprocessor_25) v_arrayElimCell_135 0) 0)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse34 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse34 0))) v_arrayElimCell_135) 0) (= |c_#valid| (store (store .cse0 v_arrayElimCell_135 0) 0 0)) (not (= v_arrayElimCell_135 0))))) .cse35 (and .cse6 (or (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0) 0 0))) (and .cse33 .cse27 (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_DerPreprocessor_19 Int)) (let ((.cse36 (select |c_#valid| v_arrayElimCell_135))) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store (store .cse0 v_arrayElimCell_135 .cse36) v_arrayElimCell_132 0) 0 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select (let ((.cse37 (let ((.cse38 (store (store (store .cse0 0 v_DerPreprocessor_19) v_arrayElimCell_135 .cse36) v_arrayElimCell_132 0))) (store (store .cse0 0 (select .cse38 0)) v_arrayElimCell_135 (select .cse38 v_arrayElimCell_135))))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse37 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse37 0))) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)))))) (and .cse27 (or (and .cse33 (exists ((v_DerPreprocessor_23 Int) (v_arrayElimCell_132 Int) (v_prenex_9 Int)) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) 0 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_23) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132 0) 0)) |c_ULTIMATE.start_destroy_~l#1.base| 1) 0)) |c_ULTIMATE.start_destroy_~l#1.base|) 0)))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_134 Int) (v_prenex_9 Int)) (let ((.cse39 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132 0))) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_9) v_arrayElimCell_134 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134 (select .cse39 v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_134)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store .cse39 0 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= v_arrayElimCell_134 0))))) (exists ((v_arrayElimCell_132 Int)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) 0 0))) (exists ((v_prenex_11 Int) (v_DerPreprocessor_9 Int) (v_arrayElimCell_132 Int)) (and (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| v_prenex_11) v_arrayElimCell_132 (select (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132 v_DerPreprocessor_9) |c_ULTIMATE.start_destroy_~l#1.base| 1) v_arrayElimCell_132)) |c_ULTIMATE.start_destroy_~l#1.base|) 0) (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (and (= |c_#valid| (store (store (store .cse0 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0) 0 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)))) (exists ((v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse40 (store (store .cse0 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse40 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse0 v_arrayElimCell_135 (select .cse40 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_prenex_7 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int) (v_DerPreprocessor_5 Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (= |c_#valid| (store (store .cse0 v_arrayElimCell_135 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse0 v_arrayElimCell_135 v_DerPreprocessor_5) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 v_prenex_7) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)))) (exists ((v_arrayElimCell_132 Int)) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0))) .cse35 (and (exists ((v_DerPreprocessor_24 Int) (v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int)) (and (not (= v_arrayElimCell_132 0)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_132 0) 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (= (select (let ((.cse41 (store (store .cse0 0 (select (store (store .cse0 0 v_DerPreprocessor_24) v_arrayElimCell_132 0) 0)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse41 |c_ULTIMATE.start_destroy_~l#1.base|)) 0 (select .cse41 0))) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0)))) .cse33 .cse27) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse43 (store (store (store .cse0 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= (select (let ((.cse42 (store (store .cse0 v_arrayElimCell_134 (select .cse43 v_arrayElimCell_134)) v_arrayElimCell_135 (select .cse43 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse42 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse42 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= |c_#valid| (store .cse43 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= v_arrayElimCell_134 0)) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int) (v_DerPreprocessor_7 Int)) (let ((.cse44 (store (store .cse0 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse44 0 0)) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select (let ((.cse45 (store (store .cse0 v_arrayElimCell_132 v_DerPreprocessor_7) v_arrayElimCell_135 (select .cse44 v_arrayElimCell_135)))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse45 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 (select .cse45 v_arrayElimCell_132))) v_arrayElimCell_135) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_prenex_14 Int) (v_arrayElimCell_132 Int) (v_arrayElimCell_135 Int)) (let ((.cse46 (store (store .cse0 v_arrayElimCell_135 (select |c_#valid| v_arrayElimCell_135)) v_arrayElimCell_132 0))) (and (= |c_#valid| (store .cse46 0 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select (store .cse0 v_arrayElimCell_135 (select .cse46 v_arrayElimCell_135)) |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_132 v_prenex_14) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_132 v_arrayElimCell_135)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_132) 0) (not (= v_arrayElimCell_135 0))))) (exists ((v_arrayElimCell_132 Int) (v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse47 (store (store .cse0 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_132 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= |c_#valid| (store .cse47 0 0)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_132 v_arrayElimCell_134)) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_135)) (not (= v_arrayElimCell_134 0)) (= (select (let ((.cse48 (store (store .cse0 v_arrayElimCell_134 (select .cse47 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse48 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse48 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= v_arrayElimCell_135 0))))))) (exists ((v_DerPreprocessor_8 Int) (v_arrayElimCell_135 Int) (v_arrayElimCell_134 Int)) (let ((.cse50 (store (store .cse0 v_arrayElimCell_134 (select |c_#valid| v_arrayElimCell_134)) v_arrayElimCell_135 0))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_134) 0) (not (= v_arrayElimCell_135 v_arrayElimCell_134)) (= (select (let ((.cse49 (store (store .cse0 v_arrayElimCell_134 (select .cse50 v_arrayElimCell_134)) v_arrayElimCell_135 v_DerPreprocessor_8))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base| (select .cse49 |c_ULTIMATE.start_destroy_~l#1.base|)) v_arrayElimCell_134 (select .cse49 v_arrayElimCell_134))) v_arrayElimCell_135) 0) (not (= |c_ULTIMATE.start_destroy_~l#1.base| v_arrayElimCell_134)) (not (= v_arrayElimCell_134 0)) (not (= v_arrayElimCell_135 0)) (= |c_#valid| (store .cse50 0 0))))))) .cse2)))) (<= 0 |c_ULTIMATE.start_destroy_~l#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_~l#1.base|) 0)) is different from false