./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-15/cstrspn_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/termination-15/cstrspn_malloc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f55019e0bbd691300fed0d54b866c64772e1d73ec8a359d22e1dcd292c7e1531 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:36:32,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:36:32,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-22 18:36:32,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:36:32,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:36:32,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:36:32,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:36:32,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:36:32,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:36:32,314 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:36:32,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:36:32,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:36:32,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:36:32,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:36:32,318 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:36:32,318 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:36:32,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:36:32,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:36:32,319 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:36:32,320 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:36:32,320 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:36:32,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:36:32,322 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:36:32,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:36:32,322 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:36:32,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:36:32,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:36:32,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:36:32,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:36:32,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:36:32,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:36:32,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:36:32,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:36:32,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:36:32,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:36:32,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:36:32,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:36:32,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:36:32,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:36:32,326 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f55019e0bbd691300fed0d54b866c64772e1d73ec8a359d22e1dcd292c7e1531 [2024-11-22 18:36:32,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:36:32,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:36:32,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:36:32,623 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:36:32,624 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:36:32,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrspn_malloc.i [2024-11-22 18:36:34,117 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:36:34,356 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:36:34,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrspn_malloc.i [2024-11-22 18:36:34,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7629f36/192ddc85bcee492484e923007af8c266/FLAG8421c0718 [2024-11-22 18:36:34,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d7629f36/192ddc85bcee492484e923007af8c266 [2024-11-22 18:36:34,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:36:34,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:36:34,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:36:34,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:36:34,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:36:34,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:36:34" (1/1) ... [2024-11-22 18:36:34,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f01e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:34, skipping insertion in model container [2024-11-22 18:36:34,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:36:34" (1/1) ... [2024-11-22 18:36:34,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:36:35,051 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-22 18:36:35,052 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-22 18:36:35,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:36:35,069 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:36:35,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:36:35,173 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:36:35,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35 WrapperNode [2024-11-22 18:36:35,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:36:35,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:36:35,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:36:35,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:36:35,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,228 INFO L138 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2024-11-22 18:36:35,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:36:35,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:36:35,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:36:35,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:36:35,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,266 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [4, 3]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-22 18:36:35,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:36:35,294 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:36:35,294 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:36:35,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:36:35,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (1/1) ... [2024-11-22 18:36:35,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:36:35,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:36:35,338 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-22 18:36:35,344 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-22 18:36:35,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 18:36:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 18:36:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:36:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 18:36:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:36:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:36:35,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:36:35,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:36:35,460 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:36:35,462 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:36:35,747 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-22 18:36:35,747 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:36:35,763 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:36:35,763 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 18:36:35,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:36:35 BoogieIcfgContainer [2024-11-22 18:36:35,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:36:35,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:36:35,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:36:35,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:36:35,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:36:34" (1/3) ... [2024-11-22 18:36:35,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1861da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:36:35, skipping insertion in model container [2024-11-22 18:36:35,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:36:35" (2/3) ... [2024-11-22 18:36:35,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1861da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:36:35, skipping insertion in model container [2024-11-22 18:36:35,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:36:35" (3/3) ... [2024-11-22 18:36:35,779 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrspn_malloc.i [2024-11-22 18:36:35,799 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:36:35,800 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-22 18:36:35,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:36:35,864 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;@1af6de2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:36:35,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-22 18:36:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.935483870967742) internal successors, (60), 52 states have internal predecessors, (60), 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-22 18:36:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 18:36:35,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:35,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 18:36:35,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:35,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:35,888 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2024-11-22 18:36:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:35,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623733686] [2024-11-22 18:36:35,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:35,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:36,177 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-22 18:36:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:36,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623733686] [2024-11-22 18:36:36,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623733686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:36,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:36,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:36:36,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155610797] [2024-11-22 18:36:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:36,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:36:36,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:36,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:36:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:36:36,221 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.935483870967742) internal successors, (60), 52 states have internal predecessors, (60), 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-22 18:36:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:36,273 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-11-22 18:36:36,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:36:36,275 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-22 18:36:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:36,282 INFO L225 Difference]: With dead ends: 51 [2024-11-22 18:36:36,282 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 18:36:36,283 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-22 18:36:36,287 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:36,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 18:36:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 18:36:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.8) internal successors, (54), 48 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-22 18:36:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2024-11-22 18:36:36,315 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 6 [2024-11-22 18:36:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:36,315 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-11-22 18:36:36,315 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-22 18:36:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2024-11-22 18:36:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 18:36:36,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:36,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 18:36:36,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:36:36,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:36,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:36,317 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2024-11-22 18:36:36,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:36,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572455928] [2024-11-22 18:36:36,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:36,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:36,597 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-22 18:36:36,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:36,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572455928] [2024-11-22 18:36:36,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572455928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:36,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:36,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:36:36,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796884142] [2024-11-22 18:36:36,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:36,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:36:36,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:36,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:36:36,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:36:36,606 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-22 18:36:36,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:36,637 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-11-22 18:36:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:36:36,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-22 18:36:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:36,640 INFO L225 Difference]: With dead ends: 52 [2024-11-22 18:36:36,640 INFO L226 Difference]: Without dead ends: 52 [2024-11-22 18:36:36,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:36:36,643 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:36,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-22 18:36:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-22 18:36:36,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 51 states have internal predecessors, (58), 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-22 18:36:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-11-22 18:36:36,655 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 6 [2024-11-22 18:36:36,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:36,655 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-11-22 18:36:36,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-22 18:36:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-11-22 18:36:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 18:36:36,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:36,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 18:36:36,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:36:36,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:36,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2024-11-22 18:36:36,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:36,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287990286] [2024-11-22 18:36:36,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:36,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:36,898 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-22 18:36:36,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:36,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287990286] [2024-11-22 18:36:36,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287990286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:36,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:36,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:36:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814121113] [2024-11-22 18:36:36,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:36,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:36:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:36,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:36:36,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:36:36,901 INFO L87 Difference]: Start difference. First operand 52 states and 58 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-22 18:36:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:36,963 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-11-22 18:36:36,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:36:36,966 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-22 18:36:36,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:36,966 INFO L225 Difference]: With dead ends: 51 [2024-11-22 18:36:36,967 INFO L226 Difference]: Without dead ends: 51 [2024-11-22 18:36:36,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:36:36,968 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:36,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:36:36,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-22 18:36:36,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2024-11-22 18:36:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 47 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-22 18:36:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2024-11-22 18:36:36,978 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 6 [2024-11-22 18:36:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:36,978 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2024-11-22 18:36:36,978 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-22 18:36:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2024-11-22 18:36:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:36:36,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:36,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:36,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:36:36,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:36,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:36,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2024-11-22 18:36:36,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:36,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558302048] [2024-11-22 18:36:36,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:36,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:37,022 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-22 18:36:37,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:37,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558302048] [2024-11-22 18:36:37,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558302048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:37,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:37,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:36:37,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865211982] [2024-11-22 18:36:37,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:37,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:36:37,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:37,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:36:37,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:36:37,024 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-22 18:36:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:37,061 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-11-22 18:36:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:36:37,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-22 18:36:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:37,062 INFO L225 Difference]: With dead ends: 47 [2024-11-22 18:36:37,063 INFO L226 Difference]: Without dead ends: 47 [2024-11-22 18:36:37,064 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-22 18:36:37,065 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 35 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:37,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 43 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:37,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-22 18:36:37,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-22 18:36:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 46 states have internal predecessors, (52), 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-22 18:36:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-22 18:36:37,073 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 7 [2024-11-22 18:36:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:37,074 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-22 18:36:37,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-22 18:36:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-22 18:36:37,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:36:37,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:37,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:37,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:36:37,076 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:37,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2024-11-22 18:36:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:37,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336738599] [2024-11-22 18:36:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:37,201 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-22 18:36:37,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:37,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336738599] [2024-11-22 18:36:37,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336738599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:37,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:37,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:36:37,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648596196] [2024-11-22 18:36:37,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:37,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:36:37,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:37,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:36:37,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:36:37,204 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-22 18:36:37,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:37,225 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-11-22 18:36:37,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:36:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-22 18:36:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:37,226 INFO L225 Difference]: With dead ends: 50 [2024-11-22 18:36:37,226 INFO L226 Difference]: Without dead ends: 50 [2024-11-22 18:36:37,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:36:37,227 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:37,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-22 18:36:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-22 18:36:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 49 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-22 18:36:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-22 18:36:37,238 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 7 [2024-11-22 18:36:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:37,239 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-22 18:36:37,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-22 18:36:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-22 18:36:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 18:36:37,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:37,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:37,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:36:37,241 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:37,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088457, now seen corresponding path program 1 times [2024-11-22 18:36:37,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83184842] [2024-11-22 18:36:37,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:37,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:37,357 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-22 18:36:37,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:37,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83184842] [2024-11-22 18:36:37,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83184842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:37,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:37,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:36:37,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520630946] [2024-11-22 18:36:37,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:37,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:36:37,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:37,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:36:37,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:36:37,361 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-22 18:36:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:37,382 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2024-11-22 18:36:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:36:37,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2024-11-22 18:36:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:37,384 INFO L225 Difference]: With dead ends: 49 [2024-11-22 18:36:37,388 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 18:36:37,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:36:37,389 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:37,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 18:36:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-11-22 18:36:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.7) internal successors, (51), 45 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-22 18:36:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-11-22 18:36:37,397 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 7 [2024-11-22 18:36:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:37,397 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-11-22 18:36:37,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-22 18:36:37,398 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-11-22 18:36:37,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 18:36:37,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:37,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:37,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:36:37,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:37,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:37,399 INFO L85 PathProgramCache]: Analyzing trace with hash -534039922, now seen corresponding path program 1 times [2024-11-22 18:36:37,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:37,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818427350] [2024-11-22 18:36:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:37,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:37,449 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-22 18:36:37,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:37,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818427350] [2024-11-22 18:36:37,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818427350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:37,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:37,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:36:37,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492524613] [2024-11-22 18:36:37,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:37,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:36:37,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:37,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:36:37,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:36:37,451 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:36:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:37,521 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-11-22 18:36:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:36:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 18:36:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:37,522 INFO L225 Difference]: With dead ends: 44 [2024-11-22 18:36:37,522 INFO L226 Difference]: Without dead ends: 44 [2024-11-22 18:36:37,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:36:37,523 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:37,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 50 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:36:37,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-22 18:36:37,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-22 18:36:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 43 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-22 18:36:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-22 18:36:37,526 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 9 [2024-11-22 18:36:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:37,526 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-22 18:36:37,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:36:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-22 18:36:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 18:36:37,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:37,531 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:37,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:36:37,531 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:37,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:37,531 INFO L85 PathProgramCache]: Analyzing trace with hash -534039921, now seen corresponding path program 1 times [2024-11-22 18:36:37,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:37,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956107983] [2024-11-22 18:36:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:37,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:37,658 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-22 18:36:37,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:37,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956107983] [2024-11-22 18:36:37,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956107983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:37,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:37,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:36:37,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878747563] [2024-11-22 18:36:37,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:37,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:36:37,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:37,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:36:37,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:36:37,660 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:36:37,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:37,747 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2024-11-22 18:36:37,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:36:37,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 18:36:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:37,749 INFO L225 Difference]: With dead ends: 63 [2024-11-22 18:36:37,749 INFO L226 Difference]: Without dead ends: 63 [2024-11-22 18:36:37,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:36:37,750 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 74 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:37,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 98 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:36:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-22 18:36:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2024-11-22 18:36:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 45 states have internal predecessors, (52), 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-22 18:36:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-11-22 18:36:37,758 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 9 [2024-11-22 18:36:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:37,761 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-11-22 18:36:37,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:36:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-11-22 18:36:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:36:37,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:37,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:37,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:36:37,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:37,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:37,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1693144940, now seen corresponding path program 1 times [2024-11-22 18:36:37,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:37,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588837304] [2024-11-22 18:36:37,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:37,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:37,819 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-22 18:36:37,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:37,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588837304] [2024-11-22 18:36:37,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588837304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:37,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:37,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:36:37,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618314393] [2024-11-22 18:36:37,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:37,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:36:37,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:37,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:36:37,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:36:37,821 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-22 18:36:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:37,881 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-11-22 18:36:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:36:37,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-22 18:36:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:37,882 INFO L225 Difference]: With dead ends: 43 [2024-11-22 18:36:37,882 INFO L226 Difference]: Without dead ends: 43 [2024-11-22 18:36:37,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:36:37,883 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:37,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 65 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-22 18:36:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-22 18:36:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 42 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-22 18:36:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-22 18:36:37,889 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 13 [2024-11-22 18:36:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:37,889 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-22 18:36:37,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-22 18:36:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-11-22 18:36:37,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:36:37,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:37,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:37,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:36:37,890 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:37,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1693144939, now seen corresponding path program 1 times [2024-11-22 18:36:37,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:37,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010332291] [2024-11-22 18:36:37,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:37,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:38,044 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-22 18:36:38,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:38,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010332291] [2024-11-22 18:36:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010332291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:38,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:36:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862620791] [2024-11-22 18:36:38,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:38,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:36:38,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:38,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:36:38,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:36:38,047 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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-22 18:36:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:38,130 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-11-22 18:36:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:36:38,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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-22 18:36:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:38,131 INFO L225 Difference]: With dead ends: 49 [2024-11-22 18:36:38,131 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 18:36:38,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:36:38,132 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 77 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:38,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 97 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:36:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 18:36:38,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 18:36:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.425) internal successors, (57), 48 states have internal predecessors, (57), 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-22 18:36:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-11-22 18:36:38,140 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 13 [2024-11-22 18:36:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:38,140 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-22 18:36:38,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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-22 18:36:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-11-22 18:36:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:36:38,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:38,141 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:38,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:36:38,141 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:38,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:38,142 INFO L85 PathProgramCache]: Analyzing trace with hash -948409995, now seen corresponding path program 1 times [2024-11-22 18:36:38,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:38,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004240100] [2024-11-22 18:36:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:38,175 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-22 18:36:38,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:38,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004240100] [2024-11-22 18:36:38,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004240100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:38,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:38,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:36:38,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564889769] [2024-11-22 18:36:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:38,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:36:38,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:38,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:36:38,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:36:38,177 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-22 18:36:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:38,190 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-11-22 18:36:38,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:36:38,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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 14 [2024-11-22 18:36:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:38,191 INFO L225 Difference]: With dead ends: 48 [2024-11-22 18:36:38,191 INFO L226 Difference]: Without dead ends: 48 [2024-11-22 18:36:38,191 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-22 18:36:38,192 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:38,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 47 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-22 18:36:38,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-22 18:36:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.4) internal successors, (56), 47 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-22 18:36:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-11-22 18:36:38,195 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 14 [2024-11-22 18:36:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:38,195 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-22 18:36:38,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-22 18:36:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-11-22 18:36:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:36:38,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:38,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:38,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:36:38,196 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:38,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:38,197 INFO L85 PathProgramCache]: Analyzing trace with hash 950889964, now seen corresponding path program 1 times [2024-11-22 18:36:38,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:38,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669933104] [2024-11-22 18:36:38,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:38,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:38,220 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-22 18:36:38,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:38,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669933104] [2024-11-22 18:36:38,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669933104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:38,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:38,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:36:38,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389904303] [2024-11-22 18:36:38,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:38,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:36:38,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:38,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:36:38,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:36:38,222 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-22 18:36:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:38,231 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-22 18:36:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:36:38,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-22 18:36:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:38,232 INFO L225 Difference]: With dead ends: 50 [2024-11-22 18:36:38,232 INFO L226 Difference]: Without dead ends: 50 [2024-11-22 18:36:38,232 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-22 18:36:38,233 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:38,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-22 18:36:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-22 18:36:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.380952380952381) internal successors, (58), 49 states have internal predecessors, (58), 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-22 18:36:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-22 18:36:38,236 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 17 [2024-11-22 18:36:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:38,236 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-22 18:36:38,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-22 18:36:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2024-11-22 18:36:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 18:36:38,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:38,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:38,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 18:36:38,237 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:38,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:38,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1787173696, now seen corresponding path program 1 times [2024-11-22 18:36:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:38,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149536630] [2024-11-22 18:36:38,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:38,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:38,266 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-22 18:36:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:38,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149536630] [2024-11-22 18:36:38,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149536630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:38,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:38,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:36:38,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398077316] [2024-11-22 18:36:38,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:38,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:36:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:36:38,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:36:38,269 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-22 18:36:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:38,279 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-11-22 18:36:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:36:38,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-22 18:36:38,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:38,280 INFO L225 Difference]: With dead ends: 49 [2024-11-22 18:36:38,280 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 18:36:38,281 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-22 18:36:38,281 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:38,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 41 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:38,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 18:36:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 18:36:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 48 states have internal predecessors, (57), 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-22 18:36:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-11-22 18:36:38,284 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 17 [2024-11-22 18:36:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:38,284 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-22 18:36:38,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-22 18:36:38,285 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-11-22 18:36:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 18:36:38,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:38,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:38,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 18:36:38,286 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:38,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:38,286 INFO L85 PathProgramCache]: Analyzing trace with hash 432190393, now seen corresponding path program 1 times [2024-11-22 18:36:38,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:38,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206390734] [2024-11-22 18:36:38,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:38,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:38,377 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-22 18:36:38,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:38,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206390734] [2024-11-22 18:36:38,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206390734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:38,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:38,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:36:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96075285] [2024-11-22 18:36:38,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:38,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:36:38,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:38,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:36:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:36:38,379 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-22 18:36:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:38,405 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-11-22 18:36:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:36:38,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-22 18:36:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:38,408 INFO L225 Difference]: With dead ends: 48 [2024-11-22 18:36:38,408 INFO L226 Difference]: Without dead ends: 48 [2024-11-22 18:36:38,408 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-22 18:36:38,409 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 62 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:38,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 40 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-22 18:36:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-22 18:36:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 47 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-22 18:36:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-11-22 18:36:38,415 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 18 [2024-11-22 18:36:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:38,415 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-22 18:36:38,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-22 18:36:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-11-22 18:36:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 18:36:38,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:38,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:38,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 18:36:38,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:38,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:38,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1028637879, now seen corresponding path program 1 times [2024-11-22 18:36:38,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:38,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209800482] [2024-11-22 18:36:38,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:38,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:38,625 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-22 18:36:38,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:38,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209800482] [2024-11-22 18:36:38,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209800482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:38,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:38,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:36:38,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157730637] [2024-11-22 18:36:38,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:38,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:36:38,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:38,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:36:38,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:36:38,628 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-22 18:36:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:38,690 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-11-22 18:36:38,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:36:38,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 19 [2024-11-22 18:36:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:38,691 INFO L225 Difference]: With dead ends: 58 [2024-11-22 18:36:38,691 INFO L226 Difference]: Without dead ends: 58 [2024-11-22 18:36:38,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:36:38,692 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:38,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-22 18:36:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2024-11-22 18:36:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 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-22 18:36:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-22 18:36:38,694 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 19 [2024-11-22 18:36:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:38,694 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-22 18:36:38,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-22 18:36:38,695 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-22 18:36:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 18:36:38,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:38,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:38,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:36:38,696 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:38,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 513000419, now seen corresponding path program 1 times [2024-11-22 18:36:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:38,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469271621] [2024-11-22 18:36:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:38,877 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-22 18:36:38,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:38,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469271621] [2024-11-22 18:36:38,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469271621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:38,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:38,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:36:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879969776] [2024-11-22 18:36:38,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:38,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:36:38,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:38,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:36:38,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:36:38,878 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-22 18:36:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:38,917 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2024-11-22 18:36:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:36:38,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-11-22 18:36:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:38,918 INFO L225 Difference]: With dead ends: 54 [2024-11-22 18:36:38,918 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 18:36:38,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:36:38,919 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:38,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 77 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 18:36:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-22 18:36:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 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-22 18:36:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-22 18:36:38,920 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 19 [2024-11-22 18:36:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:38,921 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-22 18:36:38,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-22 18:36:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-22 18:36:38,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 18:36:38,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:38,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:38,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 18:36:38,926 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:38,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:38,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1677981515, now seen corresponding path program 1 times [2024-11-22 18:36:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738890452] [2024-11-22 18:36:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:38,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:39,113 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-22 18:36:39,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:39,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738890452] [2024-11-22 18:36:39,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738890452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:39,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:39,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:36:39,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252953589] [2024-11-22 18:36:39,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:39,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:36:39,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:39,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:36:39,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:36:39,128 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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-22 18:36:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:39,239 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-22 18:36:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:36:39,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 19 [2024-11-22 18:36:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:39,240 INFO L225 Difference]: With dead ends: 58 [2024-11-22 18:36:39,240 INFO L226 Difference]: Without dead ends: 58 [2024-11-22 18:36:39,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:36:39,241 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:39,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 132 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:36:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-22 18:36:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-22 18:36:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:36:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-11-22 18:36:39,244 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 19 [2024-11-22 18:36:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:39,244 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-11-22 18:36:39,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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-22 18:36:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-11-22 18:36:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 18:36:39,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:39,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:39,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 18:36:39,245 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:39,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:39,245 INFO L85 PathProgramCache]: Analyzing trace with hash 656913161, now seen corresponding path program 1 times [2024-11-22 18:36:39,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:39,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854176138] [2024-11-22 18:36:39,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:39,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:39,610 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-22 18:36:39,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:39,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854176138] [2024-11-22 18:36:39,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854176138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:36:39,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164936822] [2024-11-22 18:36:39,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:39,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:36:39,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:36:39,614 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-22 18:36:39,616 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-22 18:36:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:39,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 18:36:39,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:36:39,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-22 18:36:39,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 18:36:40,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:36:40,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-22 18:36:40,265 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-22 18:36:40,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:36:40,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-22 18:36:40,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-22 18:36:40,712 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-22 18:36:40,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164936822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:36:40,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:36:40,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2024-11-22 18:36:40,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882636094] [2024-11-22 18:36:40,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:36:40,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 18:36:40,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:40,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 18:36:40,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2024-11-22 18:36:40,715 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 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-22 18:36:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:41,671 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2024-11-22 18:36:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 18:36:41,672 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 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 19 [2024-11-22 18:36:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:41,672 INFO L225 Difference]: With dead ends: 63 [2024-11-22 18:36:41,673 INFO L226 Difference]: Without dead ends: 63 [2024-11-22 18:36:41,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2024-11-22 18:36:41,674 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 191 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:41,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 177 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:36:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-22 18:36:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2024-11-22 18:36:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.2) internal successors, (60), 52 states have internal predecessors, (60), 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-22 18:36:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2024-11-22 18:36:41,677 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 19 [2024-11-22 18:36:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:41,677 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-11-22 18:36:41,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 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-22 18:36:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2024-11-22 18:36:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 18:36:41,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:41,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:41,691 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-22 18:36:41,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-22 18:36:41,885 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:41,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash 658274998, now seen corresponding path program 1 times [2024-11-22 18:36:41,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:41,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621739011] [2024-11-22 18:36:41,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:41,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:41,997 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-22 18:36:41,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:41,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621739011] [2024-11-22 18:36:41,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621739011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:36:41,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:36:41,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 18:36:41,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144416929] [2024-11-22 18:36:41,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:36:41,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:36:41,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:41,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:36:42,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:36:42,000 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:36:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:42,107 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-11-22 18:36:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:36:42,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-22 18:36:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:42,108 INFO L225 Difference]: With dead ends: 51 [2024-11-22 18:36:42,108 INFO L226 Difference]: Without dead ends: 34 [2024-11-22 18:36:42,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-22 18:36:42,109 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:42,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 84 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:36:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-22 18:36:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-22 18:36:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 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-22 18:36:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-11-22 18:36:42,111 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 20 [2024-11-22 18:36:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:42,111 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-11-22 18:36:42,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:36:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-11-22 18:36:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 18:36:42,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:42,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:42,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 18:36:42,112 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:42,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2067169221, now seen corresponding path program 1 times [2024-11-22 18:36:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:42,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58172522] [2024-11-22 18:36:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:42,318 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-22 18:36:42,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:42,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58172522] [2024-11-22 18:36:42,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58172522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:36:42,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047135298] [2024-11-22 18:36:42,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:36:42,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:36:42,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:36:42,321 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-22 18:36:42,323 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-22 18:36:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:36:42,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-22 18:36:42,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:36:42,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 18:36:42,616 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 18:36:42,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-22 18:36:42,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 18:36:42,744 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-22 18:36:42,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:36:42,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-22 18:36:43,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-22 18:36:43,093 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 15 treesize of output 11 [2024-11-22 18:36:43,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-22 18:36:43,109 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-22 18:36:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047135298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:36:43,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:36:43,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 22 [2024-11-22 18:36:43,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329306362] [2024-11-22 18:36:43,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:36:43,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-22 18:36:43,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:43,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-22 18:36:43,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:36:43,113 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 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-22 18:36:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:43,734 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-11-22 18:36:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:36:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 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) Word has length 22 [2024-11-22 18:36:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:43,735 INFO L225 Difference]: With dead ends: 50 [2024-11-22 18:36:43,735 INFO L226 Difference]: Without dead ends: 50 [2024-11-22 18:36:43,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 18:36:43,736 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 147 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:43,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 93 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:36:43,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-22 18:36:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 29. [2024-11-22 18:36:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:36:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-22 18:36:43,737 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2024-11-22 18:36:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:43,739 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-22 18:36:43,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 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-22 18:36:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-22 18:36:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 18:36:43,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:43,740 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:43,749 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-22 18:36:43,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-22 18:36:43,941 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:36:43,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:36:43,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1423532355, now seen corresponding path program 2 times [2024-11-22 18:36:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:36:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542789959] [2024-11-22 18:36:43,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:36:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:36:43,964 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:36:43,964 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:36:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:36:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:36:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542789959] [2024-11-22 18:36:44,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542789959] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:36:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117895963] [2024-11-22 18:36:44,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:36:44,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:36:44,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:36:44,468 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-22 18:36:44,471 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-22 18:36:44,542 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:36:44,543 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:36:44,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-22 18:36:44,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:36:44,570 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-22 18:36:44,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 18:36:45,315 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-22 18:36:45,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2024-11-22 18:36:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:36:45,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:36:45,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-11-22 18:36:45,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-22 18:36:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:36:46,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117895963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:36:46,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:36:46,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 34 [2024-11-22 18:36:46,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3652334] [2024-11-22 18:36:46,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:36:46,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-22 18:36:46,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:36:46,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-22 18:36:46,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1065, Unknown=1, NotChecked=0, Total=1190 [2024-11-22 18:36:46,084 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 35 states have internal predecessors, (64), 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-22 18:36:55,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:36:59,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:36:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:36:59,908 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-11-22 18:36:59,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 18:36:59,909 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 35 states have internal predecessors, (64), 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 25 [2024-11-22 18:36:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:36:59,910 INFO L225 Difference]: With dead ends: 50 [2024-11-22 18:36:59,910 INFO L226 Difference]: Without dead ends: 50 [2024-11-22 18:36:59,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=415, Invalid=2232, Unknown=5, NotChecked=0, Total=2652 [2024-11-22 18:36:59,911 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 330 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:36:59,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 195 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 426 Invalid, 9 Unknown, 0 Unchecked, 10.8s Time] [2024-11-22 18:36:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-22 18:36:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2024-11-22 18:36:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) 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-22 18:36:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-11-22 18:36:59,912 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 25 [2024-11-22 18:36:59,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:36:59,913 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-22 18:36:59,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 35 states have internal predecessors, (64), 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-22 18:36:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-11-22 18:36:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 18:36:59,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:36:59,913 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:36:59,924 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-22 18:37:00,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:37:00,115 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-22 18:37:00,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:37:00,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1258163931, now seen corresponding path program 3 times [2024-11-22 18:37:00,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:37:00,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835009197] [2024-11-22 18:37:00,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:37:00,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:37:00,171 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-22 18:37:00,171 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:37:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:37:00,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:37:00,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835009197] [2024-11-22 18:37:00,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835009197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:37:00,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796302848] [2024-11-22 18:37:00,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:37:00,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:37:00,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:37:00,841 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-22 18:37:00,842 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-22 18:37:00,929 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-22 18:37:00,929 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:37:00,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-22 18:37:00,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:37:00,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-22 18:37:00,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-22 18:37:02,144 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 18:37:02,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2024-11-22 18:37:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-22 18:37:02,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:37:09,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2024-11-22 18:37:09,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:37:09,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 125 [2024-11-22 18:37:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:37:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796302848] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:37:09,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:37:09,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 23] total 45 [2024-11-22 18:37:09,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76723697] [2024-11-22 18:37:09,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:37:09,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-22 18:37:09,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:37:09,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-22 18:37:09,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1827, Unknown=1, NotChecked=0, Total=2070 [2024-11-22 18:37:09,365 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:37:13,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:37:13,565 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-11-22 18:37:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 18:37:13,566 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-22 18:37:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:37:13,566 INFO L225 Difference]: With dead ends: 43 [2024-11-22 18:37:13,566 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 18:37:13,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=740, Invalid=3418, Unknown=2, NotChecked=0, Total=4160 [2024-11-22 18:37:13,568 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 317 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:37:13,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 151 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:37:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 18:37:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 18:37:13,569 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-22 18:37:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 18:37:13,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2024-11-22 18:37:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:37:13,569 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 18:37:13,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:37:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 18:37:13,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 18:37:13,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-11-22 18:37:13,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-22 18:37:13,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-22 18:37:13,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-11-22 18:37:13,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-11-22 18:37:13,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-22 18:37:13,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-22 18:37:13,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-22 18:37:13,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-22 18:37:13,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-22 18:37:13,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-22 18:37:13,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-22 18:37:13,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-22 18:37:13,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-22 18:37:13,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2024-11-22 18:37:13,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2024-11-22 18:37:13,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2024-11-22 18:37:13,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2024-11-22 18:37:13,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2024-11-22 18:37:13,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2024-11-22 18:37:13,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-11-22 18:37:13,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 18:37:13,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:37:13,783 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:37:13,786 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 18:37:13,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:37:13 BoogieIcfgContainer [2024-11-22 18:37:13,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 18:37:13,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 18:37:13,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 18:37:13,790 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 18:37:13,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:36:35" (3/4) ... [2024-11-22 18:37:13,794 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 18:37:13,803 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-22 18:37:13,804 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-22 18:37:13,804 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-22 18:37:13,805 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 18:37:13,902 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 18:37:13,903 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 18:37:13,903 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 18:37:13,904 INFO L158 Benchmark]: Toolchain (without parser) took 39193.29ms. Allocated memory was 157.3MB in the beginning and 264.2MB in the end (delta: 107.0MB). Free memory was 100.1MB in the beginning and 200.7MB in the end (delta: -100.6MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-22 18:37:13,904 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 157.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:37:13,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.61ms. Allocated memory is still 157.3MB. Free memory was 99.7MB in the beginning and 78.6MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-22 18:37:13,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.19ms. Allocated memory is still 157.3MB. Free memory was 78.6MB in the beginning and 76.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:37:13,904 INFO L158 Benchmark]: Boogie Preprocessor took 63.50ms. Allocated memory is still 157.3MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:37:13,904 INFO L158 Benchmark]: RCFGBuilder took 472.78ms. Allocated memory was 157.3MB in the beginning and 220.2MB in the end (delta: 62.9MB). Free memory was 74.1MB in the beginning and 186.2MB in the end (delta: -112.1MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-11-22 18:37:13,905 INFO L158 Benchmark]: TraceAbstraction took 38019.95ms. Allocated memory was 220.2MB in the beginning and 264.2MB in the end (delta: 44.0MB). Free memory was 185.2MB in the beginning and 205.6MB in the end (delta: -20.4MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-22 18:37:13,905 INFO L158 Benchmark]: Witness Printer took 113.13ms. Allocated memory is still 264.2MB. Free memory was 205.6MB in the beginning and 200.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 18:37:13,906 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.20ms. Allocated memory is still 157.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.61ms. Allocated memory is still 157.3MB. Free memory was 99.7MB in the beginning and 78.6MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.19ms. Allocated memory is still 157.3MB. Free memory was 78.6MB in the beginning and 76.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.50ms. Allocated memory is still 157.3MB. Free memory was 76.2MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 472.78ms. Allocated memory was 157.3MB in the beginning and 220.2MB in the end (delta: 62.9MB). Free memory was 74.1MB in the beginning and 186.2MB in the end (delta: -112.1MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 38019.95ms. Allocated memory was 220.2MB in the beginning and 264.2MB in the end (delta: 44.0MB). Free memory was 185.2MB in the beginning and 205.6MB in the end (delta: -20.4MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * Witness Printer took 113.13ms. Allocated memory is still 264.2MB. Free memory was 205.6MB in the beginning and 200.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. 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: 393]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 393]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 393]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 394]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 394]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 394]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 379]: 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, 53 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 38.0s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 1517 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1517 mSDsluCounter, 2116 SdHoareTripleChecker+Invalid, 11.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1431 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1846 IncrementalHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 685 mSDtfsCounter, 1846 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 134 SyntacticMatches, 9 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1836 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=17, InterpolantAutomatonStates: 162, 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, 22 MinimizatonAttempts, 68 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 505 ConstructedInterpolants, 78 QuantifiedInterpolants, 6615 SizeOfPredicates, 39 NumberOfNonLiveVariables, 556 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 34/154 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 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-22 18:37:13,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE