./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:19:58,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:19:58,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:19:58,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:19:58,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:19:58,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:19:58,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:19:58,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:19:58,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:19:58,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:19:58,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:19:58,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:19:58,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:19:58,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:19:58,195 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:19:58,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:19:58,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:19:58,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:19:58,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:19:58,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:19:58,197 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:19:58,201 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:19:58,202 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:19:58,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:19:58,202 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:19:58,202 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:19:58,203 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:19:58,203 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:19:58,203 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:19:58,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:19:58,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:19:58,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:19:58,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:19:58,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:19:58,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:19:58,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:19:58,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:19:58,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:19:58,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:19:58,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:19:58,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:19:58,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:19:58,211 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-clean/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-clean/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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2024-10-11 18:19:58,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:19:58,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:19:58,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:19:58,493 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:19:58,494 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:19:58,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2024-10-11 18:19:59,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:20:00,196 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:20:00,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2024-10-11 18:20:00,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dc4987b57/abe4b26bfad5499198e364b0f9acc5ff/FLAG68eca66f2 [2024-10-11 18:20:00,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dc4987b57/abe4b26bfad5499198e364b0f9acc5ff [2024-10-11 18:20:00,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:20:00,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:20:00,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:20:00,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:20:00,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:20:00,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f4022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00, skipping insertion in model container [2024-10-11 18:20:00,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:20:00,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:20:00,638 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:20:00,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:20:00,739 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:20:00,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00 WrapperNode [2024-10-11 18:20:00,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:20:00,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:20:00,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:20:00,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:20:00,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,784 INFO L138 Inliner]: procedures = 122, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2024-10-11 18:20:00,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:20:00,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:20:00,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:20:00,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:20:00,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,820 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-10-11 18:20:00,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:20:00,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:20:00,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:20:00,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:20:00,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (1/1) ... [2024-10-11 18:20:00,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:20:00,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:00,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:20:00,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:20:00,941 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 18:20:00,942 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 18:20:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:20:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:20:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:20:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:20:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:20:00,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:20:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:20:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:20:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:20:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:20:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:20:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:20:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:20:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:20:00,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:20:01,098 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:20:01,101 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:20:01,128 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 18:20:01,390 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-10-11 18:20:01,393 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:20:01,438 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:20:01,439 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 18:20:01,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:20:01 BoogieIcfgContainer [2024-10-11 18:20:01,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:20:01,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:20:01,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:20:01,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:20:01,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:20:00" (1/3) ... [2024-10-11 18:20:01,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7fca0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:20:01, skipping insertion in model container [2024-10-11 18:20:01,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:20:00" (2/3) ... [2024-10-11 18:20:01,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7fca0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:20:01, skipping insertion in model container [2024-10-11 18:20:01,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:20:01" (3/3) ... [2024-10-11 18:20:01,450 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2024-10-11 18:20:01,465 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:20:01,465 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-10-11 18:20:01,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:20:01,514 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;@4c0d5ca9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:20:01,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-10-11 18:20:01,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 34 states have (on average 2.176470588235294) internal successors, (74), 63 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:20:01,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:01,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:20:01,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:01,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash 173399, now seen corresponding path program 1 times [2024-10-11 18:20:01,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:01,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091375206] [2024-10-11 18:20:01,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:01,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:20:01,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:01,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091375206] [2024-10-11 18:20:01,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091375206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:20:01,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:20:01,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:20:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335029874] [2024-10-11 18:20:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:20:01,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:20:01,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:01,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:20:01,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:20:01,813 INFO L87 Difference]: Start difference. First operand has 65 states, 34 states have (on average 2.176470588235294) internal successors, (74), 63 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:01,912 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-10-11 18:20:01,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:20:01,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-11 18:20:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:01,921 INFO L225 Difference]: With dead ends: 61 [2024-10-11 18:20:01,922 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 18:20:01,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 18:20:01,927 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:01,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:20:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 18:20:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 18:20:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.935483870967742) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2024-10-11 18:20:01,976 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 3 [2024-10-11 18:20:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:01,979 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2024-10-11 18:20:01,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2024-10-11 18:20:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:20:01,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:01,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:20:01,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:20:01,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:01,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 173400, now seen corresponding path program 1 times [2024-10-11 18:20:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:01,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075417301] [2024-10-11 18:20:01,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:01,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:02,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:20:02,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:02,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075417301] [2024-10-11 18:20:02,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075417301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:20:02,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:20:02,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:20:02,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014491672] [2024-10-11 18:20:02,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:20:02,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:20:02,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:02,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:20:02,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:20:02,136 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:02,195 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2024-10-11 18:20:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:20:02,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-11 18:20:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:02,197 INFO L225 Difference]: With dead ends: 53 [2024-10-11 18:20:02,197 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 18:20:02,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-11 18:20:02,198 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:02,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:20:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 18:20:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 18:20:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 52 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-10-11 18:20:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-10-11 18:20:02,204 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 3 [2024-10-11 18:20:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:02,205 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-11 18:20:02,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-10-11 18:20:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:20:02,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:02,205 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:02,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:20:02,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:02,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1227434401, now seen corresponding path program 1 times [2024-10-11 18:20:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:02,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843910333] [2024-10-11 18:20:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:20:02,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:02,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843910333] [2024-10-11 18:20:02,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843910333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:20:02,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:20:02,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:20:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303507556] [2024-10-11 18:20:02,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:20:02,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:20:02,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:02,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:20:02,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:20:02,327 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-10-11 18:20:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:02,358 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-10-11 18:20:02,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:20:02,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-10-11 18:20:02,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:02,360 INFO L225 Difference]: With dead ends: 61 [2024-10-11 18:20:02,360 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 18:20:02,361 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-10-11 18:20:02,363 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 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-10-11 18:20:02,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:20:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 18:20:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2024-10-11 18:20:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.8125) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-10-11 18:20:02,371 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 7 [2024-10-11 18:20:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:02,372 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-10-11 18:20:02,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 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-10-11 18:20:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-10-11 18:20:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:20:02,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:02,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:02,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:20:02,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:02,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:02,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1227432832, now seen corresponding path program 1 times [2024-10-11 18:20:02,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:02,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948937412] [2024-10-11 18:20:02,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:02,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:20:02,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:02,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948937412] [2024-10-11 18:20:02,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948937412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:20:02,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:20:02,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:20:02,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363196324] [2024-10-11 18:20:02,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:20:02,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:20:02,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:20:02,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:20:02,454 INFO L87 Difference]: Start difference. First operand 54 states and 58 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-10-11 18:20:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:02,516 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2024-10-11 18:20:02,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:20:02,516 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-10-11 18:20:02,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:02,517 INFO L225 Difference]: With dead ends: 52 [2024-10-11 18:20:02,517 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 18:20:02,517 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-10-11 18:20:02,522 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:02,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:20:02,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 18:20:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 18:20:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.75) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2024-10-11 18:20:02,527 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 7 [2024-10-11 18:20:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:02,528 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2024-10-11 18:20:02,528 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-10-11 18:20:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2024-10-11 18:20:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:20:02,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:02,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:02,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:20:02,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:02,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1227432833, now seen corresponding path program 1 times [2024-10-11 18:20:02,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:02,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915820476] [2024-10-11 18:20:02,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:02,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:20:02,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:02,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915820476] [2024-10-11 18:20:02,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915820476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:20:02,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:20:02,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:20:02,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114930402] [2024-10-11 18:20:02,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:20:02,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:20:02,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:02,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:20:02,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:20:02,637 INFO L87 Difference]: Start difference. First operand 52 states and 56 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-10-11 18:20:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:02,672 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-10-11 18:20:02,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:20:02,673 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-10-11 18:20:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:02,674 INFO L225 Difference]: With dead ends: 50 [2024-10-11 18:20:02,674 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 18:20:02,674 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-10-11 18:20:02,675 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:02,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 80 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:20:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 18:20:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 18:20:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.6875) internal successors, (54), 49 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-10-11 18:20:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-10-11 18:20:02,680 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 7 [2024-10-11 18:20:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:02,680 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-10-11 18:20:02,680 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-10-11 18:20:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-10-11 18:20:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:20:02,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:02,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:02,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:20:02,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:02,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2128480533, now seen corresponding path program 1 times [2024-10-11 18:20:02,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:02,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103892242] [2024-10-11 18:20:02,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:02,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:20:02,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:02,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103892242] [2024-10-11 18:20:02,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103892242] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:02,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312149746] [2024-10-11 18:20:02,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:02,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:02,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:02,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:02,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:20:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:02,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:20:02,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:20:02,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:20:03,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312149746] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:03,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:03,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 18:20:03,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866501696] [2024-10-11 18:20:03,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:03,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:20:03,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:03,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:20:03,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:20:03,040 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:03,106 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2024-10-11 18:20:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:20:03,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 18:20:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:03,110 INFO L225 Difference]: With dead ends: 62 [2024-10-11 18:20:03,110 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 18:20:03,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:20:03,111 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:03,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 175 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:20:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 18:20:03,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 18:20:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.5) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-10-11 18:20:03,129 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2024-10-11 18:20:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:03,129 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-10-11 18:20:03,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-10-11 18:20:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:20:03,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:03,130 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:03,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:20:03,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:03,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:03,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:03,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1800396599, now seen corresponding path program 2 times [2024-10-11 18:20:03,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:03,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2598494] [2024-10-11 18:20:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:03,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 18:20:03,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:03,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2598494] [2024-10-11 18:20:03,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2598494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:20:03,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:20:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:20:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741492079] [2024-10-11 18:20:03,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:20:03,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:20:03,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:03,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:20:03,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:20:03,506 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:03,611 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-10-11 18:20:03,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:20:03,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-11 18:20:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:03,613 INFO L225 Difference]: With dead ends: 59 [2024-10-11 18:20:03,614 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 18:20:03,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:20:03,615 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:03,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 79 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:20:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 18:20:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-11 18:20:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2024-10-11 18:20:03,621 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 23 [2024-10-11 18:20:03,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:03,621 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-10-11 18:20:03,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2024-10-11 18:20:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:20:03,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:03,622 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:03,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:20:03,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:03,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:03,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1800396598, now seen corresponding path program 1 times [2024-10-11 18:20:03,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:03,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277473837] [2024-10-11 18:20:03,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 18:20:03,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:03,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277473837] [2024-10-11 18:20:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277473837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:20:03,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:20:03,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:20:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556291346] [2024-10-11 18:20:03,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:20:03,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:20:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:20:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:20:03,873 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-10-11 18:20:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:03,975 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-10-11 18:20:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:20:03,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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 23 [2024-10-11 18:20:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:03,976 INFO L225 Difference]: With dead ends: 66 [2024-10-11 18:20:03,976 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 18:20:03,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:20:03,978 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:03,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:20:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 18:20:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-10-11 18:20:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-10-11 18:20:03,986 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 23 [2024-10-11 18:20:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:03,986 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-10-11 18:20:03,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-10-11 18:20:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-10-11 18:20:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:20:03,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:03,987 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:03,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:20:03,987 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:03,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:03,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1967090391, now seen corresponding path program 1 times [2024-10-11 18:20:03,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:03,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494676589] [2024-10-11 18:20:03,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:03,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 18:20:04,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:04,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494676589] [2024-10-11 18:20:04,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494676589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:04,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320661294] [2024-10-11 18:20:04,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:04,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:04,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:04,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:04,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:20:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:05,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 18:20:05,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:05,276 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-10-11 18:20:05,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:05,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:20:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 18:20:05,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 18:20:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320661294] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:05,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:05,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2024-10-11 18:20:05,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925740232] [2024-10-11 18:20:05,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:05,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:20:05,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:05,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:20:05,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:20:05,646 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 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-10-11 18:20:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:05,994 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2024-10-11 18:20:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:20:05,995 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 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 27 [2024-10-11 18:20:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:05,995 INFO L225 Difference]: With dead ends: 62 [2024-10-11 18:20:05,995 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 18:20:05,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2024-10-11 18:20:05,996 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:05,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 309 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:20:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 18:20:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 18:20:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:06,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2024-10-11 18:20:06,000 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 27 [2024-10-11 18:20:06,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:06,000 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2024-10-11 18:20:06,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 17 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-10-11 18:20:06,001 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2024-10-11 18:20:06,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:20:06,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:06,002 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:06,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:20:06,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:06,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:06,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:06,205 INFO L85 PathProgramCache]: Analyzing trace with hash -850217418, now seen corresponding path program 1 times [2024-10-11 18:20:06,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:06,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224881941] [2024-10-11 18:20:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:06,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:20:07,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:07,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224881941] [2024-10-11 18:20:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224881941] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738814161] [2024-10-11 18:20:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:07,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:07,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:07,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:07,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:20:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:07,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 18:20:07,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:07,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:20:07,516 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:20:07,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:20:07,567 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-10-11 18:20:07,574 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 15 treesize of output 1 [2024-10-11 18:20:07,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-11 18:20:07,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:20:07,744 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 18:20:07,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-10-11 18:20:07,764 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:20:07,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:20:07,978 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:20:07,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2024-10-11 18:20:07,987 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:20:07,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2024-10-11 18:20:08,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:08,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2024-10-11 18:20:08,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:08,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2024-10-11 18:20:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:20:08,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:20:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738814161] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:08,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:08,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-10-11 18:20:08,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403150560] [2024-10-11 18:20:08,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:08,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 18:20:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:08,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 18:20:08,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-10-11 18:20:08,628 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:09,252 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2024-10-11 18:20:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:20:09,252 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 18:20:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:09,254 INFO L225 Difference]: With dead ends: 86 [2024-10-11 18:20:09,255 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 18:20:09,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2024-10-11 18:20:09,256 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 114 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:09,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 199 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:20:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 18:20:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2024-10-11 18:20:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:09,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2024-10-11 18:20:09,263 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 28 [2024-10-11 18:20:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:09,264 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2024-10-11 18:20:09,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:09,264 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2024-10-11 18:20:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:20:09,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:09,268 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:09,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:20:09,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:09,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:09,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash -850217417, now seen corresponding path program 1 times [2024-10-11 18:20:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:09,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938634290] [2024-10-11 18:20:09,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:09,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:10,354 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:20:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938634290] [2024-10-11 18:20:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938634290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724470803] [2024-10-11 18:20:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:10,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:10,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:10,380 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:10,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:20:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:10,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 18:20:10,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:10,560 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-10-11 18:20:10,625 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:20:10,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:20:10,685 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 15 treesize of output 1 [2024-10-11 18:20:10,690 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-10-11 18:20:10,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-11 18:20:10,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:20:10,803 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 18:20:10,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-10-11 18:20:10,819 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:20:10,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:20:10,977 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:20:10,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2024-10-11 18:20:10,986 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:20:10,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2024-10-11 18:20:11,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:11,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2024-10-11 18:20:11,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:11,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2024-10-11 18:20:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:20:11,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:20:11,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724470803] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:11,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:11,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2024-10-11 18:20:11,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906926468] [2024-10-11 18:20:11,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:11,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:20:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:11,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:20:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2024-10-11 18:20:11,767 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:12,448 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2024-10-11 18:20:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:20:12,448 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 18:20:12,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:12,450 INFO L225 Difference]: With dead ends: 77 [2024-10-11 18:20:12,450 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 18:20:12,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 18:20:12,456 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 83 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:12,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 219 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:20:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 18:20:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2024-10-11 18:20:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-10-11 18:20:12,460 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 28 [2024-10-11 18:20:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:12,461 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-10-11 18:20:12,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.4615384615384617) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-10-11 18:20:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:20:12,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:12,462 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:12,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:20:12,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 18:20:12,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:12,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash -602887146, now seen corresponding path program 1 times [2024-10-11 18:20:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:12,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341194110] [2024-10-11 18:20:12,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:20:13,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:13,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341194110] [2024-10-11 18:20:13,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341194110] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:13,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444227433] [2024-10-11 18:20:13,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:13,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:13,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:13,908 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:13,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:20:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:14,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-11 18:20:14,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:14,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:20:14,130 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:20:14,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:20:14,172 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:20:14,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:20:14,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:20:14,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:20:14,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:20:14,409 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-10-11 18:20:14,428 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:20:14,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-11 18:20:14,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:20:14,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:20:14,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2024-10-11 18:20:14,515 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 18:20:14,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-10-11 18:20:14,599 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 18:20:14,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2024-10-11 18:20:14,615 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:20:14,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:20:14,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-10-11 18:20:14,901 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-11 18:20:14,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 78 [2024-10-11 18:20:14,934 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-10-11 18:20:14,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 115 [2024-10-11 18:20:14,946 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-11 18:20:14,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 93 [2024-10-11 18:20:15,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:15,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 84 [2024-10-11 18:20:15,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:15,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 76 [2024-10-11 18:20:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:20:15,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:16,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:16,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-11 18:20:16,510 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:16,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-10-11 18:20:16,516 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 7 treesize of output 3 [2024-10-11 18:20:16,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:16,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-11 18:20:16,529 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:16,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-10-11 18:20:16,536 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 7 treesize of output 3 [2024-10-11 18:20:16,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:16,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-11 18:20:16,551 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:16,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-10-11 18:20:16,557 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 7 treesize of output 3 [2024-10-11 18:20:16,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:16,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-11 18:20:16,565 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:16,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-10-11 18:20:16,572 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 7 treesize of output 3 [2024-10-11 18:20:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:20:16,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444227433] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:16,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:16,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 34 [2024-10-11 18:20:16,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467722887] [2024-10-11 18:20:16,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:16,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 18:20:16,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:16,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 18:20:16,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1064, Unknown=13, NotChecked=0, Total=1190 [2024-10-11 18:20:16,852 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 34 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-10-11 18:20:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:17,770 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-10-11 18:20:17,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:20:17,771 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 34 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) Word has length 32 [2024-10-11 18:20:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:17,771 INFO L225 Difference]: With dead ends: 85 [2024-10-11 18:20:17,771 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 18:20:17,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=276, Invalid=1873, Unknown=13, NotChecked=0, Total=2162 [2024-10-11 18:20:17,773 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:17,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 412 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:20:17,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 18:20:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2024-10-11 18:20:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 71 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-10-11 18:20:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-10-11 18:20:17,782 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 32 [2024-10-11 18:20:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:17,783 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-10-11 18:20:17,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 34 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-10-11 18:20:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-10-11 18:20:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:20:17,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:17,784 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:17,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 18:20:17,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 18:20:17,988 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:17,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:17,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1717591019, now seen corresponding path program 1 times [2024-10-11 18:20:17,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:17,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590721442] [2024-10-11 18:20:17,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:20:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:18,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590721442] [2024-10-11 18:20:18,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590721442] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:18,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776647973] [2024-10-11 18:20:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:18,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:18,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:18,489 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:18,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:20:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:18,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 18:20:18,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:18,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:20:18,682 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:20:18,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:20:18,704 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:20:18,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:20:18,722 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:20:18,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:20:18,751 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-11 18:20:18,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 18:20:18,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:20:18,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-11 18:20:18,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-10-11 18:20:18,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-10-11 18:20:18,869 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 16 treesize of output 8 [2024-10-11 18:20:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:20:18,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:18,883 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1141) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) is different from false [2024-10-11 18:20:18,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 Int) (v_ArrVal_1141 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1140)) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1141) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-10-11 18:20:18,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:18,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2024-10-11 18:20:18,904 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 33 treesize of output 25 [2024-10-11 18:20:18,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 18:20:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 7 not checked. [2024-10-11 18:20:19,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776647973] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:19,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:19,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2024-10-11 18:20:19,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547876633] [2024-10-11 18:20:19,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:19,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:20:19,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:19,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:20:19,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=290, Unknown=2, NotChecked=70, Total=420 [2024-10-11 18:20:19,064 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:19,278 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-10-11 18:20:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:20:19,278 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 18:20:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:19,279 INFO L225 Difference]: With dead ends: 66 [2024-10-11 18:20:19,279 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 18:20:19,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=407, Unknown=2, NotChecked=86, Total=600 [2024-10-11 18:20:19,280 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:19,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 392 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 283 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2024-10-11 18:20:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 18:20:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 18:20:19,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.320754716981132) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2024-10-11 18:20:19,283 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 33 [2024-10-11 18:20:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:19,283 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2024-10-11 18:20:19,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:20:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2024-10-11 18:20:19,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:20:19,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:19,284 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:20:19,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:20:19,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 18:20:19,485 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-10-11 18:20:19,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1509589783, now seen corresponding path program 2 times [2024-10-11 18:20:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941059964] [2024-10-11 18:20:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:20:20,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:20,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941059964] [2024-10-11 18:20:20,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941059964] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:20,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783846839] [2024-10-11 18:20:20,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:20:20,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:20,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:20,877 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:20,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:20:21,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:20:21,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:20:21,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-11 18:20:21,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:21,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:20:21,148 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:20:21,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:20:21,189 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 15 treesize of output 1 [2024-10-11 18:20:21,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:20:21,256 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-10-11 18:20:21,276 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2024-10-11 18:20:21,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2024-10-11 18:20:21,373 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-10-11 18:20:21,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2024-10-11 18:20:21,393 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-10-11 18:20:21,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 18:20:21,455 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:20:21,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 36 [2024-10-11 18:20:21,564 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-10-11 18:20:21,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 59 [2024-10-11 18:20:21,579 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:20:21,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:20:22,045 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2024-10-11 18:20:22,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 160 treesize of output 115 [2024-10-11 18:20:22,061 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2024-10-11 18:20:22,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 167 treesize of output 167 [2024-10-11 18:20:22,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:22,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 333 treesize of output 439 [2024-10-11 18:21:03,616 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 635 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)