./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/selectionsort-alloca-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/array-memsafety/selectionsort-alloca-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 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:33:10,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:33:10,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:33:10,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:33:10,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:33:10,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:33:10,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:33:10,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:33:10,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:33:10,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:33:10,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:33:10,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:33:10,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:33:10,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:33:10,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:33:10,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:33:10,289 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:33:10,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:33:10,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:33:10,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:33:10,290 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:33:10,292 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:33:10,292 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:33:10,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:33:10,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:33:10,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:33:10,293 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:33:10,294 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:33:10,294 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:33:10,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:33:10,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:33:10,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:33:10,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:33:10,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:33:10,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:33:10,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:33:10,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:33:10,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:33:10,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:33:10,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:33:10,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:33:10,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:33:10,299 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 -> 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 [2024-11-19 06:33:10,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:33:10,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:33:10,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:33:10,577 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:33:10,577 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:33:10,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2024-11-19 06:33:12,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:33:12,238 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:33:12,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2024-11-19 06:33:12,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138c470d1/3c62c80526e74b0a954b970e0dca8793/FLAGbd3818244 [2024-11-19 06:33:12,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138c470d1/3c62c80526e74b0a954b970e0dca8793 [2024-11-19 06:33:12,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:33:12,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:33:12,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:33:12,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:33:12,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:33:12,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4731d632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12, skipping insertion in model container [2024-11-19 06:33:12,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:33:12,610 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:33:12,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:33:12,623 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:33:12,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:33:12,688 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:33:12,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12 WrapperNode [2024-11-19 06:33:12,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:33:12,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:33:12,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:33:12,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:33:12,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,731 INFO L138 Inliner]: procedures = 116, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-11-19 06:33:12,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:33:12,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:33:12,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:33:12,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:33:12,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,766 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-11-19 06:33:12,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:33:12,778 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:33:12,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:33:12,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:33:12,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (1/1) ... [2024-11-19 06:33:12,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:33:12,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:12,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:33:12,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:33:12,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:33:12,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:33:12,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:33:12,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:33:12,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:33:12,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:33:13,032 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:33:13,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:33:13,262 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-19 06:33:13,262 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:33:13,276 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:33:13,277 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 06:33:13,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:13 BoogieIcfgContainer [2024-11-19 06:33:13,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:33:13,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:33:13,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:33:13,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:33:13,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:33:12" (1/3) ... [2024-11-19 06:33:13,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307a0c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:33:13, skipping insertion in model container [2024-11-19 06:33:13,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:12" (2/3) ... [2024-11-19 06:33:13,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307a0c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:33:13, skipping insertion in model container [2024-11-19 06:33:13,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:13" (3/3) ... [2024-11-19 06:33:13,288 INFO L112 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca-1.i [2024-11-19 06:33:13,306 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:33:13,306 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-19 06:33:13,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:33:13,355 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;@6c81a664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:33:13,356 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-19 06:33:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:33:13,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:13,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:33:13,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:13,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2024-11-19 06:33:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:13,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510451789] [2024-11-19 06:33:13,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:13,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:13,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:13,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510451789] [2024-11-19 06:33:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510451789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:13,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:13,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:33:13,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790695486] [2024-11-19 06:33:13,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:13,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:33:13,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:13,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:33:13,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:33:13,656 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 41 states have internal predecessors, (49), 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:13,712 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-19 06:33:13,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:33:13,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-19 06:33:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:13,723 INFO L225 Difference]: With dead ends: 41 [2024-11-19 06:33:13,723 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 06:33:13,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:33:13,730 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:13,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 06:33:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-19 06:33:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.72) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-19 06:33:13,761 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 6 [2024-11-19 06:33:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:13,761 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-19 06:33:13,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:13,762 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-11-19 06:33:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:33:13,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:13,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:33:13,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:33:13,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:13,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash 889508874, now seen corresponding path program 1 times [2024-11-19 06:33:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:13,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398338960] [2024-11-19 06:33:13,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:13,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:14,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:14,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398338960] [2024-11-19 06:33:14,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398338960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:14,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:14,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:33:14,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319059222] [2024-11-19 06:33:14,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:14,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:33:14,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:14,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:33:14,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:33:14,050 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:14,136 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-11-19 06:33:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:33:14,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2024-11-19 06:33:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:14,138 INFO L225 Difference]: With dead ends: 50 [2024-11-19 06:33:14,139 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 06:33:14,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:33:14,141 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:14,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 100 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:33:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 06:33:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2024-11-19 06:33:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-19 06:33:14,151 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 6 [2024-11-19 06:33:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:14,152 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-19 06:33:14,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-11-19 06:33:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:33:14,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:14,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:33:14,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:33:14,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:14,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2024-11-19 06:33:14,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:14,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365869127] [2024-11-19 06:33:14,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:14,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:14,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365869127] [2024-11-19 06:33:14,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365869127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:14,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:14,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:33:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110604773] [2024-11-19 06:33:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:14,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:33:14,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:14,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:33:14,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:33:14,489 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:14,573 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2024-11-19 06:33:14,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:33:14,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 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 6 [2024-11-19 06:33:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:14,577 INFO L225 Difference]: With dead ends: 46 [2024-11-19 06:33:14,577 INFO L226 Difference]: Without dead ends: 46 [2024-11-19 06:33:14,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:33:14,578 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:14,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:33:14,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-19 06:33:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2024-11-19 06:33:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-11-19 06:33:14,587 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 6 [2024-11-19 06:33:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:14,587 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-19 06:33:14,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-11-19 06:33:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:33:14,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:14,589 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:14,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:33:14,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:14,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1091210163, now seen corresponding path program 1 times [2024-11-19 06:33:14,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:14,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109063424] [2024-11-19 06:33:14,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:14,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:14,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109063424] [2024-11-19 06:33:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109063424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:33:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320403373] [2024-11-19 06:33:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:14,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:14,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:33:14,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:33:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:14,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:33:14,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:33:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:14,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:33:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320403373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:33:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 06:33:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092384977] [2024-11-19 06:33:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:14,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:33:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:33:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:33:14,829 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) 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 06:33:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:14,865 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-11-19 06:33:14,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:33:14,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) 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 06:33:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:14,866 INFO L225 Difference]: With dead ends: 48 [2024-11-19 06:33:14,867 INFO L226 Difference]: Without dead ends: 48 [2024-11-19 06:33:14,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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 06:33:14,869 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:14,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 107 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-19 06:33:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-19 06:33:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-11-19 06:33:14,880 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 10 [2024-11-19 06:33:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:14,880 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-11-19 06:33:14,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) 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 06:33:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-11-19 06:33:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:33:14,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:14,883 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:14,900 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 06:33:15,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:15,084 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:15,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2024-11-19 06:33:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362884448] [2024-11-19 06:33:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:15,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:15,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362884448] [2024-11-19 06:33:15,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362884448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:33:15,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492055675] [2024-11-19 06:33:15,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:15,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:15,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:15,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:33:15,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:33:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:15,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 06:33:15,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:33:15,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-19 06:33:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:15,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:33:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:16,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492055675] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:33:16,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:33:16,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-11-19 06:33:16,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328407217] [2024-11-19 06:33:16,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:33:16,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 06:33:16,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:16,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 06:33:16,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:33:16,074 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 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 06:33:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:16,324 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2024-11-19 06:33:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:33:16,326 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 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 10 [2024-11-19 06:33:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:16,327 INFO L225 Difference]: With dead ends: 52 [2024-11-19 06:33:16,327 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 06:33:16,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:33:16,328 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:16,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 205 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:33:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 06:33:16,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2024-11-19 06:33:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.53125) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-11-19 06:33:16,337 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 10 [2024-11-19 06:33:16,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:16,337 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-11-19 06:33:16,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 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 06:33:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-11-19 06:33:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:33:16,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:16,338 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:16,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:33:16,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:16,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:16,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:16,540 INFO L85 PathProgramCache]: Analyzing trace with hash 363893261, now seen corresponding path program 1 times [2024-11-19 06:33:16,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:16,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101497228] [2024-11-19 06:33:16,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:16,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:33:16,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:16,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101497228] [2024-11-19 06:33:16,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101497228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:16,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:16,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:33:16,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69698955] [2024-11-19 06:33:16,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:16,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:33:16,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:16,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:33:16,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:33:16,631 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:16,669 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-11-19 06:33:16,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:33:16,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-19 06:33:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:16,671 INFO L225 Difference]: With dead ends: 44 [2024-11-19 06:33:16,671 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 06:33:16,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:33:16,672 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:16,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 50 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 06:33:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-19 06:33:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-19 06:33:16,680 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2024-11-19 06:33:16,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:16,680 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-19 06:33:16,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-11-19 06:33:16,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:33:16,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:16,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:16,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:33:16,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:16,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash 363893953, now seen corresponding path program 1 times [2024-11-19 06:33:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:16,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156645205] [2024-11-19 06:33:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:16,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:16,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156645205] [2024-11-19 06:33:16,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156645205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:16,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:16,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:33:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561670337] [2024-11-19 06:33:16,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:16,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:33:16,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:16,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:33:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:33:16,730 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:16,765 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-19 06:33:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:33:16,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-19 06:33:16,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:16,766 INFO L225 Difference]: With dead ends: 36 [2024-11-19 06:33:16,766 INFO L226 Difference]: Without dead ends: 36 [2024-11-19 06:33:16,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:33:16,767 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 37 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 06:33:16,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 37 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-19 06:33:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-19 06:33:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-19 06:33:16,773 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 13 [2024-11-19 06:33:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:16,775 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-19 06:33:16,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-19 06:33:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:33:16,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:16,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:16,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:33:16,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:16,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:16,777 INFO L85 PathProgramCache]: Analyzing trace with hash 363893954, now seen corresponding path program 1 times [2024-11-19 06:33:16,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:16,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311524306] [2024-11-19 06:33:16,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:16,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:33:16,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:16,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311524306] [2024-11-19 06:33:16,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311524306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:16,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:16,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:33:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567939326] [2024-11-19 06:33:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:16,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:33:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:16,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:33:16,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:33:16,824 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:16,845 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-19 06:33:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:33:16,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-19 06:33:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:16,846 INFO L225 Difference]: With dead ends: 38 [2024-11-19 06:33:16,847 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 06:33:16,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:33:16,848 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:16,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 06:33:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-19 06:33:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.375) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:16,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-19 06:33:16,850 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 13 [2024-11-19 06:33:16,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:16,851 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-19 06:33:16,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-19 06:33:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:33:16,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:16,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:16,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:33:16,852 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:16,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1064958532, now seen corresponding path program 1 times [2024-11-19 06:33:16,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:16,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753020011] [2024-11-19 06:33:16,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:16,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753020011] [2024-11-19 06:33:16,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753020011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:33:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871844615] [2024-11-19 06:33:16,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:16,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:16,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:16,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:33:16,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:33:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:16,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:33:16,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:33:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:16,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:33:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:17,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871844615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:33:17,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:33:17,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-19 06:33:17,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775081390] [2024-11-19 06:33:17,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:33:17,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:33:17,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:17,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:33:17,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:33:17,021 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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 06:33:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:17,070 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-19 06:33:17,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:33:17,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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 13 [2024-11-19 06:33:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:17,071 INFO L225 Difference]: With dead ends: 39 [2024-11-19 06:33:17,071 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 06:33:17,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:33:17,072 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 116 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.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:17,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 116 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 06:33:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-11-19 06:33:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-19 06:33:17,075 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 13 [2024-11-19 06:33:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:17,075 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-19 06:33:17,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 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 06:33:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-19 06:33:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:33:17,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:17,076 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:17,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:33:17,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:17,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:17,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:17,277 INFO L85 PathProgramCache]: Analyzing trace with hash 493979553, now seen corresponding path program 2 times [2024-11-19 06:33:17,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:17,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072841588] [2024-11-19 06:33:17,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:33:17,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:17,287 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:33:17,287 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:33:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:33:17,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:17,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072841588] [2024-11-19 06:33:17,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072841588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:17,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:17,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:33:17,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085070669] [2024-11-19 06:33:17,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:17,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:33:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:17,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:33:17,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:33:17,303 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:17,315 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-19 06:33:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:33:17,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 17 [2024-11-19 06:33:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:17,316 INFO L225 Difference]: With dead ends: 35 [2024-11-19 06:33:17,316 INFO L226 Difference]: Without dead ends: 35 [2024-11-19 06:33:17,317 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 06:33:17,317 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:17,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-19 06:33:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-19 06:33:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-19 06:33:17,320 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 17 [2024-11-19 06:33:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:17,320 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-19 06:33:17,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-19 06:33:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:33:17,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:17,321 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:17,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:33:17,321 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:17,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash 493979599, now seen corresponding path program 1 times [2024-11-19 06:33:17,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:17,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858456422] [2024-11-19 06:33:17,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:17,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:17,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858456422] [2024-11-19 06:33:17,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858456422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:33:17,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796615068] [2024-11-19 06:33:17,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:17,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:17,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:17,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:33:17,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:33:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:17,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:33:17,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:33:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:17,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:33:17,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-19 06:33:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:17,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796615068] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:33:17,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:33:17,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-19 06:33:17,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333907193] [2024-11-19 06:33:17,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:33:17,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:33:17,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:17,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:33:17,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:33:17,841 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:18,062 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-11-19 06:33:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:33:18,063 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 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 17 [2024-11-19 06:33:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:18,063 INFO L225 Difference]: With dead ends: 55 [2024-11-19 06:33:18,063 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 06:33:18,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:33:18,064 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:18,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 95 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:33:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 06:33:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2024-11-19 06:33:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-19 06:33:18,067 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 17 [2024-11-19 06:33:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:18,067 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-19 06:33:18,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-19 06:33:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:33:18,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:18,068 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:18,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:33:18,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:18,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:18,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1866501628, now seen corresponding path program 1 times [2024-11-19 06:33:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:18,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127418214] [2024-11-19 06:33:18,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:18,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:33:18,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:18,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127418214] [2024-11-19 06:33:18,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127418214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:18,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:18,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:33:18,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393930647] [2024-11-19 06:33:18,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:18,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:33:18,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:18,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:33:18,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:33:18,396 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:18,474 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2024-11-19 06:33:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:33:18,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2024-11-19 06:33:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:18,475 INFO L225 Difference]: With dead ends: 62 [2024-11-19 06:33:18,475 INFO L226 Difference]: Without dead ends: 62 [2024-11-19 06:33:18,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:33:18,476 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:18,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 71 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:33:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-19 06:33:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2024-11-19 06:33:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 57 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2024-11-19 06:33:18,479 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 18 [2024-11-19 06:33:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:18,479 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2024-11-19 06:33:18,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:18,479 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-11-19 06:33:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:33:18,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:18,480 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 06:33:18,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:33:18,481 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:18,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:18,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1609243625, now seen corresponding path program 1 times [2024-11-19 06:33:18,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:18,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032247183] [2024-11-19 06:33:18,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:18,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032247183] [2024-11-19 06:33:18,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032247183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:33:18,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21584625] [2024-11-19 06:33:18,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:18,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:18,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:18,614 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:33:18,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:33:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:18,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:33:18,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:33:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:18,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:33:18,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21584625] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:33:18,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:33:18,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-19 06:33:18,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868749847] [2024-11-19 06:33:18,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:33:18,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:33:18,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:18,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:33:18,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:33:18,853 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:18,975 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2024-11-19 06:33:18,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:33:18,975 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 06:33:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:18,976 INFO L225 Difference]: With dead ends: 104 [2024-11-19 06:33:18,976 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 06:33:18,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:33:18,977 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 46 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:18,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:33:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 06:33:18,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2024-11-19 06:33:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 96 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-11-19 06:33:18,982 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 22 [2024-11-19 06:33:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:18,982 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-11-19 06:33:18,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-11-19 06:33:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 06:33:18,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:18,983 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:19,001 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 06:33:19,183 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,SelfDestructingSolverStorable12 [2024-11-19 06:33:19,184 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:19,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash 294852956, now seen corresponding path program 1 times [2024-11-19 06:33:19,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:19,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272126185] [2024-11-19 06:33:19,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:19,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:33:19,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:19,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272126185] [2024-11-19 06:33:19,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272126185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:33:19,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310888984] [2024-11-19 06:33:19,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:19,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:19,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:19,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:33:19,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:33:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:19,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:33:19,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:33:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:33:19,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:33:19,596 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 10 treesize of output 8 [2024-11-19 06:33:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:33:19,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310888984] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:33:19,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:33:19,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-19 06:33:19,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234498947] [2024-11-19 06:33:19,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:33:19,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 06:33:19,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:19,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 06:33:19,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:33:19,659 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 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 06:33:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:20,049 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2024-11-19 06:33:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:33:20,050 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 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 24 [2024-11-19 06:33:20,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:20,052 INFO L225 Difference]: With dead ends: 125 [2024-11-19 06:33:20,052 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 06:33:20,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2024-11-19 06:33:20,053 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 105 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:20,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 87 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:33:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 06:33:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 78. [2024-11-19 06:33:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 77 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 06:33:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2024-11-19 06:33:20,062 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 24 [2024-11-19 06:33:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:20,062 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2024-11-19 06:33:20,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 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 06:33:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2024-11-19 06:33:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:33:20,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:20,065 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:20,083 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 06:33:20,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:20,266 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:20,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2043692844, now seen corresponding path program 2 times [2024-11-19 06:33:20,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:20,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695816267] [2024-11-19 06:33:20,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:33:20,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:20,283 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:33:20,283 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:33:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 06:33:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:20,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695816267] [2024-11-19 06:33:20,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695816267] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:33:20,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629198513] [2024-11-19 06:33:20,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:33:20,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:20,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:20,513 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:33:20,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:33:20,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:33:20,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:33:20,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 06:33:20,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:33:20,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:33:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:20,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:33:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:21,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629198513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:33:21,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:33:21,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-11-19 06:33:21,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275056006] [2024-11-19 06:33:21,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:33:21,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 06:33:21,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:21,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 06:33:21,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:33:21,122 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 23 states, 22 states have (on average 3.0) internal successors, (66), 23 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 06:33:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:21,689 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2024-11-19 06:33:21,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:33:21,689 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.0) internal successors, (66), 23 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 26 [2024-11-19 06:33:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:21,690 INFO L225 Difference]: With dead ends: 94 [2024-11-19 06:33:21,690 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 06:33:21,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 06:33:21,691 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 88 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:21,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 149 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:33:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 06:33:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2024-11-19 06:33:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 76 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 06:33:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2024-11-19 06:33:21,694 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 26 [2024-11-19 06:33:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:21,695 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2024-11-19 06:33:21,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.0) internal successors, (66), 23 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 06:33:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2024-11-19 06:33:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:33:21,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:21,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:21,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:33:21,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:21,900 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:21,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1044773414, now seen corresponding path program 1 times [2024-11-19 06:33:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:21,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002563429] [2024-11-19 06:33:21,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:21,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:33:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:21,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002563429] [2024-11-19 06:33:21,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002563429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:33:21,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894922162] [2024-11-19 06:33:21,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:21,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:21,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:22,000 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:33:22,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:33:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:22,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:33:22,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:33:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:33:22,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:33:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:33:22,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894922162] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:33:22,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:33:22,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2024-11-19 06:33:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656607619] [2024-11-19 06:33:22,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:33:22,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:33:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:22,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:33:22,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:33:22,234 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:22,297 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-11-19 06:33:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:33:22,298 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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 32 [2024-11-19 06:33:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:22,298 INFO L225 Difference]: With dead ends: 70 [2024-11-19 06:33:22,299 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 06:33:22,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:33:22,299 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:22,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 130 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:33:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 06:33:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2024-11-19 06:33:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-19 06:33:22,306 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 32 [2024-11-19 06:33:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:22,306 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-19 06:33:22,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-19 06:33:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:33:22,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:22,307 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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 06:33:22,325 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 06:33:22,507 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,SelfDestructingSolverStorable15 [2024-11-19 06:33:22,508 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:22,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:22,508 INFO L85 PathProgramCache]: Analyzing trace with hash -482330275, now seen corresponding path program 2 times [2024-11-19 06:33:22,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:22,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192916386] [2024-11-19 06:33:22,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:33:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:22,525 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:33:22,526 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:33:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 06:33:22,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192916386] [2024-11-19 06:33:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192916386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:33:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219333150] [2024-11-19 06:33:22,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:33:22,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:22,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:22,761 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:33:22,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 06:33:22,840 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:33:22,840 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:33:22,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:33:22,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:33:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:22,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:33:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:33:23,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219333150] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:33:23,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:33:23,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 18 [2024-11-19 06:33:23,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614983778] [2024-11-19 06:33:23,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:33:23,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 06:33:23,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:23,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 06:33:23,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:33:23,082 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:23,503 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2024-11-19 06:33:23,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 06:33:23,503 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 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 06:33:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:23,504 INFO L225 Difference]: With dead ends: 63 [2024-11-19 06:33:23,504 INFO L226 Difference]: Without dead ends: 63 [2024-11-19 06:33:23,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:33:23,505 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 111 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:23,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 112 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:33:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-19 06:33:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2024-11-19 06:33:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.196078431372549) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2024-11-19 06:33:23,507 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 36 [2024-11-19 06:33:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:23,507 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2024-11-19 06:33:23,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2024-11-19 06:33:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:33:23,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:23,509 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:23,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 06:33:23,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 06:33:23,710 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:23,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:23,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1614617270, now seen corresponding path program 1 times [2024-11-19 06:33:23,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:23,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845950818] [2024-11-19 06:33:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:23,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 06:33:23,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:23,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845950818] [2024-11-19 06:33:23,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845950818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:33:23,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514616938] [2024-11-19 06:33:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:23,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:23,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:23,902 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:33:23,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 06:33:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:23,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:33:23,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:33:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 06:33:24,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:33:24,323 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 30 treesize of output 26 [2024-11-19 06:33:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 06:33:24,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514616938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:33:24,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:33:24,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-11-19 06:33:24,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126312598] [2024-11-19 06:33:24,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:33:24,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 06:33:24,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:24,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 06:33:24,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:33:24,437 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 23 states, 22 states have (on average 4.363636363636363) internal successors, (96), 23 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 06:33:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:25,544 INFO L93 Difference]: Finished difference Result 204 states and 244 transitions. [2024-11-19 06:33:25,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-19 06:33:25,545 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.363636363636363) internal successors, (96), 23 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) Word has length 42 [2024-11-19 06:33:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:25,546 INFO L225 Difference]: With dead ends: 204 [2024-11-19 06:33:25,546 INFO L226 Difference]: Without dead ends: 204 [2024-11-19 06:33:25,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=911, Invalid=3249, Unknown=0, NotChecked=0, Total=4160 [2024-11-19 06:33:25,548 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 168 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:25,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 228 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:33:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-19 06:33:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 47. [2024-11-19 06:33:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-11-19 06:33:25,550 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2024-11-19 06:33:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:25,551 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-11-19 06:33:25,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.363636363636363) internal successors, (96), 23 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 06:33:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-11-19 06:33:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 06:33:25,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:25,552 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:25,567 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 06:33:25,756 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,SelfDestructingSolverStorable17 [2024-11-19 06:33:25,757 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-19 06:33:25,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1914772379, now seen corresponding path program 3 times [2024-11-19 06:33:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:25,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708358770] [2024-11-19 06:33:25,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:33:25,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:25,775 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:33:25,776 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:33:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 06:33:26,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:26,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708358770] [2024-11-19 06:33:26,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708358770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:33:26,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112339035] [2024-11-19 06:33:26,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:33:26,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:26,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:26,030 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:33:26,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 06:33:26,106 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:33:26,106 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:33:26,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 06:33:26,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:33:26,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:33:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 06:33:26,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:33:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 06:33:27,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112339035] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:33:27,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:33:27,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2024-11-19 06:33:27,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435584509] [2024-11-19 06:33:27,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:33:27,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 06:33:27,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:27,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 06:33:27,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2024-11-19 06:33:27,044 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 28 states, 27 states have (on average 3.740740740740741) internal successors, (101), 28 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:27,371 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2024-11-19 06:33:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:33:27,372 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.740740740740741) internal successors, (101), 28 states have internal predecessors, (101), 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 46 [2024-11-19 06:33:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:27,372 INFO L225 Difference]: With dead ends: 57 [2024-11-19 06:33:27,372 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 06:33:27,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 06:33:27,373 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:27,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 121 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:33:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 06:33:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 06:33:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 06:33:27,374 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2024-11-19 06:33:27,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:27,374 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 06:33:27,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.740740740740741) internal successors, (101), 28 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 06:33:27,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 06:33:27,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2024-11-19 06:33:27,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2024-11-19 06:33:27,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2024-11-19 06:33:27,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2024-11-19 06:33:27,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-19 06:33:27,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-19 06:33:27,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2024-11-19 06:33:27,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-19 06:33:27,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-19 06:33:27,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2024-11-19 06:33:27,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-11-19 06:33:27,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-11-19 06:33:27,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2024-11-19 06:33:27,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-11-19 06:33:27,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2024-11-19 06:33:27,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 06:33:27,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:33:27,583 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:27,585 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:33:27,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:33:27 BoogieIcfgContainer [2024-11-19 06:33:27,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:33:27,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:33:27,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:33:27,588 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:33:27,588 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:13" (3/4) ... [2024-11-19 06:33:27,591 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 06:33:27,599 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-19 06:33:27,599 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 06:33:27,600 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-19 06:33:27,600 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 06:33:27,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:33:27,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 06:33:27,685 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:33:27,686 INFO L158 Benchmark]: Toolchain (without parser) took 15412.00ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 84.7MB in the beginning and 234.4MB in the end (delta: -149.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:33:27,686 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 103.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:33:27,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.29ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 65.9MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 06:33:27,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.67ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 63.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:33:27,687 INFO L158 Benchmark]: Boogie Preprocessor took 42.73ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 61.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:33:27,687 INFO L158 Benchmark]: RCFGBuilder took 499.94ms. Allocated memory is still 142.6MB. Free memory was 61.7MB in the beginning and 101.1MB in the end (delta: -39.4MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-19 06:33:27,687 INFO L158 Benchmark]: TraceAbstraction took 14307.69ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 100.4MB in the beginning and 239.6MB in the end (delta: -139.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:33:27,688 INFO L158 Benchmark]: Witness Printer took 97.34ms. Allocated memory is still 276.8MB. Free memory was 239.6MB in the beginning and 234.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 06:33:27,689 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 103.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.29ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 65.9MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.67ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 63.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.73ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 61.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 499.94ms. Allocated memory is still 142.6MB. Free memory was 61.7MB in the beginning and 101.1MB in the end (delta: -39.4MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14307.69ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 100.4MB in the beginning and 239.6MB in the end (delta: -139.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 97.34ms. Allocated memory is still 276.8MB. Free memory was 239.6MB in the beginning and 234.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 786 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 786 mSDsluCounter, 2025 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1553 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3232 IncrementalHoareTripleChecker+Invalid, 3313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 472 mSDtfsCounter, 3232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 732 GetRequests, 433 SyntacticMatches, 16 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2269 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=13, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 275 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 648 NumberOfCodeBlocks, 604 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 876 ConstructedInterpolants, 1 QuantifiedInterpolants, 8313 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1127 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 40 InterpolantComputations, 9 PerfectInterpolantSequences, 249/448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 06:33:27,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE