./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0236.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0236.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash 9284cc089e563ce2bdd0201592786c36b8d718b3efb8766c887a82d2ff3babc3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:42:39,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:42:39,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:42:39,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:42:39,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:42:39,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:42:39,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:42:39,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:42:39,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:42:39,211 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:42:39,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:42:39,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:42:39,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:42:39,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:42:39,214 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:42:39,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:42:39,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:42:39,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:42:39,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:42:39,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:42:39,216 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:42:39,218 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:42:39,218 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:42:39,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:42:39,219 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:42:39,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:42:39,219 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:42:39,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:42:39,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:42:39,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:42:39,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:42:39,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:42:39,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:42:39,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:42:39,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:42:39,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:42:39,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:42:39,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:42:39,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:42:39,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:42:39,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:42:39,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:42:39,226 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9284cc089e563ce2bdd0201592786c36b8d718b3efb8766c887a82d2ff3babc3 [2024-11-19 06:42:39,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:42:39,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:42:39,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:42:39,515 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:42:39,515 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:42:39,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0236.i [2024-11-19 06:42:40,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:42:41,199 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:42:41,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0236.i [2024-11-19 06:42:41,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fcb20a21/84d363621ee546e887370a930285515c/FLAG192d33b6f [2024-11-19 06:42:41,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fcb20a21/84d363621ee546e887370a930285515c [2024-11-19 06:42:41,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:42:41,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:42:41,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:42:41,526 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:42:41,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:42:41,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:42:41" (1/1) ... [2024-11-19 06:42:41,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c5ed56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:41, skipping insertion in model container [2024-11-19 06:42:41,534 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:42:41" (1/1) ... [2024-11-19 06:42:41,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:42:41,967 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:42:42,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:42:42,013 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:42:42,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:42:42,124 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:42:42,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42 WrapperNode [2024-11-19 06:42:42,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:42:42,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:42:42,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:42:42,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:42:42,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,193 INFO L138 Inliner]: procedures = 188, calls = 67, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 221 [2024-11-19 06:42:42,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:42:42,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:42:42,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:42:42,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:42:42,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,251 INFO L175 MemorySlicer]: Split 39 memory accesses to 2 slices as follows [2, 37]. 95 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 19 writes are split as follows [0, 19]. [2024-11-19 06:42:42,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:42:42,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:42:42,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:42:42,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:42:42,277 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (1/1) ... [2024-11-19 06:42:42,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:42:42,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:42,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:42:42,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:42:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:42:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:42:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:42:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:42:42,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:42:42,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:42:42,371 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2024-11-19 06:42:42,371 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2024-11-19 06:42:42,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:42:42,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:42:42,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:42:42,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:42:42,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:42:42,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:42:42,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:42:42,540 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:42:42,542 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:42:43,173 INFO L? ?]: Removed 220 outVars from TransFormulas that were not future-live. [2024-11-19 06:42:43,173 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:42:43,197 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:42:43,199 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-19 06:42:43,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:42:43 BoogieIcfgContainer [2024-11-19 06:42:43,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:42:43,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:42:43,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:42:43,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:42:43,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:42:41" (1/3) ... [2024-11-19 06:42:43,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772460a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:42:43, skipping insertion in model container [2024-11-19 06:42:43,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:42:42" (2/3) ... [2024-11-19 06:42:43,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772460a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:42:43, skipping insertion in model container [2024-11-19 06:42:43,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:42:43" (3/3) ... [2024-11-19 06:42:43,210 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0236.i [2024-11-19 06:42:43,228 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:42:43,229 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 89 error locations. [2024-11-19 06:42:43,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:42:43,277 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;@27e48652, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:42:43,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2024-11-19 06:42:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 213 states, 116 states have (on average 1.956896551724138) internal successors, (227), 205 states have internal predecessors, (227), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:42:43,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:43,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:42:43,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:42:43,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:43,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1546503, now seen corresponding path program 1 times [2024-11-19 06:42:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:43,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577531063] [2024-11-19 06:42:43,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:43,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:42:43,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:43,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577531063] [2024-11-19 06:42:43,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577531063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:43,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:43,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:42:43,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322145678] [2024-11-19 06:42:43,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:43,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:42:43,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:43,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:42:43,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:42:43,479 INFO L87 Difference]: Start difference. First operand has 213 states, 116 states have (on average 1.956896551724138) internal successors, (227), 205 states have internal predecessors, (227), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:42:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:43,504 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2024-11-19 06:42:43,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:42:43,506 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:42:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:43,515 INFO L225 Difference]: With dead ends: 213 [2024-11-19 06:42:43,515 INFO L226 Difference]: Without dead ends: 211 [2024-11-19 06:42:43,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:42:43,520 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:43,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:42:43,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-19 06:42:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-19 06:42:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 115 states have (on average 1.8608695652173912) internal successors, (214), 203 states have internal predecessors, (214), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions. [2024-11-19 06:42:43,568 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 4 [2024-11-19 06:42:43,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:43,569 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions. [2024-11-19 06:42:43,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:42:43,569 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions. [2024-11-19 06:42:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:42:43,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:43,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:42:43,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:42:43,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:42:43,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:43,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1481503548, now seen corresponding path program 1 times [2024-11-19 06:42:43,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:43,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490129692] [2024-11-19 06:42:43,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:42:43,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:43,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490129692] [2024-11-19 06:42:43,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490129692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:43,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:43,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:42:43,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736800690] [2024-11-19 06:42:43,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:43,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:42:43,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:43,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:42:43,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:42:43,740 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:42:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:43,931 INFO L93 Difference]: Finished difference Result 210 states and 225 transitions. [2024-11-19 06:42:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:42:43,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-19 06:42:43,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:43,934 INFO L225 Difference]: With dead ends: 210 [2024-11-19 06:42:43,934 INFO L226 Difference]: Without dead ends: 210 [2024-11-19 06:42:43,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:42:43,938 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:43,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 355 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:42:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-19 06:42:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2024-11-19 06:42:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 115 states have (on average 1.8521739130434782) internal successors, (213), 202 states have internal predecessors, (213), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2024-11-19 06:42:43,962 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 6 [2024-11-19 06:42:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:43,962 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2024-11-19 06:42:43,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:42:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2024-11-19 06:42:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:42:43,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:43,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:43,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:42:43,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:42:43,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:43,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1318030234, now seen corresponding path program 1 times [2024-11-19 06:42:43,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:43,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154267181] [2024-11-19 06:42:43,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 06:42:44,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629557339] [2024-11-19 06:42:44,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:44,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:44,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:44,010 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:44,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:42:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:44,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 06:42:44,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:44,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:42:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:42:44,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:42:44,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:44,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154267181] [2024-11-19 06:42:44,210 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:42:44,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629557339] [2024-11-19 06:42:44,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629557339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:44,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:44,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:42:44,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846311845] [2024-11-19 06:42:44,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:44,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:42:44,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:44,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:42:44,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:42:44,215 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:42:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:44,416 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2024-11-19 06:42:44,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:42:44,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:42:44,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:44,418 INFO L225 Difference]: With dead ends: 219 [2024-11-19 06:42:44,419 INFO L226 Difference]: Without dead ends: 219 [2024-11-19 06:42:44,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:42:44,422 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 11 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:44,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 572 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:42:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-19 06:42:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-19 06:42:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 123 states have (on average 1.8048780487804879) internal successors, (222), 210 states have internal predecessors, (222), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2024-11-19 06:42:44,443 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 7 [2024-11-19 06:42:44,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:44,444 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2024-11-19 06:42:44,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:42:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2024-11-19 06:42:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 06:42:44,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:44,446 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:44,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:42:44,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:44,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:42:44,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:44,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1395817257, now seen corresponding path program 1 times [2024-11-19 06:42:44,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:44,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221558828] [2024-11-19 06:42:44,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 06:42:44,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2068799398] [2024-11-19 06:42:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:44,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:44,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:44,751 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:44,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:42:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:44,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 06:42:44,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:44,988 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 7 [2024-11-19 06:42:45,047 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 13 treesize of output 9 [2024-11-19 06:42:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-19 06:42:45,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:42:45,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:45,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221558828] [2024-11-19 06:42:45,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:42:45,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068799398] [2024-11-19 06:42:45,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068799398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:45,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:45,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:42:45,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660041663] [2024-11-19 06:42:45,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:45,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:42:45,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:45,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:42:45,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:42:45,142 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 06:42:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:45,329 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2024-11-19 06:42:45,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:42:45,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2024-11-19 06:42:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:45,331 INFO L225 Difference]: With dead ends: 231 [2024-11-19 06:42:45,332 INFO L226 Difference]: Without dead ends: 221 [2024-11-19 06:42:45,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:42:45,333 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 3 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:45,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 788 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:42:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-19 06:42:45,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-11-19 06:42:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 125 states have (on average 1.792) internal successors, (224), 212 states have internal predecessors, (224), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 236 transitions. [2024-11-19 06:42:45,342 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 236 transitions. Word has length 66 [2024-11-19 06:42:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:45,343 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 236 transitions. [2024-11-19 06:42:45,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 06:42:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 236 transitions. [2024-11-19 06:42:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 06:42:45,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:45,345 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:45,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:42:45,549 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,SelfDestructingSolverStorable3 [2024-11-19 06:42:45,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:42:45,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:45,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1079899883, now seen corresponding path program 1 times [2024-11-19 06:42:45,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:45,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854015179] [2024-11-19 06:42:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:45,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 06:42:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722051462] [2024-11-19 06:42:45,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:45,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:45,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:45,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:45,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:42:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:46,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 06:42:46,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:46,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:42:46,127 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 13 treesize of output 9 [2024-11-19 06:42:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 88 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 06:42:46,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-19 06:42:46,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:46,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854015179] [2024-11-19 06:42:46,458 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:42:46,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722051462] [2024-11-19 06:42:46,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722051462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:42:46,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:42:46,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-19 06:42:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563533579] [2024-11-19 06:42:46,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:46,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:42:46,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:42:46,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:42:46,463 INFO L87 Difference]: Start difference. First operand 221 states and 236 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 06:42:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:46,877 INFO L93 Difference]: Finished difference Result 240 states and 256 transitions. [2024-11-19 06:42:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:42:46,878 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 71 [2024-11-19 06:42:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:46,883 INFO L225 Difference]: With dead ends: 240 [2024-11-19 06:42:46,883 INFO L226 Difference]: Without dead ends: 225 [2024-11-19 06:42:46,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:42:46,884 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 13 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:46,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1362 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:42:46,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-19 06:42:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2024-11-19 06:42:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 129 states have (on average 1.7674418604651163) internal successors, (228), 216 states have internal predecessors, (228), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 240 transitions. [2024-11-19 06:42:46,896 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 240 transitions. Word has length 71 [2024-11-19 06:42:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:46,896 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 240 transitions. [2024-11-19 06:42:46,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 06:42:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 240 transitions. [2024-11-19 06:42:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 06:42:46,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:46,899 INFO L215 NwaCegarLoop]: trace histogram [20, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:46,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:42:47,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:47,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:42:47,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash 576970153, now seen corresponding path program 2 times [2024-11-19 06:42:47,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:47,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832336116] [2024-11-19 06:42:47,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:42:47,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:47,361 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:42:47,361 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 06:42:47,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025446402] [2024-11-19 06:42:47,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:42:47,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:47,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:47,377 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:47,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:42:47,895 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:42:47,895 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:42:47,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-19 06:42:47,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:47,956 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 7 [2024-11-19 06:42:47,989 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 13 treesize of output 9 [2024-11-19 06:42:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 115 proven. 158 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-19 06:42:48,139 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:48,448 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 143 proven. 10 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-19 06:42:48,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:48,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832336116] [2024-11-19 06:42:48,449 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:42:48,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025446402] [2024-11-19 06:42:48,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025446402] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:42:48,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:42:48,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-19 06:42:48,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384151112] [2024-11-19 06:42:48,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:48,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 06:42:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:48,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 06:42:48,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:42:48,452 INFO L87 Difference]: Start difference. First operand 225 states and 240 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-19 06:42:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:49,315 INFO L93 Difference]: Finished difference Result 249 states and 270 transitions. [2024-11-19 06:42:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:42:49,316 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 86 [2024-11-19 06:42:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:49,317 INFO L225 Difference]: With dead ends: 249 [2024-11-19 06:42:49,317 INFO L226 Difference]: Without dead ends: 234 [2024-11-19 06:42:49,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=318, Invalid=942, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 06:42:49,318 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 35 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:49,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2717 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:42:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-19 06:42:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-19 06:42:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 138 states have (on average 1.7173913043478262) internal successors, (237), 225 states have internal predecessors, (237), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 249 transitions. [2024-11-19 06:42:49,330 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 249 transitions. Word has length 86 [2024-11-19 06:42:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:49,331 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 249 transitions. [2024-11-19 06:42:49,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-19 06:42:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 249 transitions. [2024-11-19 06:42:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 06:42:49,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:49,334 INFO L215 NwaCegarLoop]: trace histogram [50, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:49,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:42:49,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:49,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:42:49,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:49,542 INFO L85 PathProgramCache]: Analyzing trace with hash -978298519, now seen corresponding path program 3 times [2024-11-19 06:42:49,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:49,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127824604] [2024-11-19 06:42:49,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:42:49,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:50,402 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2024-11-19 06:42:50,402 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 06:42:50,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821351014] [2024-11-19 06:42:50,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:42:50,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:50,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:50,417 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:50,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:42:50,682 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:42:50,682 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:42:50,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 06:42:50,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:50,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:42:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1565 trivial. 0 not checked. [2024-11-19 06:42:50,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:42:50,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:50,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127824604] [2024-11-19 06:42:50,733 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:42:50,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821351014] [2024-11-19 06:42:50,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821351014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:50,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:50,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:42:50,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565503130] [2024-11-19 06:42:50,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:50,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:42:50,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:50,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:42:50,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:42:50,736 INFO L87 Difference]: Start difference. First operand 234 states and 249 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 06:42:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:50,873 INFO L93 Difference]: Finished difference Result 233 states and 248 transitions. [2024-11-19 06:42:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:42:50,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 116 [2024-11-19 06:42:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:50,878 INFO L225 Difference]: With dead ends: 233 [2024-11-19 06:42:50,879 INFO L226 Difference]: Without dead ends: 233 [2024-11-19 06:42:50,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:42:50,880 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 11 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:50,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 594 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:42:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-19 06:42:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-19 06:42:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 138 states have (on average 1.710144927536232) internal successors, (236), 224 states have internal predecessors, (236), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 248 transitions. [2024-11-19 06:42:50,889 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 248 transitions. Word has length 116 [2024-11-19 06:42:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:50,889 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 248 transitions. [2024-11-19 06:42:50,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-19 06:42:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 248 transitions. [2024-11-19 06:42:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 06:42:50,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:50,894 INFO L215 NwaCegarLoop]: trace histogram [55, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:50,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:42:51,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:51,095 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:42:51,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1683709814, now seen corresponding path program 1 times [2024-11-19 06:42:51,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:51,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012262923] [2024-11-19 06:42:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:51,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 878 proven. 4 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2024-11-19 06:42:52,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:52,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012262923] [2024-11-19 06:42:52,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012262923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:52,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936067689] [2024-11-19 06:42:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:52,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:52,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:52,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:52,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:42:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:52,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 06:42:52,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:52,922 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2024-11-19 06:42:52,969 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:42:52,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 06:42:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 809 proven. 1 refuted. 0 times theorem prover too weak. 1068 trivial. 72 not checked. [2024-11-19 06:42:52,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:53,265 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:42:53,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-19 06:42:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 809 proven. 73 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2024-11-19 06:42:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936067689] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:42:53,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:42:53,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 17 [2024-11-19 06:42:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717272022] [2024-11-19 06:42:53,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:53,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 06:42:53,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:53,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 06:42:53,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2024-11-19 06:42:53,291 INFO L87 Difference]: Start difference. First operand 233 states and 248 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:42:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:53,969 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2024-11-19 06:42:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:42:53,969 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 128 [2024-11-19 06:42:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:53,973 INFO L225 Difference]: With dead ends: 229 [2024-11-19 06:42:53,973 INFO L226 Difference]: Without dead ends: 229 [2024-11-19 06:42:53,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 248 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=311, Unknown=1, NotChecked=36, Total=420 [2024-11-19 06:42:53,974 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 15 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:53,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1467 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 905 Invalid, 0 Unknown, 212 Unchecked, 0.6s Time] [2024-11-19 06:42:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-19 06:42:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-19 06:42:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 138 states have (on average 1.681159420289855) internal successors, (232), 220 states have internal predecessors, (232), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 244 transitions. [2024-11-19 06:42:53,982 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 244 transitions. Word has length 128 [2024-11-19 06:42:53,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:53,984 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 244 transitions. [2024-11-19 06:42:53,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 06:42:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 244 transitions. [2024-11-19 06:42:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 06:42:53,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:53,987 INFO L215 NwaCegarLoop]: trace histogram [55, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:54,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 06:42:54,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:54,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:42:54,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:54,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1683709813, now seen corresponding path program 1 times [2024-11-19 06:42:54,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:54,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728994620] [2024-11-19 06:42:54,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:54,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 06:42:54,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [532167983] [2024-11-19 06:42:54,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:54,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:54,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:54,530 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:54,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:42:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:56,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-19 06:42:56,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:56,785 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 7 [2024-11-19 06:42:57,702 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-19 06:42:57,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:57,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:42:57,796 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:42:57,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:42:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 665 proven. 496 refuted. 0 times theorem prover too weak. 662 trivial. 127 not checked. [2024-11-19 06:42:57,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:57,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728994620] [2024-11-19 06:42:57,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:42:57,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532167983] [2024-11-19 06:42:57,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532167983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:57,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:42:57,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2024-11-19 06:42:57,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305302200] [2024-11-19 06:42:57,988 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:57,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 06:42:57,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 06:42:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=980, Unknown=1, NotChecked=62, Total=1122 [2024-11-19 06:42:57,991 INFO L87 Difference]: Start difference. First operand 229 states and 244 transitions. Second operand has 32 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 06:43:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:43:00,323 INFO L93 Difference]: Finished difference Result 235 states and 255 transitions. [2024-11-19 06:43:00,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 06:43:00,324 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 128 [2024-11-19 06:43:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:43:00,328 INFO L225 Difference]: With dead ends: 235 [2024-11-19 06:43:00,328 INFO L226 Difference]: Without dead ends: 235 [2024-11-19 06:43:00,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=171, Invalid=2184, Unknown=1, NotChecked=94, Total=2450 [2024-11-19 06:43:00,331 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 42 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3172 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 353 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:43:00,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3172 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2304 Invalid, 0 Unknown, 353 Unchecked, 1.5s Time] [2024-11-19 06:43:00,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-19 06:43:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 225. [2024-11-19 06:43:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 138 states have (on average 1.6521739130434783) internal successors, (228), 216 states have internal predecessors, (228), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:43:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 240 transitions. [2024-11-19 06:43:00,341 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 240 transitions. Word has length 128 [2024-11-19 06:43:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:43:00,341 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 240 transitions. [2024-11-19 06:43:00,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 06:43:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 240 transitions. [2024-11-19 06:43:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 06:43:00,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:43:00,343 INFO L215 NwaCegarLoop]: trace histogram [55, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:43:00,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 06:43:00,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:43:00,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:43:00,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:43:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1524007956, now seen corresponding path program 1 times [2024-11-19 06:43:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:43:00,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242190406] [2024-11-19 06:43:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:43:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:43:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:43:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 1585 trivial. 0 not checked. [2024-11-19 06:43:01,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:43:01,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242190406] [2024-11-19 06:43:01,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242190406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:43:01,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:43:01,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:43:01,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490897477] [2024-11-19 06:43:01,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:43:01,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:43:01,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:43:01,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:43:01,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:43:01,559 INFO L87 Difference]: Start difference. First operand 225 states and 240 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-19 06:43:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:43:01,948 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2024-11-19 06:43:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:43:01,948 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 131 [2024-11-19 06:43:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:43:01,950 INFO L225 Difference]: With dead ends: 224 [2024-11-19 06:43:01,950 INFO L226 Difference]: Without dead ends: 224 [2024-11-19 06:43:01,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:43:01,951 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 9 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:43:01,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1241 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:43:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-19 06:43:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-19 06:43:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 138 states have (on average 1.644927536231884) internal successors, (227), 215 states have internal predecessors, (227), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:43:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2024-11-19 06:43:01,958 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 131 [2024-11-19 06:43:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:43:01,959 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2024-11-19 06:43:01,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-19 06:43:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2024-11-19 06:43:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 06:43:01,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:43:01,962 INFO L215 NwaCegarLoop]: trace histogram [55, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:43:01,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:43:01,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:43:01,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:43:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1524007957, now seen corresponding path program 1 times [2024-11-19 06:43:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:43:01,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606837351] [2024-11-19 06:43:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:43:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:43:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:43:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 809 proven. 128 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2024-11-19 06:43:05,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:43:05,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606837351] [2024-11-19 06:43:05,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606837351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:43:05,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810105456] [2024-11-19 06:43:05,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:43:05,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:43:05,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:43:05,665 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:43:05,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:43:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:43:14,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-19 06:43:14,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:43:14,864 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 10 treesize of output 9 [2024-11-19 06:43:16,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 06:43:16,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:43:17,015 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 21 treesize of output 9 [2024-11-19 06:43:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 467 proven. 404 refuted. 0 times theorem prover too weak. 1079 trivial. 0 not checked. [2024-11-19 06:43:17,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:43:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 365 proven. 15 refuted. 0 times theorem prover too weak. 1570 trivial. 0 not checked. [2024-11-19 06:43:18,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810105456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:43:18,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:43:18,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 15] total 58 [2024-11-19 06:43:18,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678140496] [2024-11-19 06:43:18,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:43:18,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-19 06:43:18,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:43:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-19 06:43:18,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3105, Unknown=0, NotChecked=0, Total=3306 [2024-11-19 06:43:18,652 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand has 58 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 53 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 06:43:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:43:23,869 INFO L93 Difference]: Finished difference Result 253 states and 280 transitions. [2024-11-19 06:43:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-19 06:43:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 53 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) Word has length 131 [2024-11-19 06:43:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:43:23,870 INFO L225 Difference]: With dead ends: 253 [2024-11-19 06:43:23,871 INFO L226 Difference]: Without dead ends: 249 [2024-11-19 06:43:23,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=545, Invalid=6937, Unknown=0, NotChecked=0, Total=7482 [2024-11-19 06:43:23,874 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 28 mSDsluCounter, 5186 mSDsCounter, 0 mSdLazyCounter, 4244 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 5388 SdHoareTripleChecker+Invalid, 4258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 06:43:23,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 5388 Invalid, 4258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4244 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 06:43:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-19 06:43:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 229. [2024-11-19 06:43:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 143 states have (on average 1.6223776223776223) internal successors, (232), 220 states have internal predecessors, (232), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-19 06:43:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 248 transitions. [2024-11-19 06:43:23,882 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 248 transitions. Word has length 131 [2024-11-19 06:43:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:43:23,882 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 248 transitions. [2024-11-19 06:43:23,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 53 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 06:43:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 248 transitions. [2024-11-19 06:43:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 06:43:23,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:43:23,884 INFO L215 NwaCegarLoop]: trace histogram [56, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:43:23,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:43:24,084 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,SelfDestructingSolverStorable10 [2024-11-19 06:43:24,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:43:24,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:43:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash -111006385, now seen corresponding path program 1 times [2024-11-19 06:43:24,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:43:24,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436631662] [2024-11-19 06:43:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:43:24,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:43:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:43:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 1103 proven. 216 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2024-11-19 06:43:25,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:43:25,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436631662] [2024-11-19 06:43:25,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436631662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:43:25,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188972220] [2024-11-19 06:43:25,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:43:25,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:43:25,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:43:25,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:43:25,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 06:43:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:43:26,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 1427 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-19 06:43:26,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:43:26,372 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) is different from false [2024-11-19 06:43:26,374 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) is different from true [2024-11-19 06:43:26,390 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from false [2024-11-19 06:43:26,393 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse0 (select |c_#valid| .cse0))))))) is different from true [2024-11-19 06:43:26,526 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse3 (select |c_#valid| .cse3))))))) is different from false [2024-11-19 06:43:26,531 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse3 (select |c_#valid| .cse3))))))) is different from true [2024-11-19 06:43:26,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 06:43:26,587 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8)))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse1 .cse0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= .cse1 .cse2) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3))))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) is different from false [2024-11-19 06:43:26,591 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8)))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse1 .cse0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= .cse1 .cse2) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3))))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) is different from true [2024-11-19 06:43:26,652 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 91 treesize of output 73 [2024-11-19 06:43:26,702 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| v_prenex_2)) (.cse1 (@diff v_prenex_2 |c_#valid|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select v_prenex_2 .cse0)) v_prenex_2) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_ULTIMATE.start_l4_insert_#t~mem8#1.base| .cse1) (= |c_#valid| (store v_prenex_2 .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|)))))) is different from false [2024-11-19 06:43:26,706 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| v_prenex_2)) (.cse1 (@diff v_prenex_2 |c_#valid|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select v_prenex_2 .cse0)) v_prenex_2) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_ULTIMATE.start_l4_insert_#t~mem8#1.base| .cse1) (= |c_#valid| (store v_prenex_2 .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|)))))) is different from true [2024-11-19 06:43:26,789 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| v_prenex_2))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select v_prenex_2 .cse1)) v_prenex_2) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store v_prenex_2 (@diff v_prenex_2 |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) is different from false [2024-11-19 06:43:26,795 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| v_prenex_2))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select v_prenex_2 .cse1)) v_prenex_2) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store v_prenex_2 (@diff v_prenex_2 |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10|) 1)) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) is different from true [2024-11-19 06:43:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 1028 proven. 212 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2024-11-19 06:43:26,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:43:27,762 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:43:27,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-19 06:43:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 1028 proven. 291 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2024-11-19 06:43:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188972220] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:43:27,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:43:27,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 23] total 37 [2024-11-19 06:43:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660281426] [2024-11-19 06:43:27,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:43:27,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 06:43:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:43:27,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 06:43:27,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=868, Unknown=12, NotChecked=390, Total=1406 [2024-11-19 06:43:27,785 INFO L87 Difference]: Start difference. First operand 229 states and 248 transitions. Second operand has 38 states, 36 states have (on average 2.5) internal successors, (90), 31 states have internal predecessors, (90), 4 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 06:43:28,039 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from false [2024-11-19 06:43:28,041 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from true [2024-11-19 06:43:28,043 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from false [2024-11-19 06:43:28,045 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse1 (select |c_#valid| .cse1))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse0))) is different from true [2024-11-19 06:43:28,069 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) .cse2 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse4 (select |c_#valid| .cse4))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse2))) is different from false [2024-11-19 06:43:28,072 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select |v_#valid_BEFORE_CALL_9| .cse1)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1))))))) .cse2 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse3 (select |c_#valid| .cse3))) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~ret7#1.base|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_7| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_7| .cse4 (select |c_#valid| .cse4))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse2))) is different from true [2024-11-19 06:43:28,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8)))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse1 .cse0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= .cse1 .cse2) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3))))))) .cse4)) .cse4)) is different from false [2024-11-19 06:43:28,081 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) (+ |c_ULTIMATE.start_l4_insert_~item~0#1.offset| 8)))) (or (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse0 (select |c_#valid| .cse0))) (= .cse1 .cse0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse2 (select |c_#valid| .cse2))) (= .cse1 .cse2) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_7| |v_#valid_BEFORE_CALL_9|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse3 (select |v_#valid_BEFORE_CALL_9| .cse3)) |v_#valid_BEFORE_CALL_9|) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3))))))) .cse4)) .cse4)) is different from true [2024-11-19 06:43:28,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| v_prenex_2)) (.cse1 (@diff v_prenex_2 |c_#valid|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select v_prenex_2 .cse0)) v_prenex_2) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_ULTIMATE.start_l4_insert_#t~mem8#1.base| .cse1) (= |c_#valid| (store v_prenex_2 .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) .cse2 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|))))) .cse2)) is different from false [2024-11-19 06:43:28,091 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_7| v_prenex_2)) (.cse1 (@diff v_prenex_2 |c_#valid|))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse0 (select v_prenex_2 .cse0)) v_prenex_2) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_ULTIMATE.start_l4_insert_#t~mem8#1.base| .cse1) (= |c_#valid| (store v_prenex_2 .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) .cse2 (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_#t~mem8#1.base|))))) .cse2)) is different from true [2024-11-19 06:43:28,100 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| v_prenex_2))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select v_prenex_2 .cse1)) v_prenex_2) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store v_prenex_2 (@diff v_prenex_2 |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10|) 1)) .cse0 .cse2))) .cse2)) is different from false [2024-11-19 06:43:28,103 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (let ((.cse0 (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)))) (or (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_9| (@diff |v_#valid_BEFORE_CALL_9| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_7| v_prenex_2))) (and (= (store |v_#valid_BEFORE_CALL_7| .cse1 (select v_prenex_2 .cse1)) v_prenex_2) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store v_prenex_2 (@diff v_prenex_2 |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_7| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (and (exists ((|v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10| Int)) (= (select |c_#valid| |v_ULTIMATE.start_l4_insert_#t~mem8#1.base_10|) 1)) .cse0 .cse2))) .cse2)) is different from true [2024-11-19 06:43:28,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:43:28,908 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2024-11-19 06:43:28,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:43:28,909 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.5) internal successors, (90), 31 states have internal predecessors, (90), 4 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 135 [2024-11-19 06:43:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:43:28,910 INFO L225 Difference]: With dead ends: 242 [2024-11-19 06:43:28,910 INFO L226 Difference]: Without dead ends: 242 [2024-11-19 06:43:28,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 249 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=216, Invalid=1140, Unknown=24, NotChecked=972, Total=2352 [2024-11-19 06:43:28,912 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 12 mSDsluCounter, 2282 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 3508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1704 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 06:43:28,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2480 Invalid, 3508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1741 Invalid, 0 Unknown, 1704 Unchecked, 0.9s Time] [2024-11-19 06:43:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-19 06:43:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2024-11-19 06:43:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 155 states have (on average 1.5806451612903225) internal successors, (245), 231 states have internal predecessors, (245), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-19 06:43:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 265 transitions. [2024-11-19 06:43:28,923 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 265 transitions. Word has length 135 [2024-11-19 06:43:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:43:28,923 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 265 transitions. [2024-11-19 06:43:28,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.5) internal successors, (90), 31 states have internal predecessors, (90), 4 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 06:43:28,924 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 265 transitions. [2024-11-19 06:43:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 06:43:28,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:43:28,925 INFO L215 NwaCegarLoop]: trace histogram [56, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:43:28,948 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-19 06:43:29,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:43:29,130 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2024-11-19 06:43:29,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:43:29,130 INFO L85 PathProgramCache]: Analyzing trace with hash -111006384, now seen corresponding path program 1 times [2024-11-19 06:43:29,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:43:29,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841003213] [2024-11-19 06:43:29,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:43:29,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:43:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:43:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 853 proven. 145 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2024-11-19 06:43:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:43:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841003213] [2024-11-19 06:43:32,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841003213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:43:32,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554779834] [2024-11-19 06:43:32,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:43:32,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:43:32,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:43:32,220 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:43:32,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 06:43:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:43:35,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 1427 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-11-19 06:43:35,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:43:35,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:43:37,141 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2024-11-19 06:43:37,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:43:37,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:43:37,237 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:43:37,237 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-19 06:43:37,570 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:43:37,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 06:43:37,590 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 06:43:37,591 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-19 06:43:37,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 06:43:37,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-19 06:43:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 478 proven. 880 refuted. 0 times theorem prover too weak. 197 trivial. 456 not checked. [2024-11-19 06:43:37,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:43:38,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554779834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:43:38,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:43:38,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 42] total 64 [2024-11-19 06:43:38,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439660773] [2024-11-19 06:43:38,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:43:38,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-19 06:43:38,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:43:38,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-19 06:43:38,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3972, Unknown=1, NotChecked=126, Total=4290 [2024-11-19 06:43:38,044 INFO L87 Difference]: Start difference. First operand 242 states and 265 transitions. Second operand has 64 states, 62 states have (on average 1.7419354838709677) internal successors, (108), 59 states have internal predecessors, (108), 4 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-19 06:43:42,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-19 06:43:51,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-19 06:43:53,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]