./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:33:59,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:33:59,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:33:59,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:33:59,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:33:59,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:33:59,490 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:33:59,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:33:59,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:33:59,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:33:59,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:33:59,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:33:59,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:33:59,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:33:59,495 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:33:59,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:33:59,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:33:59,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:33:59,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:33:59,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:33:59,499 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:33:59,499 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:33:59,500 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:33:59,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:33:59,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:33:59,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:33:59,501 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:33:59,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:33:59,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:33:59,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:33:59,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:33:59,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:33:59,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:33:59,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:33:59,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:33:59,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:33:59,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:33:59,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:33:59,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:33:59,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:33:59,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:33:59,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:33:59,506 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 [2024-11-09 07:33:59,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:33:59,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:33:59,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:33:59,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:33:59,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:33:59,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2024-11-09 07:34:01,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:34:01,484 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:34:01,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2024-11-09 07:34:01,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c1ef679/a3a961be3b6a4a83884be3c0cab70d7b/FLAG503bf65a3 [2024-11-09 07:34:01,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3c1ef679/a3a961be3b6a4a83884be3c0cab70d7b [2024-11-09 07:34:01,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:34:01,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:34:01,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:34:01,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:34:01,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:34:01,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:34:01" (1/1) ... [2024-11-09 07:34:01,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c2f1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:01, skipping insertion in model container [2024-11-09 07:34:01,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:34:01" (1/1) ... [2024-11-09 07:34:01,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:34:02,216 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-09 07:34:02,217 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-09 07:34:02,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:34:02,230 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:34:02,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:34:02,330 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:34:02,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02 WrapperNode [2024-11-09 07:34:02,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:34:02,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:34:02,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:34:02,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:34:02,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,381 INFO L138 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-11-09 07:34:02,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:34:02,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:34:02,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:34:02,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:34:02,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,421 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [3, 1]. 75 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [2, 1]. [2024-11-09 07:34:02,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:34:02,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:34:02,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:34:02,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:34:02,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (1/1) ... [2024-11-09 07:34:02,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:34:02,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:02,482 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:34:02,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:34:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:34:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:34:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:34:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:34:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:34:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:34:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:34:02,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:34:02,674 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:34:02,677 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:34:02,933 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-09 07:34:02,933 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:34:02,948 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:34:02,949 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:34:02,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:34:02 BoogieIcfgContainer [2024-11-09 07:34:02,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:34:02,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:34:02,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:34:02,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:34:02,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:34:01" (1/3) ... [2024-11-09 07:34:02,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d99b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:34:02, skipping insertion in model container [2024-11-09 07:34:02,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:02" (2/3) ... [2024-11-09 07:34:02,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d99b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:34:02, skipping insertion in model container [2024-11-09 07:34:02,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:34:02" (3/3) ... [2024-11-09 07:34:02,960 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca-2.i [2024-11-09 07:34:02,978 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:34:02,979 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-09 07:34:03,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:34:03,033 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;@1190549a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:34:03,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 07:34:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.8) internal successors, (36), 29 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-09 07:34:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:34:03,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:03,044 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:34:03,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:03,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:03,050 INFO L85 PathProgramCache]: Analyzing trace with hash 889510841, now seen corresponding path program 1 times [2024-11-09 07:34:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:03,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032528010] [2024-11-09 07:34:03,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:03,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:03,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:03,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032528010] [2024-11-09 07:34:03,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032528010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:03,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:34:03,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374030579] [2024-11-09 07:34:03,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:03,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:34:03,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:03,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:34:03,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:03,298 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.8) internal successors, (36), 29 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) Second operand has 4 states, 4 states have (on average 1.5) 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-09 07:34:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:03,375 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-09 07:34:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:03,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-09 07:34:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:03,387 INFO L225 Difference]: With dead ends: 31 [2024-11-09 07:34:03,387 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 07:34:03,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09 07:34:03,393 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:03,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 80 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 07:34:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 07:34:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.65) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 07:34:03,444 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 6 [2024-11-09 07:34:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:03,444 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 07:34:03,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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-09 07:34:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 07:34:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:34:03,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:03,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:34:03,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:34:03,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:03,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 889512763, now seen corresponding path program 1 times [2024-11-09 07:34:03,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:03,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392008216] [2024-11-09 07:34:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392008216] [2024-11-09 07:34:03,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392008216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:03,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:03,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:34:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130663043] [2024-11-09 07:34:03,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:03,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:34:03,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:03,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:34:03,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:34:03,551 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. 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-09 07:34:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:03,580 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-09 07:34:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:34:03,580 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-09 07:34:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:03,581 INFO L225 Difference]: With dead ends: 30 [2024-11-09 07:34:03,581 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 07:34:03,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:34:03,583 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:03,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 07:34:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-09 07:34:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.631578947368421) internal successors, (31), 27 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-09 07:34:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-09 07:34:03,590 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 6 [2024-11-09 07:34:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:03,590 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-09 07:34:03,590 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-09 07:34:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-09 07:34:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:34:03,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:03,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:03,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:34:03,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:03,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:03,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033068, now seen corresponding path program 1 times [2024-11-09 07:34:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:03,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6634016] [2024-11-09 07:34:03,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:03,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6634016] [2024-11-09 07:34:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6634016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:34:03,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885564551] [2024-11-09 07:34:03,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:03,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:34:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:03,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:34:03,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:03,748 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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-09 07:34:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:03,778 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-09 07:34:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:03,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) 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-09 07:34:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:03,779 INFO L225 Difference]: With dead ends: 33 [2024-11-09 07:34:03,780 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 07:34:03,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-09 07:34:03,781 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:03,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 07:34:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2024-11-09 07:34:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-09 07:34:03,785 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 7 [2024-11-09 07:34:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:03,786 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-09 07:34:03,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) 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-09 07:34:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-09 07:34:03,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:34:03,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:03,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:03,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:34:03,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:03,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:03,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092650, now seen corresponding path program 1 times [2024-11-09 07:34:03,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:03,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716827259] [2024-11-09 07:34:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:03,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:03,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716827259] [2024-11-09 07:34:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716827259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:03,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:03,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:34:03,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852721133] [2024-11-09 07:34:03,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:03,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:34:03,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:03,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:34:03,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:34:03,882 INFO L87 Difference]: Start difference. First operand 30 states and 33 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-09 07:34:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:03,908 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-11-09 07:34:03,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:34:03,909 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-09 07:34:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:03,909 INFO L225 Difference]: With dead ends: 28 [2024-11-09 07:34:03,909 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 07:34:03,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:34:03,911 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:03,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:03,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 07:34:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 07:34:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 27 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-09 07:34:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-09 07:34:03,915 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 7 [2024-11-09 07:34:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:03,916 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-09 07:34:03,916 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-09 07:34:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-09 07:34:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:34:03,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:03,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:03,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:34:03,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:03,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2024-11-09 07:34:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:03,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375989801] [2024-11-09 07:34:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:04,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-09 07:34:04,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375989801] [2024-11-09 07:34:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375989801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:04,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:04,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:34:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772077302] [2024-11-09 07:34:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:04,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:34:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:04,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:34:04,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:04,026 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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-09 07:34:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:04,052 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-09 07:34:04,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:04,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) 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-09 07:34:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:04,055 INFO L225 Difference]: With dead ends: 33 [2024-11-09 07:34:04,056 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 07:34:04,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:04,058 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:04,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 07:34:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-11-09 07:34:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 07:34:04,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 7 [2024-11-09 07:34:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:04,063 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 07:34:04,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) 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-09 07:34:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 07:34:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:34:04,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:04,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:04,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:34:04,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:04,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939693, now seen corresponding path program 1 times [2024-11-09 07:34:04,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:04,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633494409] [2024-11-09 07:34:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633494409] [2024-11-09 07:34:04,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633494409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:04,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:04,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:34:04,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955301126] [2024-11-09 07:34:04,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:04,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:34:04,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:04,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:34:04,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:34:04,272 INFO L87 Difference]: Start difference. First operand 29 states and 33 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-09 07:34:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:04,344 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-11-09 07:34:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:34:04,345 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-09 07:34:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:04,345 INFO L225 Difference]: With dead ends: 33 [2024-11-09 07:34:04,346 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 07:34:04,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:34:04,347 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:04,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 49 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 07:34:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-09 07:34:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.5) internal successors, (36), 30 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-09 07:34:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-11-09 07:34:04,351 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 7 [2024-11-09 07:34:04,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:04,351 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-09 07:34:04,351 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-09 07:34:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-11-09 07:34:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:34:04,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:04,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:04,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:34:04,352 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:04,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash 121448626, now seen corresponding path program 1 times [2024-11-09 07:34:04,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:04,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913070718] [2024-11-09 07:34:04,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:04,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:04,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:04,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913070718] [2024-11-09 07:34:04,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913070718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:04,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:04,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:34:04,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474337790] [2024-11-09 07:34:04,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:04,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:34:04,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:04,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:34:04,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:04,497 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-09 07:34:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:04,517 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-09 07:34:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:04,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-09 07:34:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:04,522 INFO L225 Difference]: With dead ends: 35 [2024-11-09 07:34:04,523 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 07:34:04,523 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-09 07:34:04,524 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:04,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:04,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 07:34:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 07:34:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-09 07:34:04,534 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 8 [2024-11-09 07:34:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:04,535 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-09 07:34:04,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-09 07:34:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-09 07:34:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:34:04,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:04,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:04,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:34:04,536 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:04,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:04,537 INFO L85 PathProgramCache]: Analyzing trace with hash 123295668, now seen corresponding path program 1 times [2024-11-09 07:34:04,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:04,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121887827] [2024-11-09 07:34:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:04,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:04,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:04,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121887827] [2024-11-09 07:34:04,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121887827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:04,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:04,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:34:04,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422821460] [2024-11-09 07:34:04,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:04,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:34:04,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:04,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:34:04,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:34:04,685 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-09 07:34:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:04,724 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-11-09 07:34:04,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:34:04,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-09 07:34:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:04,725 INFO L225 Difference]: With dead ends: 34 [2024-11-09 07:34:04,726 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 07:34:04,728 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-09 07:34:04,728 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:04,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 61 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 07:34:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-09 07:34:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 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-09 07:34:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-09 07:34:04,736 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 8 [2024-11-09 07:34:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:04,737 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-09 07:34:04,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-09 07:34:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-09 07:34:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:34:04,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:04,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:04,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:34:04,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:04,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash 748011989, now seen corresponding path program 1 times [2024-11-09 07:34:04,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:04,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475431523] [2024-11-09 07:34:04,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:04,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:04,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475431523] [2024-11-09 07:34:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475431523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:04,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:04,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:34:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773426530] [2024-11-09 07:34:04,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:04,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:34:04,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:04,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:34:04,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:04,810 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:04,851 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-11-09 07:34:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:04,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:34:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:04,854 INFO L225 Difference]: With dead ends: 29 [2024-11-09 07:34:04,854 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 07:34:04,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:04,855 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:04,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 07:34:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 07:34:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-09 07:34:04,861 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2024-11-09 07:34:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:04,862 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 07:34:04,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-09 07:34:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:34:04,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:04,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:04,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:34:04,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:04,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:04,867 INFO L85 PathProgramCache]: Analyzing trace with hash 748011990, now seen corresponding path program 1 times [2024-11-09 07:34:04,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:04,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999305822] [2024-11-09 07:34:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:04,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:05,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:05,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999305822] [2024-11-09 07:34:05,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999305822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:05,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:05,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:34:05,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71576253] [2024-11-09 07:34:05,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:05,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:34:05,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:05,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:34:05,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:34:05,015 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:05,080 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-11-09 07:34:05,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:34:05,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:34:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:05,082 INFO L225 Difference]: With dead ends: 39 [2024-11-09 07:34:05,082 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 07:34:05,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:34:05,083 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:05,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 54 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 07:34:05,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2024-11-09 07:34:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 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-09 07:34:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-09 07:34:05,089 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2024-11-09 07:34:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:05,089 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-09 07:34:05,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-09 07:34:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:34:05,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:05,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:05,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:34:05,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:05,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1713535197, now seen corresponding path program 1 times [2024-11-09 07:34:05,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:05,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777890364] [2024-11-09 07:34:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:05,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:05,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:05,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777890364] [2024-11-09 07:34:05,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777890364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:05,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:05,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:34:05,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993123668] [2024-11-09 07:34:05,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:05,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:34:05,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:05,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:34:05,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:34:05,211 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:34:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:05,248 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-11-09 07:34:05,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:05,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 07:34:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:05,249 INFO L225 Difference]: With dead ends: 29 [2024-11-09 07:34:05,249 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 07:34:05,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:34:05,250 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:05,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 07:34:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 07:34:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.36) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-09 07:34:05,253 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 11 [2024-11-09 07:34:05,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:05,253 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 07:34:05,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:34:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-09 07:34:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:34:05,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:05,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:05,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:34:05,255 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:05,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1713535198, now seen corresponding path program 1 times [2024-11-09 07:34:05,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:05,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263554797] [2024-11-09 07:34:05,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:05,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:05,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:05,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263554797] [2024-11-09 07:34:05,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263554797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:05,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:05,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:34:05,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478011999] [2024-11-09 07:34:05,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:05,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:34:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:05,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:34:05,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:34:05,455 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:34:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:05,498 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-09 07:34:05,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:34:05,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 07:34:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:05,499 INFO L225 Difference]: With dead ends: 40 [2024-11-09 07:34:05,499 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 07:34:05,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-09 07:34:05,500 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:05,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 07:34:05,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-09 07:34:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.28125) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 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-09 07:34:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-09 07:34:05,509 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 11 [2024-11-09 07:34:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:05,509 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-09 07:34:05,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:34:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-09 07:34:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:34:05,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:05,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:05,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:34:05,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:05,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1901373728, now seen corresponding path program 1 times [2024-11-09 07:34:05,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:05,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317771791] [2024-11-09 07:34:05,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:05,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:05,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:05,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317771791] [2024-11-09 07:34:05,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317771791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:05,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:05,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:34:05,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326864669] [2024-11-09 07:34:05,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:05,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:34:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:05,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:34:05,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:34:05,676 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:34:05,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:05,715 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-09 07:34:05,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:34:05,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 07:34:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:05,716 INFO L225 Difference]: With dead ends: 41 [2024-11-09 07:34:05,716 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 07:34:05,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:34:05,717 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:05,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 07:34:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2024-11-09 07:34:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 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-09 07:34:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-09 07:34:05,720 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2024-11-09 07:34:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:05,720 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-09 07:34:05,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:34:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-09 07:34:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:34:05,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:05,721 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:05,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:34:05,722 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:05,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2024-11-09 07:34:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:05,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027292282] [2024-11-09 07:34:05,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:05,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:05,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:05,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027292282] [2024-11-09 07:34:05,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027292282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:05,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306261216] [2024-11-09 07:34:05,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:05,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:05,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:05,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:05,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:34:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:06,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:34:06,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:06,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 07:34:06,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:34:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:06,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306261216] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:06,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:06,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-09 07:34:06,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004097371] [2024-11-09 07:34:06,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:06,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:34:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:06,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:34:06,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:34:06,512 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 17 states, 16 states have (on average 1.9375) internal successors, (31), 17 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-09 07:34:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:06,701 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-09 07:34:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:34:06,702 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 07:34:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:06,703 INFO L225 Difference]: With dead ends: 32 [2024-11-09 07:34:06,704 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 07:34:06,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:34:06,705 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:06,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 108 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:06,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 07:34:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2024-11-09 07:34:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 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-09 07:34:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-09 07:34:06,710 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 11 [2024-11-09 07:34:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:06,710 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-09 07:34:06,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 17 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-09 07:34:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-09 07:34:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:34:06,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:06,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:06,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:34:06,915 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,SelfDestructingSolverStorable13 [2024-11-09 07:34:06,916 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:06,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:06,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2054201551, now seen corresponding path program 1 times [2024-11-09 07:34:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:06,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553636367] [2024-11-09 07:34:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:07,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:07,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553636367] [2024-11-09 07:34:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553636367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:07,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:07,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:34:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223713583] [2024-11-09 07:34:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:07,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:34:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:34:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:34:07,071 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-09 07:34:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:07,120 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-09 07:34:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:34:07,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-09 07:34:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:07,121 INFO L225 Difference]: With dead ends: 37 [2024-11-09 07:34:07,121 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 07:34:07,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:34:07,122 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 93 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-09 07:34:07,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 93 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 07:34:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-11-09 07:34:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 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-09 07:34:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-09 07:34:07,124 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2024-11-09 07:34:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:07,125 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-09 07:34:07,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-09 07:34:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-09 07:34:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:34:07,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:07,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:07,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:34:07,126 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:07,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:07,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1353136973, now seen corresponding path program 1 times [2024-11-09 07:34:07,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:07,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426732678] [2024-11-09 07:34:07,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:07,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:07,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:07,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426732678] [2024-11-09 07:34:07,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426732678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:07,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:34:07,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128395469] [2024-11-09 07:34:07,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:07,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:34:07,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:07,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:34:07,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:34:07,272 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-09 07:34:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:07,331 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-11-09 07:34:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:34:07,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-09 07:34:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:07,332 INFO L225 Difference]: With dead ends: 51 [2024-11-09 07:34:07,332 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 07:34:07,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:34:07,333 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:07,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 106 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 07:34:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2024-11-09 07:34:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-09 07:34:07,335 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2024-11-09 07:34:07,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:07,336 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-09 07:34:07,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-09 07:34:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-09 07:34:07,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:34:07,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:07,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:07,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:34:07,337 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:07,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1094971535, now seen corresponding path program 1 times [2024-11-09 07:34:07,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:07,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577033964] [2024-11-09 07:34:07,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:07,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:07,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:07,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577033964] [2024-11-09 07:34:07,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577033964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:07,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:07,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:34:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679533784] [2024-11-09 07:34:07,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:07,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:34:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:07,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:34:07,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:34:07,514 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-09 07:34:07,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:07,573 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-11-09 07:34:07,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:34:07,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-09 07:34:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:07,574 INFO L225 Difference]: With dead ends: 45 [2024-11-09 07:34:07,574 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 07:34:07,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:34:07,575 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:07,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 07:34:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2024-11-09 07:34:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 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-09 07:34:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-09 07:34:07,577 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2024-11-09 07:34:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:07,577 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-09 07:34:07,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-09 07:34:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-09 07:34:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:34:07,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:07,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:07,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:34:07,578 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash 744206182, now seen corresponding path program 1 times [2024-11-09 07:34:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58740700] [2024-11-09 07:34:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:07,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:07,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:07,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58740700] [2024-11-09 07:34:07,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58740700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:34:07,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:34:07,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:34:07,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038356928] [2024-11-09 07:34:07,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:34:07,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:34:07,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:07,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:34:07,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:07,682 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 07:34:07,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:07,697 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-11-09 07:34:07,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:34:07,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-09 07:34:07,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:07,697 INFO L225 Difference]: With dead ends: 33 [2024-11-09 07:34:07,698 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 07:34:07,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:34:07,698 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:07,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:34:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 07:34:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 07:34:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-09 07:34:07,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2024-11-09 07:34:07,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:07,701 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-09 07:34:07,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-09 07:34:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-09 07:34:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:34:07,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:07,702 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-09 07:34:07,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:34:07,702 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:07,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash 317531342, now seen corresponding path program 1 times [2024-11-09 07:34:07,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:07,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138135889] [2024-11-09 07:34:07,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:07,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:07,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:07,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138135889] [2024-11-09 07:34:07,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138135889] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:07,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575855109] [2024-11-09 07:34:07,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:07,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:07,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:07,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:34:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:07,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:34:07,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:08,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:08,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:34:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:08,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575855109] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:08,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:08,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-09 07:34:08,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411772874] [2024-11-09 07:34:08,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:08,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:34:08,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:08,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:34:08,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:34:08,184 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:08,287 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-09 07:34:08,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:34:08,287 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:34:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:08,288 INFO L225 Difference]: With dead ends: 31 [2024-11-09 07:34:08,288 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 07:34:08,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:34:08,289 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:08,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 71 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 07:34:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2024-11-09 07:34:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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-09 07:34:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-11-09 07:34:08,291 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2024-11-09 07:34:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:08,291 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-11-09 07:34:08,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-11-09 07:34:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:34:08,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:08,292 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:08,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:08,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:08,492 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:08,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1253536998, now seen corresponding path program 1 times [2024-11-09 07:34:08,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:08,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001415605] [2024-11-09 07:34:08,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:08,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:08,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:08,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001415605] [2024-11-09 07:34:08,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001415605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:08,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158095099] [2024-11-09 07:34:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:08,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:08,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:08,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:08,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:34:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:08,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 07:34:08,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:08,867 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-09 07:34:08,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:34:08,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:34:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:08,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:09,162 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:34:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158095099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:09,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:09,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2024-11-09 07:34:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229463568] [2024-11-09 07:34:09,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:09,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:34:09,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:09,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:34:09,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-09 07:34:09,204 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 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-09 07:34:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:09,387 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-11-09 07:34:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:34:09,387 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:34:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:09,388 INFO L225 Difference]: With dead ends: 30 [2024-11-09 07:34:09,388 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 07:34:09,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:34:09,389 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:09,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 58 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 07:34:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-11-09 07:34:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 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-09 07:34:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-09 07:34:09,391 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2024-11-09 07:34:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:09,391 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-09 07:34:09,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 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-09 07:34:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-09 07:34:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:34:09,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:09,392 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:09,413 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-09 07:34:09,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:09,597 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:09,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash -619936215, now seen corresponding path program 2 times [2024-11-09 07:34:09,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:09,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130674343] [2024-11-09 07:34:09,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:09,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:09,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130674343] [2024-11-09 07:34:09,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130674343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:09,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740531486] [2024-11-09 07:34:09,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:34:09,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:09,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:09,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:34:10,025 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:34:10,026 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:10,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:34:10,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:10,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:34:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:10,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:10,152 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 15 treesize of output 13 [2024-11-09 07:34:10,155 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 16 treesize of output 12 [2024-11-09 07:34:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:10,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740531486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:10,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:10,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2024-11-09 07:34:10,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058049328] [2024-11-09 07:34:10,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:10,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:34:10,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:10,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:34:10,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:34:10,212 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:10,340 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-09 07:34:10,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:34:10,340 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:34:10,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:10,341 INFO L225 Difference]: With dead ends: 42 [2024-11-09 07:34:10,341 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 07:34:10,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:34:10,342 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:10,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 94 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 07:34:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-09 07:34:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-11-09 07:34:10,344 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 22 [2024-11-09 07:34:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:10,344 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-09 07:34:10,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-11-09 07:34:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:34:10,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:10,345 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:10,364 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-09 07:34:10,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:10,546 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:10,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash -399184250, now seen corresponding path program 3 times [2024-11-09 07:34:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:10,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834954747] [2024-11-09 07:34:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:10,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:10,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834954747] [2024-11-09 07:34:10,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834954747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:10,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141236307] [2024-11-09 07:34:10,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:34:10,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:10,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:10,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:10,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:34:10,856 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 07:34:10,856 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:10,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:34:10,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:10,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:34:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:11,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:11,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141236307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:11,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:11,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-09 07:34:11,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11987725] [2024-11-09 07:34:11,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:11,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:34:11,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:11,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:34:11,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:34:11,273 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 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-09 07:34:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:11,435 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-09 07:34:11,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:34:11,436 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 07:34:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:11,436 INFO L225 Difference]: With dead ends: 36 [2024-11-09 07:34:11,436 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 07:34:11,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:34:11,439 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:11,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 109 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:34:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 07:34:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2024-11-09 07:34:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-11-09 07:34:11,445 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2024-11-09 07:34:11,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:11,445 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-11-09 07:34:11,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 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-09 07:34:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-11-09 07:34:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:34:11,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:11,446 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:11,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:11,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 07:34:11,647 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:11,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash 510190126, now seen corresponding path program 2 times [2024-11-09 07:34:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:11,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101660908] [2024-11-09 07:34:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:11,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:11,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101660908] [2024-11-09 07:34:11,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101660908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:11,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363566492] [2024-11-09 07:34:11,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:34:11,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:11,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:11,950 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:11,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:34:12,095 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:34:12,096 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:12,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 07:34:12,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:12,141 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-09 07:34:12,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:34:12,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:34:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:12,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:13,108 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:34:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:13,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363566492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:13,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:13,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 28 [2024-11-09 07:34:13,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760411436] [2024-11-09 07:34:13,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:13,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 07:34:13,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:13,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 07:34:13,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:34:13,151 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 29 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 29 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:13,431 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-11-09 07:34:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:34:13,431 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 29 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-09 07:34:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:13,433 INFO L225 Difference]: With dead ends: 42 [2024-11-09 07:34:13,433 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 07:34:13,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2024-11-09 07:34:13,434 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:13,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 95 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:34:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 07:34:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2024-11-09 07:34:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-09 07:34:13,437 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2024-11-09 07:34:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:13,438 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-09 07:34:13,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 29 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-09 07:34:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:34:13,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:13,439 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:13,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:13,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:13,640 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:13,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:13,640 INFO L85 PathProgramCache]: Analyzing trace with hash -815221791, now seen corresponding path program 4 times [2024-11-09 07:34:13,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:13,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913601355] [2024-11-09 07:34:13,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:13,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913601355] [2024-11-09 07:34:13,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913601355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618979890] [2024-11-09 07:34:13,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:34:13,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:13,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:13,909 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:13,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:34:13,992 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:34:13,992 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:13,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 07:34:13,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:14,031 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-09 07:34:14,604 INFO L349 Elim1Store]: treesize reduction 8, result has 76.5 percent of original size [2024-11-09 07:34:14,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2024-11-09 07:34:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:34:14,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:15,282 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 44 treesize of output 38 [2024-11-09 07:34:15,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2024-11-09 07:34:15,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:34:15,330 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:34:15,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618979890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:15,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:15,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2024-11-09 07:34:15,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895007650] [2024-11-09 07:34:15,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:15,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 07:34:15,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:15,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 07:34:15,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 07:34:15,333 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:16,342 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2024-11-09 07:34:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 07:34:16,342 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 07:34:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:16,343 INFO L225 Difference]: With dead ends: 55 [2024-11-09 07:34:16,343 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 07:34:16,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=377, Invalid=2275, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 07:34:16,344 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:16,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 118 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:34:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 07:34:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2024-11-09 07:34:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-11-09 07:34:16,348 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2024-11-09 07:34:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:16,349 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-11-09 07:34:16,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-11-09 07:34:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:34:16,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:16,351 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:16,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 07:34:16,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:16,552 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:16,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash -232228746, now seen corresponding path program 3 times [2024-11-09 07:34:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:16,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657707381] [2024-11-09 07:34:16,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:16,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:16,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:16,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657707381] [2024-11-09 07:34:16,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657707381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:16,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175692384] [2024-11-09 07:34:16,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:34:16,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:16,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:16,944 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:16,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:34:17,058 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 07:34:17,059 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:17,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 07:34:17,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:17,119 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-09 07:34:17,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:34:17,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:34:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:17,774 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:18,126 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:34:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:18,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175692384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:18,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:18,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2024-11-09 07:34:18,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062435786] [2024-11-09 07:34:18,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:18,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 07:34:18,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:18,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 07:34:18,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2024-11-09 07:34:18,184 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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-09 07:34:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:18,419 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-09 07:34:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:34:18,420 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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 35 [2024-11-09 07:34:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:18,420 INFO L225 Difference]: With dead ends: 42 [2024-11-09 07:34:18,420 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 07:34:18,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 07:34:18,422 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:18,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 122 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:34:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 07:34:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-09 07:34:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 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-09 07:34:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-11-09 07:34:18,424 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 35 [2024-11-09 07:34:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:18,424 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-09 07:34:18,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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-09 07:34:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-11-09 07:34:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:34:18,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:18,425 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:18,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:34:18,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 07:34:18,626 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:18,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1068038779, now seen corresponding path program 4 times [2024-11-09 07:34:18,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:18,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674869215] [2024-11-09 07:34:18,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:19,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:19,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674869215] [2024-11-09 07:34:19,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674869215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:19,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434062154] [2024-11-09 07:34:19,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:34:19,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:19,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:19,036 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:19,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:34:19,123 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:34:19,123 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:19,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 07:34:19,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:19,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:34:19,331 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-09 07:34:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:19,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:19,377 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 15 treesize of output 13 [2024-11-09 07:34:19,378 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 16 treesize of output 12 [2024-11-09 07:34:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:19,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434062154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:19,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:19,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2024-11-09 07:34:19,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350983233] [2024-11-09 07:34:19,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:19,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 07:34:19,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:19,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 07:34:19,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2024-11-09 07:34:19,448 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 28 states have internal predecessors, (78), 0 states have call successors, (0), 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-09 07:34:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:19,895 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2024-11-09 07:34:19,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:34:19,896 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 28 states have internal predecessors, (78), 0 states have call successors, (0), 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 39 [2024-11-09 07:34:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:19,896 INFO L225 Difference]: With dead ends: 65 [2024-11-09 07:34:19,896 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 07:34:19,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1483, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 07:34:19,897 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:19,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 197 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:34:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 07:34:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-09 07:34:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 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-09 07:34:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2024-11-09 07:34:19,899 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 39 [2024-11-09 07:34:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:19,900 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2024-11-09 07:34:19,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7857142857142856) internal successors, (78), 28 states have internal predecessors, (78), 0 states have call successors, (0), 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-09 07:34:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2024-11-09 07:34:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:34:19,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:19,901 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:19,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 07:34:20,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 07:34:20,101 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:20,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:20,102 INFO L85 PathProgramCache]: Analyzing trace with hash -732121154, now seen corresponding path program 5 times [2024-11-09 07:34:20,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:20,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880265561] [2024-11-09 07:34:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:20,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:20,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:20,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880265561] [2024-11-09 07:34:20,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880265561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:20,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158134323] [2024-11-09 07:34:20,565 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 07:34:20,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:20,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:20,567 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:20,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:34:20,697 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-09 07:34:20,698 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:20,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-09 07:34:20,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:20,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:34:20,753 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-09 07:34:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:21,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:22,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158134323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:22,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:22,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2024-11-09 07:34:22,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127135038] [2024-11-09 07:34:22,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:22,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 07:34:22,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:22,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 07:34:22,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1393, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 07:34:22,582 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 40 states, 39 states have (on average 3.2564102564102564) internal successors, (127), 40 states have internal predecessors, (127), 0 states have call successors, (0), 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-09 07:34:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:23,337 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2024-11-09 07:34:23,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:34:23,337 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.2564102564102564) internal successors, (127), 40 states have internal predecessors, (127), 0 states have call successors, (0), 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 43 [2024-11-09 07:34:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:23,338 INFO L225 Difference]: With dead ends: 50 [2024-11-09 07:34:23,338 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 07:34:23,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=309, Invalid=2447, Unknown=0, NotChecked=0, Total=2756 [2024-11-09 07:34:23,339 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:23,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 221 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:34:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 07:34:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-11-09 07:34:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 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-09 07:34:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-11-09 07:34:23,341 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 43 [2024-11-09 07:34:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:23,341 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-11-09 07:34:23,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.2564102564102564) internal successors, (127), 40 states have internal predecessors, (127), 0 states have call successors, (0), 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-09 07:34:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-11-09 07:34:23,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:34:23,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:23,342 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:23,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:23,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 07:34:23,543 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:23,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1671189955, now seen corresponding path program 6 times [2024-11-09 07:34:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:23,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064845506] [2024-11-09 07:34:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 33 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:24,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:24,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064845506] [2024-11-09 07:34:24,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064845506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:24,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473427978] [2024-11-09 07:34:24,031 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 07:34:24,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:24,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:24,033 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:24,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:34:24,174 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2024-11-09 07:34:24,174 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:24,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 07:34:24,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:24,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:34:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:24,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:24,561 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 15 treesize of output 13 [2024-11-09 07:34:24,563 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 16 treesize of output 12 [2024-11-09 07:34:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473427978] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:24,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:24,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2024-11-09 07:34:24,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316305747] [2024-11-09 07:34:24,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:24,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 07:34:24,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:24,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 07:34:24,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2024-11-09 07:34:24,653 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 32 states, 32 states have (on average 2.9375) internal successors, (94), 32 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:25,331 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2024-11-09 07:34:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:34:25,331 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.9375) internal successors, (94), 32 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 07:34:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:25,332 INFO L225 Difference]: With dead ends: 77 [2024-11-09 07:34:25,332 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 07:34:25,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=2060, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 07:34:25,333 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:25,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 292 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:34:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 07:34:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-11-09 07:34:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 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-09 07:34:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2024-11-09 07:34:25,337 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 47 [2024-11-09 07:34:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:25,337 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2024-11-09 07:34:25,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.9375) internal successors, (94), 32 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2024-11-09 07:34:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 07:34:25,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:25,337 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:25,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:25,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 07:34:25,538 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:25,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash -382984186, now seen corresponding path program 7 times [2024-11-09 07:34:25,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:25,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185709556] [2024-11-09 07:34:25,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:26,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:26,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185709556] [2024-11-09 07:34:26,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185709556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:26,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61325126] [2024-11-09 07:34:26,094 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 07:34:26,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:26,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:26,096 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:26,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:34:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:26,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 07:34:26,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:26,251 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-09 07:34:26,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:34:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:27,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:28,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61325126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:28,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:28,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 45 [2024-11-09 07:34:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837937288] [2024-11-09 07:34:28,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:28,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 07:34:28,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:28,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 07:34:28,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1877, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 07:34:28,213 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 46 states, 45 states have (on average 3.3555555555555556) internal successors, (151), 46 states have internal predecessors, (151), 0 states have call successors, (0), 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-09 07:34:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:28,974 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2024-11-09 07:34:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:34:28,975 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.3555555555555556) internal successors, (151), 46 states have internal predecessors, (151), 0 states have call successors, (0), 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 51 [2024-11-09 07:34:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:28,975 INFO L225 Difference]: With dead ends: 59 [2024-11-09 07:34:28,975 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 07:34:28,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=321, Invalid=2649, Unknown=0, NotChecked=0, Total=2970 [2024-11-09 07:34:28,977 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:28,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 326 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:34:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 07:34:28,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2024-11-09 07:34:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 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-09 07:34:28,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2024-11-09 07:34:28,979 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 51 [2024-11-09 07:34:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:28,979 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2024-11-09 07:34:28,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.3555555555555556) internal successors, (151), 46 states have internal predecessors, (151), 0 states have call successors, (0), 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-09 07:34:28,980 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2024-11-09 07:34:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 07:34:28,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:28,980 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:28,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 07:34:29,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 07:34:29,185 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:29,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash 913201675, now seen corresponding path program 8 times [2024-11-09 07:34:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:29,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326927532] [2024-11-09 07:34:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 51 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:29,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326927532] [2024-11-09 07:34:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326927532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769325909] [2024-11-09 07:34:29,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:34:29,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:29,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:29,778 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:29,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 07:34:29,901 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:34:29,901 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:29,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 07:34:29,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:30,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:34:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:30,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:30,288 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 15 treesize of output 13 [2024-11-09 07:34:30,289 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 16 treesize of output 12 [2024-11-09 07:34:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:30,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769325909] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:30,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:30,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2024-11-09 07:34:30,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913229025] [2024-11-09 07:34:30,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:30,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 07:34:30,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:30,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 07:34:30,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1164, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 07:34:30,376 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 36 states have internal predecessors, (110), 0 states have call successors, (0), 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-09 07:34:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:31,164 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2024-11-09 07:34:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:34:31,164 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 36 states have internal predecessors, (110), 0 states have call successors, (0), 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 55 [2024-11-09 07:34:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:31,165 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:34:31,165 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 07:34:31,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=2731, Unknown=0, NotChecked=0, Total=2970 [2024-11-09 07:34:31,166 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:31,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 398 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:34:31,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 07:34:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2024-11-09 07:34:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2024-11-09 07:34:31,168 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 55 [2024-11-09 07:34:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:31,169 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2024-11-09 07:34:31,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0555555555555554) internal successors, (110), 36 states have internal predecessors, (110), 0 states have call successors, (0), 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-09 07:34:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2024-11-09 07:34:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 07:34:31,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:31,170 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:31,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:31,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:31,370 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:31,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1971506866, now seen corresponding path program 9 times [2024-11-09 07:34:31,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:31,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835628434] [2024-11-09 07:34:31,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:31,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:31,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:31,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835628434] [2024-11-09 07:34:31,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835628434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:31,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120459335] [2024-11-09 07:34:31,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:34:31,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:31,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:31,988 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:31,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 07:34:32,375 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 07:34:32,375 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:32,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-09 07:34:32,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:32,426 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-09 07:34:32,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:34:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 45 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:33,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:34,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120459335] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:34,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:34,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 51 [2024-11-09 07:34:34,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229300927] [2024-11-09 07:34:34,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:34,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 07:34:34,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:34,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 07:34:34,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2374, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 07:34:34,889 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 52 states, 51 states have (on average 3.4313725490196076) internal successors, (175), 52 states have internal predecessors, (175), 0 states have call successors, (0), 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-09 07:34:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:36,042 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2024-11-09 07:34:36,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:34:36,042 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 3.4313725490196076) internal successors, (175), 52 states have internal predecessors, (175), 0 states have call successors, (0), 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 59 [2024-11-09 07:34:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:36,043 INFO L225 Difference]: With dead ends: 66 [2024-11-09 07:34:36,043 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 07:34:36,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=514, Invalid=4178, Unknown=0, NotChecked=0, Total=4692 [2024-11-09 07:34:36,044 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:36,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 376 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:34:36,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 07:34:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-09 07:34:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 63 states have internal predecessors, (65), 0 states have call successors, (0), 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-09 07:34:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2024-11-09 07:34:36,046 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 59 [2024-11-09 07:34:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:36,046 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2024-11-09 07:34:36,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.4313725490196076) internal successors, (175), 52 states have internal predecessors, (175), 0 states have call successors, (0), 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-09 07:34:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2024-11-09 07:34:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 07:34:36,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:36,047 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:36,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:36,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:36,247 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:36,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1161459885, now seen corresponding path program 10 times [2024-11-09 07:34:36,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:36,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535252157] [2024-11-09 07:34:36,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:36,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 73 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:36,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535252157] [2024-11-09 07:34:36,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535252157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:36,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425810600] [2024-11-09 07:34:36,861 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:34:36,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:36,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:36,862 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:36,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 07:34:37,029 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:34:37,030 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:37,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 07:34:37,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:37,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:34:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:37,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:37,483 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 15 treesize of output 13 [2024-11-09 07:34:37,485 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 16 treesize of output 12 [2024-11-09 07:34:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 20 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:37,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425810600] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:37,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:37,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2024-11-09 07:34:37,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671826293] [2024-11-09 07:34:37,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:37,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 07:34:37,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:37,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 07:34:37,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1450, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 07:34:37,576 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 40 states, 40 states have (on average 3.15) internal successors, (126), 40 states have internal predecessors, (126), 0 states have call successors, (0), 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-09 07:34:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:38,528 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2024-11-09 07:34:38,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 07:34:38,528 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.15) internal successors, (126), 40 states have internal predecessors, (126), 0 states have call successors, (0), 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 63 [2024-11-09 07:34:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:38,529 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:34:38,529 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 07:34:38,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=286, Invalid=3496, Unknown=0, NotChecked=0, Total=3782 [2024-11-09 07:34:38,530 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:38,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 477 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:34:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 07:34:38,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-11-09 07:34:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:34:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2024-11-09 07:34:38,533 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 63 [2024-11-09 07:34:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:38,533 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2024-11-09 07:34:38,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.15) internal successors, (126), 40 states have internal predecessors, (126), 0 states have call successors, (0), 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-09 07:34:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2024-11-09 07:34:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 07:34:38,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:38,534 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:38,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-09 07:34:38,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:38,735 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:38,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:38,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1744202646, now seen corresponding path program 11 times [2024-11-09 07:34:38,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:38,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426490975] [2024-11-09 07:34:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:38,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 45 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:39,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:39,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426490975] [2024-11-09 07:34:39,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426490975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:39,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563068083] [2024-11-09 07:34:39,407 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 07:34:39,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:39,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:39,408 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:39,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 07:34:39,668 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-09 07:34:39,668 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:39,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-09 07:34:39,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:39,708 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-09 07:34:39,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:34:39,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:34:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:40,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:41,514 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:34:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 91 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:41,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563068083] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:41,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:41,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 20] total 55 [2024-11-09 07:34:41,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697883905] [2024-11-09 07:34:41,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:41,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-09 07:34:41,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:41,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-09 07:34:41,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=2748, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 07:34:41,592 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 56 states, 55 states have (on average 3.618181818181818) internal successors, (199), 56 states have internal predecessors, (199), 0 states have call successors, (0), 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-09 07:34:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:42,251 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2024-11-09 07:34:42,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 07:34:42,251 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 3.618181818181818) internal successors, (199), 56 states have internal predecessors, (199), 0 states have call successors, (0), 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 67 [2024-11-09 07:34:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:42,252 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:34:42,252 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 07:34:42,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=362, Invalid=2944, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 07:34:42,253 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:42,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 488 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:34:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 07:34:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-11-09 07:34:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 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-09 07:34:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2024-11-09 07:34:42,255 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2024-11-09 07:34:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:42,255 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-11-09 07:34:42,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 3.618181818181818) internal successors, (199), 56 states have internal predecessors, (199), 0 states have call successors, (0), 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-09 07:34:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2024-11-09 07:34:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 07:34:42,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:42,256 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:42,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:42,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-09 07:34:42,457 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:42,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:42,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1762155931, now seen corresponding path program 12 times [2024-11-09 07:34:42,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:42,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598792466] [2024-11-09 07:34:42,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:42,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 99 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:43,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:43,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598792466] [2024-11-09 07:34:43,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598792466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:43,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924160241] [2024-11-09 07:34:43,251 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 07:34:43,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:43,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:43,253 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:43,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 07:34:43,649 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-09 07:34:43,649 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:43,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-09 07:34:43,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:43,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:34:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 23 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:44,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:44,682 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 15 treesize of output 13 [2024-11-09 07:34:44,683 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 16 treesize of output 12 [2024-11-09 07:34:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 23 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:45,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924160241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:45,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:45,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 61 [2024-11-09 07:34:45,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934856613] [2024-11-09 07:34:45,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:45,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-09 07:34:45,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:45,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-09 07:34:45,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3481, Unknown=0, NotChecked=0, Total=3660 [2024-11-09 07:34:45,076 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 61 states, 61 states have (on average 3.262295081967213) internal successors, (199), 61 states have internal predecessors, (199), 0 states have call successors, (0), 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-09 07:34:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:46,766 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2024-11-09 07:34:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 07:34:46,766 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 3.262295081967213) internal successors, (199), 61 states have internal predecessors, (199), 0 states have call successors, (0), 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 71 [2024-11-09 07:34:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:46,767 INFO L225 Difference]: With dead ends: 113 [2024-11-09 07:34:46,767 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 07:34:46,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=421, Invalid=7061, Unknown=0, NotChecked=0, Total=7482 [2024-11-09 07:34:46,769 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:46,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 710 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:34:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 07:34:46,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-11-09 07:34:46,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 75 states have internal predecessors, (77), 0 states have call successors, (0), 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-09 07:34:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2024-11-09 07:34:46,771 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2024-11-09 07:34:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:46,771 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2024-11-09 07:34:46,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 3.262295081967213) internal successors, (199), 61 states have internal predecessors, (199), 0 states have call successors, (0), 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-09 07:34:46,771 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2024-11-09 07:34:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 07:34:46,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:46,772 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:46,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:46,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:46,972 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:46,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:46,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1493283106, now seen corresponding path program 13 times [2024-11-09 07:34:46,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:46,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976935660] [2024-11-09 07:34:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:47,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976935660] [2024-11-09 07:34:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976935660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490211861] [2024-11-09 07:34:47,707 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 07:34:47,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:47,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:47,708 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:47,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 07:34:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:47,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-09 07:34:47,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:47,882 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-09 07:34:47,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:34:47,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:34:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:48,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:49,477 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:34:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 120 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:49,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490211861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:49,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:49,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2024-11-09 07:34:49,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611352023] [2024-11-09 07:34:49,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:49,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-09 07:34:49,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:49,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-09 07:34:49,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3465, Unknown=0, NotChecked=0, Total=3782 [2024-11-09 07:34:49,538 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 62 states, 61 states have (on average 3.6557377049180326) internal successors, (223), 62 states have internal predecessors, (223), 0 states have call successors, (0), 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-09 07:34:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:50,450 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2024-11-09 07:34:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:34:50,451 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.6557377049180326) internal successors, (223), 62 states have internal predecessors, (223), 0 states have call successors, (0), 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 75 [2024-11-09 07:34:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:50,451 INFO L225 Difference]: With dead ends: 82 [2024-11-09 07:34:50,451 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 07:34:50,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=504, Invalid=4608, Unknown=0, NotChecked=0, Total=5112 [2024-11-09 07:34:50,452 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:50,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 608 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:34:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 07:34:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-11-09 07:34:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 0 states have call successors, (0), 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-09 07:34:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2024-11-09 07:34:50,455 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 75 [2024-11-09 07:34:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:50,455 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2024-11-09 07:34:50,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.6557377049180326) internal successors, (223), 62 states have internal predecessors, (223), 0 states have call successors, (0), 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-09 07:34:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2024-11-09 07:34:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 07:34:50,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:50,456 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:50,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-09 07:34:50,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:50,657 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:50,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1331518691, now seen corresponding path program 14 times [2024-11-09 07:34:50,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:50,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425624839] [2024-11-09 07:34:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:50,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 129 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:51,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:51,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425624839] [2024-11-09 07:34:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425624839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732555960] [2024-11-09 07:34:51,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:34:51,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:51,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:51,567 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:51,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 07:34:51,727 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:34:51,727 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:51,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-09 07:34:51,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:52,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:34:52,457 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 26 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:52,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:52,497 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 15 treesize of output 13 [2024-11-09 07:34:52,498 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 16 treesize of output 12 [2024-11-09 07:34:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 26 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:52,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732555960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:52,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:52,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2024-11-09 07:34:52,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549919897] [2024-11-09 07:34:52,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:52,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 07:34:52,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:52,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 07:34:52,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2115, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 07:34:52,605 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 48 states, 48 states have (on average 3.2916666666666665) internal successors, (158), 48 states have internal predecessors, (158), 0 states have call successors, (0), 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-09 07:34:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:53,992 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2024-11-09 07:34:53,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 07:34:53,992 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.2916666666666665) internal successors, (158), 48 states have internal predecessors, (158), 0 states have call successors, (0), 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 79 [2024-11-09 07:34:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:53,993 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:34:53,993 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 07:34:53,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=392, Invalid=5308, Unknown=0, NotChecked=0, Total=5700 [2024-11-09 07:34:53,994 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:53,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 692 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:34:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 07:34:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-09 07:34:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 0 states have call successors, (0), 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-09 07:34:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2024-11-09 07:34:53,996 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 79 [2024-11-09 07:34:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:53,997 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2024-11-09 07:34:53,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.2916666666666665) internal successors, (158), 48 states have internal predecessors, (158), 0 states have call successors, (0), 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-09 07:34:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2024-11-09 07:34:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 07:34:53,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:53,998 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:54,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-09 07:34:54,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:54,202 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:34:54,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:34:54,202 INFO L85 PathProgramCache]: Analyzing trace with hash 45832998, now seen corresponding path program 15 times [2024-11-09 07:34:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:34:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020592465] [2024-11-09 07:34:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:34:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:34:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:34:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 91 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:55,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:34:55,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020592465] [2024-11-09 07:34:55,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020592465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:34:55,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336657419] [2024-11-09 07:34:55,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:34:55,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:34:55,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:34:55,390 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:34:55,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 07:34:55,873 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-09 07:34:55,873 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:34:55,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-09 07:34:55,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:34:55,918 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-09 07:34:55,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:34:55,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:34:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:57,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:34:58,561 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:34:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:34:58,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336657419] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:34:58,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:34:58,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 71 [2024-11-09 07:34:58,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309987989] [2024-11-09 07:34:58,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:34:58,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-11-09 07:34:58,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:34:58,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-11-09 07:34:58,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=4651, Unknown=0, NotChecked=0, Total=5112 [2024-11-09 07:34:58,650 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 72 states, 71 states have (on average 3.4788732394366195) internal successors, (247), 72 states have internal predecessors, (247), 0 states have call successors, (0), 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-09 07:34:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:34:59,869 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2024-11-09 07:34:59,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 07:34:59,869 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 3.4788732394366195) internal successors, (247), 72 states have internal predecessors, (247), 0 states have call successors, (0), 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 83 [2024-11-09 07:34:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:34:59,870 INFO L225 Difference]: With dead ends: 97 [2024-11-09 07:34:59,870 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 07:34:59,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1909 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=612, Invalid=6030, Unknown=0, NotChecked=0, Total=6642 [2024-11-09 07:34:59,871 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:34:59,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 674 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:34:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 07:34:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2024-11-09 07:34:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 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-09 07:34:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2024-11-09 07:34:59,873 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 83 [2024-11-09 07:34:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:34:59,874 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2024-11-09 07:34:59,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 3.4788732394366195) internal successors, (247), 72 states have internal predecessors, (247), 0 states have call successors, (0), 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-09 07:34:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2024-11-09 07:34:59,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 07:34:59,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:34:59,874 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:34:59,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-09 07:35:00,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 07:35:00,075 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:35:00,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:35:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash 833291563, now seen corresponding path program 16 times [2024-11-09 07:35:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:35:00,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147180202] [2024-11-09 07:35:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:35:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:35:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:35:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 163 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:35:00,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:35:00,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147180202] [2024-11-09 07:35:00,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147180202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:35:00,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552022373] [2024-11-09 07:35:00,983 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:35:00,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:35:00,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:35:00,985 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:35:00,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 07:35:01,359 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:35:01,359 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:35:01,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 07:35:01,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:35:01,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:35:02,023 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-09 07:35:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 29 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:35:02,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:35:02,117 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 15 treesize of output 13 [2024-11-09 07:35:02,118 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 16 treesize of output 12 [2024-11-09 07:35:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 29 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:35:02,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552022373] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:35:02,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:35:02,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2024-11-09 07:35:02,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179893217] [2024-11-09 07:35:02,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:35:02,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 07:35:02,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:35:02,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 07:35:02,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2494, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 07:35:02,236 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 52 states, 52 states have (on average 3.3461538461538463) internal successors, (174), 52 states have internal predecessors, (174), 0 states have call successors, (0), 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-09 07:35:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:35:03,891 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2024-11-09 07:35:03,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 07:35:03,892 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3461538461538463) internal successors, (174), 52 states have internal predecessors, (174), 0 states have call successors, (0), 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 87 [2024-11-09 07:35:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:35:03,892 INFO L225 Difference]: With dead ends: 137 [2024-11-09 07:35:03,892 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 07:35:03,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=451, Invalid=6355, Unknown=0, NotChecked=0, Total=6806 [2024-11-09 07:35:03,894 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 26 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:35:03,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 820 Invalid, 2324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:35:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 07:35:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-11-09 07:35:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:35:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2024-11-09 07:35:03,896 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2024-11-09 07:35:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:35:03,896 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2024-11-09 07:35:03,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3461538461538463) internal successors, (174), 52 states have internal predecessors, (174), 0 states have call successors, (0), 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-09 07:35:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2024-11-09 07:35:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 07:35:03,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:35:03,898 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:35:03,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-09 07:35:04,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-09 07:35:04,098 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:35:04,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:35:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash -334229394, now seen corresponding path program 17 times [2024-11-09 07:35:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:35:04,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307436392] [2024-11-09 07:35:04,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:35:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:35:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:35:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 120 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:35:04,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:35:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307436392] [2024-11-09 07:35:04,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307436392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:35:04,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206301018] [2024-11-09 07:35:04,982 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 07:35:04,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:35:04,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:35:04,983 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:35:04,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 07:35:05,648 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-09 07:35:05,648 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:35:05,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-09 07:35:05,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:35:05,686 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-09 07:35:05,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:35:05,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:35:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:35:07,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:35:08,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:35:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:35:08,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206301018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:35:08,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:35:08,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 27] total 76 [2024-11-09 07:35:08,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074659296] [2024-11-09 07:35:08,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:35:08,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-11-09 07:35:08,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:35:08,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-11-09 07:35:08,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=5332, Unknown=0, NotChecked=0, Total=5852 [2024-11-09 07:35:08,721 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 77 states, 76 states have (on average 3.5657894736842106) internal successors, (271), 77 states have internal predecessors, (271), 0 states have call successors, (0), 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-09 07:35:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:35:10,216 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2024-11-09 07:35:10,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 07:35:10,216 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 3.5657894736842106) internal successors, (271), 77 states have internal predecessors, (271), 0 states have call successors, (0), 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 91 [2024-11-09 07:35:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:35:10,217 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:35:10,217 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 07:35:10,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2222 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=694, Invalid=6962, Unknown=0, NotChecked=0, Total=7656 [2024-11-09 07:35:10,218 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:35:10,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 885 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 07:35:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 07:35:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2024-11-09 07:35:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:35:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2024-11-09 07:35:10,220 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 91 [2024-11-09 07:35:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:35:10,221 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2024-11-09 07:35:10,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 3.5657894736842106) internal successors, (271), 77 states have internal predecessors, (271), 0 states have call successors, (0), 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-09 07:35:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2024-11-09 07:35:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 07:35:10,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:35:10,222 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:35:10,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-09 07:35:10,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-09 07:35:10,423 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:35:10,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:35:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1449666957, now seen corresponding path program 18 times [2024-11-09 07:35:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:35:10,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024513618] [2024-11-09 07:35:10,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:35:10,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:35:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:35:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 201 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:35:11,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:35:11,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024513618] [2024-11-09 07:35:11,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024513618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:35:11,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871796592] [2024-11-09 07:35:11,454 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 07:35:11,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:35:11,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:35:11,455 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:35:11,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-09 07:35:12,716 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2024-11-09 07:35:12,717 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:35:12,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-09 07:35:12,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:35:13,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:35:13,793 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-09 07:35:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 32 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:35:13,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:35:14,365 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 15 treesize of output 13 [2024-11-09 07:35:14,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-09 07:35:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 32 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:35:14,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871796592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:35:14,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:35:14,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 79 [2024-11-09 07:35:14,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947867459] [2024-11-09 07:35:14,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:35:14,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2024-11-09 07:35:14,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:35:14,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2024-11-09 07:35:14,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=5915, Unknown=0, NotChecked=0, Total=6162 [2024-11-09 07:35:14,970 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 79 states, 79 states have (on average 3.430379746835443) internal successors, (271), 79 states have internal predecessors, (271), 0 states have call successors, (0), 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-09 07:35:17,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:35:17,871 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2024-11-09 07:35:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 07:35:17,871 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 3.430379746835443) internal successors, (271), 79 states have internal predecessors, (271), 0 states have call successors, (0), 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 95 [2024-11-09 07:35:17,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:35:17,872 INFO L225 Difference]: With dead ends: 149 [2024-11-09 07:35:17,872 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 07:35:17,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=622, Invalid=12260, Unknown=0, NotChecked=0, Total=12882 [2024-11-09 07:35:17,873 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 3562 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 3592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:35:17,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1289 Invalid, 3592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3562 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 07:35:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 07:35:17,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2024-11-09 07:35:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.02020202020202) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:35:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2024-11-09 07:35:17,875 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2024-11-09 07:35:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:35:17,875 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2024-11-09 07:35:17,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 3.430379746835443) internal successors, (271), 79 states have internal predecessors, (271), 0 states have call successors, (0), 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-09 07:35:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2024-11-09 07:35:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 07:35:17,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:35:17,876 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:35:17,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-09 07:35:18,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:35:18,077 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:35:18,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:35:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1448153418, now seen corresponding path program 19 times [2024-11-09 07:35:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:35:18,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483758504] [2024-11-09 07:35:18,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:35:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:35:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat