./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.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/list-ext3-properties/dll_nondet_free_order-1.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 f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:03:43,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:03:43,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:03:43,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:03:43,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:03:43,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:03:43,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:03:43,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:03:43,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:03:43,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:03:43,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:03:43,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:03:43,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:03:43,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:03:43,279 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:03:43,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:03:43,280 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:03:43,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:03:43,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:03:43,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:03:43,280 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:03:43,281 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:03:43,281 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:03:43,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:03:43,282 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:03:43,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:03:43,282 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:03:43,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:03:43,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:03:43,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:03:43,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:03:43,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:03:43,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:03:43,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:03:43,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:03:43,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:03:43,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:03:43,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:03:43,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:03:43,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:03:43,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:03:43,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:03:43,285 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 -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2024-11-19 07:03:43,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:03:43,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:03:43,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:03:43,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:03:43,528 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:03:43,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-19 07:03:45,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:03:45,300 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:03:45,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-19 07:03:45,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f723dfbb/74f85e8b69294f5c9279428502153127/FLAGbef0e05ac [2024-11-19 07:03:45,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f723dfbb/74f85e8b69294f5c9279428502153127 [2024-11-19 07:03:45,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:03:45,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:03:45,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:03:45,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:03:45,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:03:45,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8160d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45, skipping insertion in model container [2024-11-19 07:03:45,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:03:45,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:03:45,706 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:03:45,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:03:45,773 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:03:45,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45 WrapperNode [2024-11-19 07:03:45,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:03:45,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:03:45,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:03:45,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:03:45,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,814 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2024-11-19 07:03:45,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:03:45,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:03:45,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:03:45,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:03:45,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,850 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2024-11-19 07:03:45,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:03:45,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:03:45,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:03:45,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:03:45,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (1/1) ... [2024-11-19 07:03:45,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:03:45,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:45,898 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 07:03:45,905 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 07:03:45,948 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-19 07:03:45,949 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-19 07:03:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 07:03:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 07:03:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 07:03:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 07:03:45,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:03:45,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:03:46,027 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:03:46,029 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:03:46,050 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-19 07:03:46,343 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-19 07:03:46,343 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:03:46,371 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:03:46,371 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 07:03:46,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:46 BoogieIcfgContainer [2024-11-19 07:03:46,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:03:46,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:03:46,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:03:46,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:03:46,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:03:45" (1/3) ... [2024-11-19 07:03:46,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c849132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:03:46, skipping insertion in model container [2024-11-19 07:03:46,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:45" (2/3) ... [2024-11-19 07:03:46,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c849132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:03:46, skipping insertion in model container [2024-11-19 07:03:46,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:46" (3/3) ... [2024-11-19 07:03:46,384 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2024-11-19 07:03:46,397 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:03:46,398 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-11-19 07:03:46,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:03:46,453 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;@6aa68eab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:03:46,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-19 07:03:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 07:03:46,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:46,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 07:03:46,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:46,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:46,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-19 07:03:46,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:46,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497585412] [2024-11-19 07:03:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:46,683 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 07:03:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497585412] [2024-11-19 07:03:46,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497585412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:46,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:46,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:03:46,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509429017] [2024-11-19 07:03:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:46,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:46,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:46,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:46,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:46,727 INFO L87 Difference]: Start difference. First operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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 07:03:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:46,879 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2024-11-19 07:03:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 07:03:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:46,888 INFO L225 Difference]: With dead ends: 136 [2024-11-19 07:03:46,888 INFO L226 Difference]: Without dead ends: 130 [2024-11-19 07:03:46,890 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 07:03:46,894 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 17 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:46,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 206 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:46,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-19 07:03:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-19 07:03:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 129 states have internal predecessors, (135), 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 07:03:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2024-11-19 07:03:46,928 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 4 [2024-11-19 07:03:46,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:46,929 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2024-11-19 07:03:46,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 07:03:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2024-11-19 07:03:46,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 07:03:46,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:46,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 07:03:46,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:03:46,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:46,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:46,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-19 07:03:46,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:46,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828447484] [2024-11-19 07:03:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:46,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:46,989 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 07:03:46,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:46,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828447484] [2024-11-19 07:03:46,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828447484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:46,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:46,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:03:46,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080300441] [2024-11-19 07:03:46,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:46,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:46,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:46,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:46,993 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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 07:03:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:47,039 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2024-11-19 07:03:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:47,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 07:03:47,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:47,042 INFO L225 Difference]: With dead ends: 127 [2024-11-19 07:03:47,042 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 07:03:47,042 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 07:03:47,043 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 15 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:47,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 228 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:47,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 07:03:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-19 07:03:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 126 states have internal predecessors, (132), 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 07:03:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2024-11-19 07:03:47,056 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 4 [2024-11-19 07:03:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:47,057 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2024-11-19 07:03:47,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 07:03:47,057 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2024-11-19 07:03:47,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 07:03:47,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:47,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:47,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:03:47,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:47,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:47,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2024-11-19 07:03:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:47,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385869314] [2024-11-19 07:03:47,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:47,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:47,163 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 07:03:47,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385869314] [2024-11-19 07:03:47,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385869314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:47,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:47,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:03:47,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598137955] [2024-11-19 07:03:47,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:47,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:47,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:47,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:47,166 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 07:03:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:47,182 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2024-11-19 07:03:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:47,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-19 07:03:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:47,183 INFO L225 Difference]: With dead ends: 136 [2024-11-19 07:03:47,183 INFO L226 Difference]: Without dead ends: 136 [2024-11-19 07:03:47,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 07:03:47,184 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 8 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:47,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 253 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-19 07:03:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-11-19 07:03:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 127 states have internal predecessors, (133), 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 07:03:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2024-11-19 07:03:47,197 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 9 [2024-11-19 07:03:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:47,197 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2024-11-19 07:03:47,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 07:03:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2024-11-19 07:03:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 07:03:47,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:47,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:47,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:03:47,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:47,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2024-11-19 07:03:47,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:47,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648623376] [2024-11-19 07:03:47,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:47,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:47,252 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 07:03:47,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:47,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648623376] [2024-11-19 07:03:47,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648623376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:47,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:47,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:03:47,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237910395] [2024-11-19 07:03:47,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:47,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:47,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:47,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:47,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:47,256 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 07:03:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:47,349 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2024-11-19 07:03:47,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:47,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-19 07:03:47,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:47,351 INFO L225 Difference]: With dead ends: 127 [2024-11-19 07:03:47,351 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 07:03:47,351 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 07:03:47,352 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:47,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 205 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 07:03:47,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-19 07:03:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 126 states have internal predecessors, (132), 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 07:03:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2024-11-19 07:03:47,365 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 9 [2024-11-19 07:03:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:47,365 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2024-11-19 07:03:47,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 07:03:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2024-11-19 07:03:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 07:03:47,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:47,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:47,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:03:47,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:47,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2024-11-19 07:03:47,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:47,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112462287] [2024-11-19 07:03:47,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:47,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:47,461 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 07:03:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112462287] [2024-11-19 07:03:47,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112462287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:47,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:47,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:03:47,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402621500] [2024-11-19 07:03:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:47,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:47,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:47,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:47,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:47,466 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 07:03:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:47,485 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2024-11-19 07:03:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:47,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-11-19 07:03:47,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:47,486 INFO L225 Difference]: With dead ends: 126 [2024-11-19 07:03:47,486 INFO L226 Difference]: Without dead ends: 126 [2024-11-19 07:03:47,487 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 07:03:47,487 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:47,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 237 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-19 07:03:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-19 07:03:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 125 states have internal predecessors, (131), 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 07:03:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2024-11-19 07:03:47,497 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 9 [2024-11-19 07:03:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:47,498 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2024-11-19 07:03:47,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 07:03:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2024-11-19 07:03:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 07:03:47,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:47,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:47,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 07:03:47,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:47,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2024-11-19 07:03:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:47,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623351274] [2024-11-19 07:03:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:47,663 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 07:03:47,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:47,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623351274] [2024-11-19 07:03:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623351274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:47,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:47,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:03:47,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125008703] [2024-11-19 07:03:47,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:47,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:03:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:03:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:47,665 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 07:03:47,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:47,787 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2024-11-19 07:03:47,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:03:47,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-11-19 07:03:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:47,790 INFO L225 Difference]: With dead ends: 129 [2024-11-19 07:03:47,790 INFO L226 Difference]: Without dead ends: 129 [2024-11-19 07:03:47,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:47,791 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 16 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:47,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 268 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:47,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-19 07:03:47,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-19 07:03:47,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.8) internal successors, (135), 128 states have internal predecessors, (135), 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 07:03:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2024-11-19 07:03:47,799 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 10 [2024-11-19 07:03:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:47,799 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2024-11-19 07:03:47,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 07:03:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2024-11-19 07:03:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 07:03:47,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:47,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:47,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 07:03:47,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:47,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2024-11-19 07:03:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:47,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206325880] [2024-11-19 07:03:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:48,023 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 07:03:48,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:48,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206325880] [2024-11-19 07:03:48,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206325880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:48,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:48,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:03:48,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297204862] [2024-11-19 07:03:48,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:48,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:48,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:48,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:48,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:48,025 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 07:03:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:48,076 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2024-11-19 07:03:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:03:48,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2024-11-19 07:03:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:48,081 INFO L225 Difference]: With dead ends: 129 [2024-11-19 07:03:48,081 INFO L226 Difference]: Without dead ends: 129 [2024-11-19 07:03:48,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:03:48,083 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 31 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:48,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 334 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-19 07:03:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-19 07:03:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 128 states have internal predecessors, (134), 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 07:03:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2024-11-19 07:03:48,087 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 10 [2024-11-19 07:03:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:48,087 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2024-11-19 07:03:48,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 07:03:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2024-11-19 07:03:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 07:03:48,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:48,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:48,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 07:03:48,088 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:48,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2024-11-19 07:03:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518911149] [2024-11-19 07:03:48,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:48,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:48,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:48,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518911149] [2024-11-19 07:03:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518911149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:48,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176144212] [2024-11-19 07:03:48,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:48,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:48,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:48,161 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 07:03:48,163 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 07:03:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:48,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:03:48,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:48,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:48,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176144212] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:48,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:48,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-19 07:03:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792274402] [2024-11-19 07:03:48,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:48,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:03:48,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:48,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:03:48,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:48,379 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 07:03:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:48,404 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2024-11-19 07:03:48,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:03:48,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 14 [2024-11-19 07:03:48,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:48,405 INFO L225 Difference]: With dead ends: 131 [2024-11-19 07:03:48,405 INFO L226 Difference]: Without dead ends: 131 [2024-11-19 07:03:48,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:48,406 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 6 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:48,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 254 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-19 07:03:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-19 07:03:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 130 states have internal predecessors, (136), 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 07:03:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2024-11-19 07:03:48,416 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 14 [2024-11-19 07:03:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:48,417 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2024-11-19 07:03:48,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 07:03:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2024-11-19 07:03:48,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 07:03:48,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:48,417 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:48,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 07:03:48,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:48,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:48,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2024-11-19 07:03:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:48,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835136975] [2024-11-19 07:03:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:48,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:48,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835136975] [2024-11-19 07:03:48,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835136975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:48,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367465675] [2024-11-19 07:03:48,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:48,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:48,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:48,684 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 07:03:48,685 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 07:03:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:48,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 07:03:48,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:48,789 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 07:03:48,826 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:03:48,827 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 07:03:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:48,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:48,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367465675] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:48,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:48,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-19 07:03:48,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691977566] [2024-11-19 07:03:48,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:48,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:03:48,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:48,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:03:48,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:48,927 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 07:03:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:49,073 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2024-11-19 07:03:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:03:49,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 15 [2024-11-19 07:03:49,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:49,074 INFO L225 Difference]: With dead ends: 129 [2024-11-19 07:03:49,074 INFO L226 Difference]: Without dead ends: 129 [2024-11-19 07:03:49,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:49,074 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 7 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:49,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 273 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-19 07:03:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-19 07:03:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 128 states have internal predecessors, (134), 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 07:03:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2024-11-19 07:03:49,077 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 15 [2024-11-19 07:03:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:49,081 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2024-11-19 07:03:49,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 07:03:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2024-11-19 07:03:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 07:03:49,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:49,084 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:49,103 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 07:03:49,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 07:03:49,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:49,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2024-11-19 07:03:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:49,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743616854] [2024-11-19 07:03:49,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:49,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:49,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:49,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743616854] [2024-11-19 07:03:49,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743616854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:49,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320474480] [2024-11-19 07:03:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:49,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:49,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:49,511 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 07:03:49,512 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 07:03:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:49,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 07:03:49,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:49,592 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 07:03:49,640 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:03:49,640 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 07:03:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:49,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:49,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320474480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:49,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:49,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 9 [2024-11-19 07:03:49,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585798700] [2024-11-19 07:03:49,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:49,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:03:49,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:49,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:03:49,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:49,754 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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 07:03:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:49,910 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2024-11-19 07:03:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:03:49,911 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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 15 [2024-11-19 07:03:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:49,911 INFO L225 Difference]: With dead ends: 127 [2024-11-19 07:03:49,911 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 07:03:49,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-19 07:03:49,912 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 15 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:49,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 766 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 07:03:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-19 07:03:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 126 states have internal predecessors, (132), 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 07:03:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2024-11-19 07:03:49,914 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 15 [2024-11-19 07:03:49,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:49,914 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2024-11-19 07:03:49,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 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 07:03:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2024-11-19 07:03:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:03:49,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:49,915 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:49,932 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 07:03:50,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:50,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:50,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:50,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2024-11-19 07:03:50,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:50,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739869978] [2024-11-19 07:03:50,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:03:50,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:50,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739869978] [2024-11-19 07:03:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739869978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:50,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:50,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:03:50,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545809823] [2024-11-19 07:03:50,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:50,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:50,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:50,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:50,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:50,293 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 07:03:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:50,448 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2024-11-19 07:03:50,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:03:50,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 22 [2024-11-19 07:03:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:50,449 INFO L225 Difference]: With dead ends: 124 [2024-11-19 07:03:50,449 INFO L226 Difference]: Without dead ends: 124 [2024-11-19 07:03:50,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:03:50,450 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 24 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:50,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 373 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-19 07:03:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-19 07:03:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 123 states have internal predecessors, (129), 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 07:03:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2024-11-19 07:03:50,452 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 22 [2024-11-19 07:03:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:50,452 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2024-11-19 07:03:50,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 07:03:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2024-11-19 07:03:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:03:50,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:50,459 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:50,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 07:03:50,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:50,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:50,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2024-11-19 07:03:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:50,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067040744] [2024-11-19 07:03:50,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:50,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:03:50,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:50,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067040744] [2024-11-19 07:03:50,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067040744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:50,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:50,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:03:50,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112261053] [2024-11-19 07:03:50,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:50,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:50,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:50,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:50,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:50,643 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 07:03:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:50,740 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2024-11-19 07:03:50,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:03:50,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2024-11-19 07:03:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:50,741 INFO L225 Difference]: With dead ends: 117 [2024-11-19 07:03:50,742 INFO L226 Difference]: Without dead ends: 117 [2024-11-19 07:03:50,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:03:50,744 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 38 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:50,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 433 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-19 07:03:50,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-19 07:03:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 116 states have internal predecessors, (122), 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 07:03:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2024-11-19 07:03:50,748 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 22 [2024-11-19 07:03:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:50,748 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2024-11-19 07:03:50,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 07:03:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2024-11-19 07:03:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:03:50,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:50,749 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:50,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 07:03:50,750 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:50,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2024-11-19 07:03:50,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:50,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125916247] [2024-11-19 07:03:50,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:03:50,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:50,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125916247] [2024-11-19 07:03:50,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125916247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:50,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:03:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578001750] [2024-11-19 07:03:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:50,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:50,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:50,841 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 07:03:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:50,952 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2024-11-19 07:03:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:03:50,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2024-11-19 07:03:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:50,953 INFO L225 Difference]: With dead ends: 112 [2024-11-19 07:03:50,953 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 07:03:50,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:03:50,953 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:50,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 301 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 07:03:50,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 07:03:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 111 states have internal predecessors, (117), 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 07:03:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2024-11-19 07:03:50,955 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 28 [2024-11-19 07:03:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:50,956 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2024-11-19 07:03:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 07:03:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2024-11-19 07:03:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:03:50,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:50,956 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:50,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 07:03:50,957 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:50,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:50,957 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2024-11-19 07:03:50,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:50,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388503504] [2024-11-19 07:03:50,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:50,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:03:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388503504] [2024-11-19 07:03:51,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388503504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:51,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:51,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:03:51,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316364526] [2024-11-19 07:03:51,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:51,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:03:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:51,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:03:51,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:03:51,342 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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 07:03:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:51,469 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2024-11-19 07:03:51,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 07:03:51,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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 28 [2024-11-19 07:03:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:51,470 INFO L225 Difference]: With dead ends: 107 [2024-11-19 07:03:51,470 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 07:03:51,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-19 07:03:51,471 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 76 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:51,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 504 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 07:03:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-19 07:03:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 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 07:03:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2024-11-19 07:03:51,474 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 28 [2024-11-19 07:03:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:51,474 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2024-11-19 07:03:51,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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 07:03:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2024-11-19 07:03:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:03:51,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:51,475 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:51,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 07:03:51,475 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:51,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:51,476 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2024-11-19 07:03:51,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553262031] [2024-11-19 07:03:51,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:51,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:51,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:51,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553262031] [2024-11-19 07:03:51,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553262031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:51,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032942841] [2024-11-19 07:03:51,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:51,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:51,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:51,874 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 07:03:51,877 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 07:03:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:51,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 07:03:51,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:51,968 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 07:03:52,058 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-19 07:03:52,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 07:03:52,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:03:52,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:03:52,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:03:52,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 07:03:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:52,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:52,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:52,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-19 07:03:52,409 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 122 treesize of output 110 [2024-11-19 07:03:52,419 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 23 treesize of output 21 [2024-11-19 07:03:52,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-19 07:03:52,658 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:03:52,659 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 25 treesize of output 24 [2024-11-19 07:03:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:52,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032942841] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:52,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:52,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 28 [2024-11-19 07:03:52,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875750556] [2024-11-19 07:03:52,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:52,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 07:03:52,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:52,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 07:03:52,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=693, Unknown=27, NotChecked=0, Total=812 [2024-11-19 07:03:52,666 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 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 07:03:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:53,196 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2024-11-19 07:03:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 07:03:53,197 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 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 28 [2024-11-19 07:03:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:53,197 INFO L225 Difference]: With dead ends: 105 [2024-11-19 07:03:53,197 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 07:03:53,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1245, Unknown=28, NotChecked=0, Total=1482 [2024-11-19 07:03:53,198 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 75 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:53,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1182 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 07:03:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 07:03:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2024-11-19 07:03:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 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 07:03:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-19 07:03:53,200 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 28 [2024-11-19 07:03:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:53,201 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-19 07:03:53,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 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 07:03:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-19 07:03:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:03:53,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:53,201 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:53,218 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 07:03:53,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 07:03:53,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:53,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:53,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2024-11-19 07:03:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:53,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410716836] [2024-11-19 07:03:53,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:53,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:03:53,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:53,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410716836] [2024-11-19 07:03:53,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410716836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:53,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:53,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:03:53,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195276721] [2024-11-19 07:03:53,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:53,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:03:53,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:53,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:03:53,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:03:53,852 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 07:03:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:54,174 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-11-19 07:03:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 07:03:54,178 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 29 [2024-11-19 07:03:54,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:54,179 INFO L225 Difference]: With dead ends: 97 [2024-11-19 07:03:54,179 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 07:03:54,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-19 07:03:54,179 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 70 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:54,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 288 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 07:03:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 07:03:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 07:03:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 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 07:03:54,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-19 07:03:54,181 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 29 [2024-11-19 07:03:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:54,181 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-19 07:03:54,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 07:03:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-19 07:03:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:03:54,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:54,186 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:54,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 07:03:54,186 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:54,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:54,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2024-11-19 07:03:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868371369] [2024-11-19 07:03:54,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:54,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:54,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868371369] [2024-11-19 07:03:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868371369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:54,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225514780] [2024-11-19 07:03:54,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:54,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:54,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:54,669 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 07:03:54,670 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 07:03:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:54,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-19 07:03:54,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:54,755 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 07:03:54,798 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:03:54,798 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 07:03:54,854 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-19 07:03:54,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 07:03:54,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 07:03:54,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:03:55,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2024-11-19 07:03:55,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2024-11-19 07:03:55,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:55,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 31 [2024-11-19 07:03:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:55,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:55,315 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-19 07:03:55,354 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_584) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-19 07:03:55,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:55,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-19 07:03:55,363 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 121 treesize of output 109 [2024-11-19 07:03:55,367 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 27 treesize of output 25 [2024-11-19 07:03:55,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-19 07:03:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 07:03:55,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225514780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:55,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:55,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 33 [2024-11-19 07:03:55,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31981403] [2024-11-19 07:03:55,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:55,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-19 07:03:55,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:55,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-19 07:03:55,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=885, Unknown=4, NotChecked=122, Total=1122 [2024-11-19 07:03:55,554 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 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 07:03:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:56,307 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2024-11-19 07:03:56,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 07:03:56,308 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 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 29 [2024-11-19 07:03:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:56,308 INFO L225 Difference]: With dead ends: 95 [2024-11-19 07:03:56,308 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 07:03:56,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=1355, Unknown=4, NotChecked=154, Total=1722 [2024-11-19 07:03:56,309 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 97 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:56,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 732 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1154 Invalid, 0 Unknown, 168 Unchecked, 0.5s Time] [2024-11-19 07:03:56,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 07:03:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-19 07:03:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 91 states have internal predecessors, (97), 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 07:03:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-19 07:03:56,311 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 29 [2024-11-19 07:03:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:56,311 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-19 07:03:56,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 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 07:03:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-19 07:03:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:03:56,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:56,312 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:56,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 07:03:56,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 07:03:56,516 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:56,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2024-11-19 07:03:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:56,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270544704] [2024-11-19 07:03:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:03:56,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:56,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270544704] [2024-11-19 07:03:56,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270544704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:56,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:56,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:03:56,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812816902] [2024-11-19 07:03:56,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:56,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:03:56,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:03:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:03:56,712 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 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 07:03:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:56,865 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-19 07:03:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 07:03:56,865 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 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 30 [2024-11-19 07:03:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:56,866 INFO L225 Difference]: With dead ends: 91 [2024-11-19 07:03:56,866 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 07:03:56,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-19 07:03:56,866 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:56,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 309 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 07:03:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-19 07:03:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 90 states have internal predecessors, (96), 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 07:03:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-11-19 07:03:56,868 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 30 [2024-11-19 07:03:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:56,868 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-11-19 07:03:56,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 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 07:03:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-11-19 07:03:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:03:56,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:56,869 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:56,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 07:03:56,869 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:03:56,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2024-11-19 07:03:56,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:56,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942099188] [2024-11-19 07:03:56,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:57,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:57,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942099188] [2024-11-19 07:03:57,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942099188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:57,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11651107] [2024-11-19 07:03:57,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:57,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:57,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:57,191 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 07:03:57,196 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 07:03:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:57,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 07:03:57,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:57,301 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 07:03:57,324 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:03:57,324 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 07:03:57,372 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-19 07:03:57,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 07:03:57,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:03:57,431 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:57,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 07:03:57,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-19 07:03:57,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-19 07:03:57,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:57,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 17 [2024-11-19 07:03:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:57,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:57,609 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2024-11-19 07:03:57,669 INFO L349 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2024-11-19 07:03:57,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2024-11-19 07:04:01,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:01,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-19 07:04:01,741 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 122 treesize of output 110 [2024-11-19 07:04:01,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-19 07:04:01,754 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 5 treesize of output 3 [2024-11-19 07:04:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-19 07:04:01,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11651107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:01,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:01,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 28 [2024-11-19 07:04:01,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671121606] [2024-11-19 07:04:01,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:01,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 07:04:01,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:01,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 07:04:01,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=660, Unknown=20, NotChecked=52, Total=812 [2024-11-19 07:04:01,802 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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 07:04:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:06,387 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-19 07:04:06,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 07:04:06,387 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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 30 [2024-11-19 07:04:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:06,387 INFO L225 Difference]: With dead ends: 90 [2024-11-19 07:04:06,388 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 07:04:06,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=185, Invalid=1128, Unknown=23, NotChecked=70, Total=1406 [2024-11-19 07:04:06,389 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 37 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:06,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 945 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 828 Invalid, 0 Unknown, 60 Unchecked, 0.4s Time] [2024-11-19 07:04:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 07:04:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-19 07:04:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 89 states have internal predecessors, (95), 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 07:04:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-19 07:04:06,392 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 30 [2024-11-19 07:04:06,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:06,392 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-19 07:04:06,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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 07:04:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-19 07:04:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:04:06,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:06,393 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:06,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 07:04:06,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:06,594 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:04:06,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2024-11-19 07:04:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:06,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917289494] [2024-11-19 07:04:06,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:07,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:07,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917289494] [2024-11-19 07:04:07,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917289494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:07,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854922263] [2024-11-19 07:04:07,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:07,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:07,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:07,021 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 07:04:07,022 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 07:04:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:07,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 07:04:07,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:07,179 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:04:07,179 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 07:04:07,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 07:04:07,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:07,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-19 07:04:07,502 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 07:04:07,503 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 18 treesize of output 13 [2024-11-19 07:04:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:07,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:07,648 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 13 treesize of output 11 [2024-11-19 07:04:07,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-19 07:04:07,671 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 6 treesize of output 4 [2024-11-19 07:04:07,723 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:04:07,724 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 13 treesize of output 12 [2024-11-19 07:04:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:07,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854922263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:07,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:07,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 28 [2024-11-19 07:04:07,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109834206] [2024-11-19 07:04:07,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:07,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 07:04:07,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:07,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 07:04:07,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2024-11-19 07:04:07,747 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 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 07:04:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:08,273 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-19 07:04:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 07:04:08,274 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 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 33 [2024-11-19 07:04:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:08,281 INFO L225 Difference]: With dead ends: 89 [2024-11-19 07:04:08,285 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 07:04:08,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 07:04:08,286 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:08,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 686 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 07:04:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 07:04:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 07:04:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 88 states have internal predecessors, (94), 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 07:04:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-19 07:04:08,296 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 33 [2024-11-19 07:04:08,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:08,296 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-19 07:04:08,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 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 07:04:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-19 07:04:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:04:08,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:08,296 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:08,315 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 07:04:08,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:08,497 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:04:08,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2024-11-19 07:04:08,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598551755] [2024-11-19 07:04:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:08,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:08,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598551755] [2024-11-19 07:04:08,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598551755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:08,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154222356] [2024-11-19 07:04:08,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:08,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:08,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:08,925 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 07:04:08,929 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 07:04:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:09,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 07:04:09,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:09,034 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 07:04:09,099 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-19 07:04:09,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 07:04:09,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:04:09,125 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:04:09,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 07:04:09,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-19 07:04:09,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-19 07:04:09,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:09,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 33 treesize of output 33 [2024-11-19 07:04:09,398 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 07:04:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:09,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:09,681 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_873 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)) (forall ((v_ArrVal_873 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-19 07:04:09,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:09,692 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 47 treesize of output 51 [2024-11-19 07:04:09,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_872) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) is different from false [2024-11-19 07:04:09,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:09,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-19 07:04:09,724 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 85 treesize of output 81 [2024-11-19 07:04:09,729 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 100 treesize of output 96 [2024-11-19 07:04:09,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:09,751 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 94 treesize of output 98 [2024-11-19 07:04:09,757 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 85 treesize of output 83 [2024-11-19 07:04:09,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:09,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-19 07:04:09,787 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:04:09,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-19 07:04:09,796 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:04:09,796 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 34 treesize of output 33 [2024-11-19 07:04:09,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:04:09,898 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:04:09,899 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 25 treesize of output 24 [2024-11-19 07:04:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-19 07:04:09,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154222356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:09,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:09,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 36 [2024-11-19 07:04:09,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459544888] [2024-11-19 07:04:09,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:09,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-19 07:04:09,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:09,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 07:04:09,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=8, NotChecked=134, Total=1332 [2024-11-19 07:04:09,903 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 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 07:04:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:10,742 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-19 07:04:10,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 07:04:10,743 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 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 33 [2024-11-19 07:04:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:10,743 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:04:10,743 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:04:10,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=2024, Unknown=9, NotChecked=186, Total=2450 [2024-11-19 07:04:10,744 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 87 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:10,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 927 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1035 Invalid, 0 Unknown, 106 Unchecked, 0.5s Time] [2024-11-19 07:04:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:04:10,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-19 07:04:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 87 states have internal predecessors, (93), 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 07:04:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-19 07:04:10,746 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 33 [2024-11-19 07:04:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:10,747 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-19 07:04:10,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 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 07:04:10,747 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-19 07:04:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:04:10,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:10,747 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:10,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 07:04:10,948 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,SelfDestructingSolverStorable20 [2024-11-19 07:04:10,948 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:04:10,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:10,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2024-11-19 07:04:10,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:10,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143372891] [2024-11-19 07:04:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:10,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143372891] [2024-11-19 07:04:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143372891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641937093] [2024-11-19 07:04:11,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:11,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:11,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:11,519 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 07:04:11,520 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 07:04:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:11,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-19 07:04:11,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:11,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 07:04:11,673 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 07:04:11,674 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 07:04:11,766 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 07:04:11,767 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 07:04:11,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:04:11,834 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:04:11,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-19 07:04:11,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 07:04:11,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-11-19 07:04:12,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:12,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 24 [2024-11-19 07:04:12,128 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 07:04:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:12,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:12,482 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_960 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_ArrVal_960 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1))) is different from false [2024-11-19 07:04:12,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:12,491 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 37 treesize of output 41 [2024-11-19 07:04:12,515 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_959) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2024-11-19 07:04:12,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:12,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-19 07:04:12,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-11-19 07:04:12,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-19 07:04:12,527 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 38 treesize of output 34 [2024-11-19 07:04:12,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:12,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-19 07:04:12,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:04:12,545 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:04:12,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 07:04:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-19 07:04:12,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641937093] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:12,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 48 [2024-11-19 07:04:12,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764289540] [2024-11-19 07:04:12,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:12,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-19 07:04:12,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:12,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-19 07:04:12,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1991, Unknown=15, NotChecked=182, Total=2352 [2024-11-19 07:04:12,897 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 49 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 49 states have internal predecessors, (79), 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 07:04:14,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:14,367 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-19 07:04:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 07:04:14,368 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 49 states have internal predecessors, (79), 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 34 [2024-11-19 07:04:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:14,368 INFO L225 Difference]: With dead ends: 90 [2024-11-19 07:04:14,368 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 07:04:14,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=411, Invalid=3871, Unknown=16, NotChecked=258, Total=4556 [2024-11-19 07:04:14,369 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 98 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:14,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1178 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1731 Invalid, 0 Unknown, 116 Unchecked, 0.8s Time] [2024-11-19 07:04:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 07:04:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-19 07:04:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 86 states have internal predecessors, (92), 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 07:04:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-19 07:04:14,371 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 34 [2024-11-19 07:04:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:14,371 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-19 07:04:14,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 49 states have internal predecessors, (79), 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 07:04:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-19 07:04:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:04:14,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:14,373 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:14,386 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 07:04:14,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:14,577 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:04:14,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:14,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1554055919, now seen corresponding path program 1 times [2024-11-19 07:04:14,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:14,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443028137] [2024-11-19 07:04:14,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:14,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:14,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443028137] [2024-11-19 07:04:14,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443028137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:14,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372783815] [2024-11-19 07:04:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:14,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:14,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:14,923 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 07:04:14,925 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 07:04:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:15,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 07:04:15,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:15,031 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 07:04:15,056 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 07:04:15,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 07:04:15,075 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 07:04:15,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 07:04:15,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 07:04:15,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:15,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2024-11-19 07:04:15,428 INFO L349 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2024-11-19 07:04:15,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 64 [2024-11-19 07:04:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:04:15,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:04:15,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372783815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:04:15,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:04:15,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 24 [2024-11-19 07:04:15,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486994174] [2024-11-19 07:04:15,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:04:15,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 07:04:15,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:15,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 07:04:15,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2024-11-19 07:04:15,602 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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 07:04:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:16,004 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-19 07:04:16,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 07:04:16,004 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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 34 [2024-11-19 07:04:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:16,004 INFO L225 Difference]: With dead ends: 86 [2024-11-19 07:04:16,004 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 07:04:16,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2024-11-19 07:04:16,005 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:16,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 384 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 07:04:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 07:04:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-19 07:04:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 85 states have internal predecessors, (91), 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 07:04:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-19 07:04:16,007 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 34 [2024-11-19 07:04:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:16,007 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-19 07:04:16,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 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 07:04:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-19 07:04:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:04:16,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:16,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:16,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 07:04:16,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 07:04:16,212 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:04:16,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:16,212 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2024-11-19 07:04:16,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:16,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080291482] [2024-11-19 07:04:16,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:16,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:16,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:16,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080291482] [2024-11-19 07:04:16,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080291482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:16,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794940991] [2024-11-19 07:04:16,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:16,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:16,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:16,791 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:04:16,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 07:04:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:16,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-19 07:04:16,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:16,908 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 07:04:16,936 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 07:04:16,937 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 07:04:16,994 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 07:04:16,994 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 07:04:17,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:04:17,051 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:04:17,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-19 07:04:17,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-19 07:04:17,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-19 07:04:17,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:17,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 24 [2024-11-19 07:04:17,329 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 07:04:17,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:17,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:17,527 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 6 treesize of output 4 [2024-11-19 07:04:17,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:17,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-19 07:04:17,693 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 65 treesize of output 57 [2024-11-19 07:04:17,698 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 6 treesize of output 4 [2024-11-19 07:04:17,703 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 6 treesize of output 4 [2024-11-19 07:04:17,706 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 6 treesize of output 4 [2024-11-19 07:04:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794940991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:17,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 46 [2024-11-19 07:04:17,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980025068] [2024-11-19 07:04:17,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:17,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-19 07:04:17,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:17,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-19 07:04:17,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1949, Unknown=43, NotChecked=0, Total=2162 [2024-11-19 07:04:17,892 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 47 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 47 states have internal predecessors, (79), 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 07:04:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:18,769 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-19 07:04:18,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 07:04:18,770 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 47 states have internal predecessors, (79), 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 34 [2024-11-19 07:04:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:18,770 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:04:18,770 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:04:18,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=356, Invalid=3259, Unknown=45, NotChecked=0, Total=3660 [2024-11-19 07:04:18,771 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 125 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:18,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 809 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 07:04:18,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:04:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-19 07:04:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 84 states have internal predecessors, (90), 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 07:04:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-19 07:04:18,773 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 34 [2024-11-19 07:04:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:18,773 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-19 07:04:18,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 47 states have internal predecessors, (79), 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 07:04:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-19 07:04:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:04:18,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:18,773 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:04:18,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 07:04:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 07:04:18,974 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:04:18,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2024-11-19 07:04:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:18,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166198878] [2024-11-19 07:04:18,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:19,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:19,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166198878] [2024-11-19 07:04:19,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166198878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:19,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490898927] [2024-11-19 07:04:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:19,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:19,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:19,640 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:04:19,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 07:04:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:19,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 07:04:19,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:19,846 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 07:04:19,887 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:04:19,887 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 07:04:19,931 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-19 07:04:19,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 07:04:19,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:04:20,000 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:04:20,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-19 07:04:20,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-19 07:04:20,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:04:20,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-19 07:04:20,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:04:20,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:20,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 30 [2024-11-19 07:04:20,322 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 07:04:20,323 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 07:04:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:20,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:28,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-19 07:04:28,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:28,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-19 07:04:28,798 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 85 treesize of output 81 [2024-11-19 07:04:28,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:28,806 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 94 treesize of output 98 [2024-11-19 07:04:28,811 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 85 treesize of output 83 [2024-11-19 07:04:28,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2024-11-19 07:04:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490898927] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:28,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:28,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 40 [2024-11-19 07:04:28,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625442280] [2024-11-19 07:04:28,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:28,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-19 07:04:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-19 07:04:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1480, Unknown=24, NotChecked=0, Total=1640 [2024-11-19 07:04:28,987 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 41 states, 40 states have (on average 2.3) internal successors, (92), 41 states have internal predecessors, (92), 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 07:04:37,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 07:04:45,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 07:04:49,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 07:04:57,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 07:05:01,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 07:05:05,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 07:05:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:17,918 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-19 07:05:17,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 07:05:17,919 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.3) internal successors, (92), 41 states have internal predecessors, (92), 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 34 [2024-11-19 07:05:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:17,919 INFO L225 Difference]: With dead ends: 84 [2024-11-19 07:05:17,919 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 07:05:17,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=308, Invalid=2632, Unknown=30, NotChecked=0, Total=2970 [2024-11-19 07:05:17,920 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 77 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 15 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:17,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 987 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 910 Invalid, 6 Unknown, 0 Unchecked, 24.5s Time] [2024-11-19 07:05:17,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 07:05:17,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 07:05:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.155844155844156) internal successors, (89), 83 states have internal predecessors, (89), 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 07:05:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-19 07:05:17,922 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 34 [2024-11-19 07:05:17,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:17,922 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-19 07:05:17,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.3) internal successors, (92), 41 states have internal predecessors, (92), 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 07:05:17,923 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-19 07:05:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 07:05:17,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:17,923 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:17,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 07:05:18,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 07:05:18,127 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:05:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2024-11-19 07:05:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532953475] [2024-11-19 07:05:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:18,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532953475] [2024-11-19 07:05:18,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532953475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:05:18,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351328740] [2024-11-19 07:05:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:18,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:05:18,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:05:18,702 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:05:18,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 07:05:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:18,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-19 07:05:18,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:05:18,833 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 07:05:18,881 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 07:05:18,881 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 07:05:18,968 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 07:05:18,968 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 07:05:18,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:05:19,050 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:05:19,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-19 07:05:19,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-19 07:05:19,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-19 07:05:19,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:05:19,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:05:19,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-19 07:05:19,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 07:05:19,642 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 07:05:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:19,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:05:20,052 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1307 (Array Int Int))) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 4) (select .cse0 0))))) (forall ((v_ArrVal_1307 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)) (forall ((v_ArrVal_1307 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2024-11-19 07:05:20,071 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1307 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1307 (Array Int Int))) (not (let ((.cse1 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 0) (select .cse1 4))))) (forall ((v_ArrVal_1307 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)))) is different from false [2024-11-19 07:05:20,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:05:20,081 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 81 treesize of output 85 [2024-11-19 07:05:20,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 0) (select .cse0 4))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2024-11-19 07:05:20,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:05:20,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-19 07:05:20,113 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 171 treesize of output 165 [2024-11-19 07:05:20,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:05:20,119 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 94 treesize of output 98 [2024-11-19 07:05:20,123 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 85 treesize of output 83 [2024-11-19 07:05:20,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2024-11-19 07:05:20,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:05:20,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2024-11-19 07:05:20,152 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:05:20,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2024-11-19 07:05:20,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 77 [2024-11-19 07:05:20,162 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:05:20,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:05:20,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 108 [2024-11-19 07:05:20,187 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 07:05:20,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2024-11-19 07:05:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-19 07:05:20,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351328740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:05:20,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:05:20,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 19] total 54 [2024-11-19 07:05:20,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876458927] [2024-11-19 07:05:20,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:05:20,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-19 07:05:20,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:05:20,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-19 07:05:20,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2470, Unknown=3, NotChecked=306, Total=2970 [2024-11-19 07:05:20,399 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 55 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 55 states have internal predecessors, (89), 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 07:05:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:05:22,004 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-19 07:05:22,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-19 07:05:22,004 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 55 states have internal predecessors, (89), 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 36 [2024-11-19 07:05:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:05:22,005 INFO L225 Difference]: With dead ends: 86 [2024-11-19 07:05:22,005 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 07:05:22,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=400, Invalid=4301, Unknown=3, NotChecked=408, Total=5112 [2024-11-19 07:05:22,006 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 110 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 07:05:22,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 930 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1711 Invalid, 0 Unknown, 202 Unchecked, 0.9s Time] [2024-11-19 07:05:22,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 07:05:22,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-19 07:05:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 82 states have internal predecessors, (88), 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 07:05:22,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-11-19 07:05:22,008 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 36 [2024-11-19 07:05:22,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:05:22,008 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-11-19 07:05:22,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 55 states have internal predecessors, (89), 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 07:05:22,008 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-11-19 07:05:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 07:05:22,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:05:22,009 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:05:22,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-19 07:05:22,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-19 07:05:22,213 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-19 07:05:22,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:05:22,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1608865938, now seen corresponding path program 1 times [2024-11-19 07:05:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:05:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85159519] [2024-11-19 07:05:22,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:05:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:05:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85159519] [2024-11-19 07:05:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85159519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:05:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856773180] [2024-11-19 07:05:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:05:22,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:05:22,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:05:22,991 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:05:22,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 07:05:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:05:23,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-19 07:05:23,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:05:23,121 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 07:05:23,169 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 07:05:23,169 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 07:05:23,244 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 07:05:23,245 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 07:05:23,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:05:23,303 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:05:23,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-19 07:05:23,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-19 07:05:23,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-19 07:05:23,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:05:23,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:05:23,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-19 07:05:23,748 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 07:05:23,748 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 1 case distinctions, treesize of input 22 treesize of output 17 [2024-11-19 07:05:23,778 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 07:05:23,779 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 18 treesize of output 13 [2024-11-19 07:05:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:05:23,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:05:24,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:05:24,272 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 116 treesize of output 120 [2024-11-19 07:05:24,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:05:24,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2024-11-19 07:05:24,576 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 231 treesize of output 221 [2024-11-19 07:05:24,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 129 [2024-11-19 07:05:24,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:05:24,600 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 166 treesize of output 172 [2024-11-19 07:05:24,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 192