./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0513.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0513.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:22:49,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:22:49,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:22:49,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:22:49,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:22:49,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:22:49,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:22:49,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:22:49,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:22:49,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:22:49,465 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:22:49,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:22:49,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:22:49,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:22:49,468 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:22:49,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:22:49,468 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:22:49,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:22:49,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:22:49,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:22:49,473 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:22:49,474 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:22:49,474 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:22:49,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:22:49,474 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:22:49,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:22:49,475 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:22:49,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:22:49,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:22:49,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:22:49,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:22:49,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:22:49,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:22:49,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:22:49,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:22:49,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:22:49,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:22:49,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:22:49,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:22:49,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:22:49,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:22:49,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:22:49,479 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e [2024-11-12 13:22:49,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:22:49,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:22:49,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:22:49,749 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:22:49,749 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:22:49,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0513.i [2024-11-12 13:22:51,132 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:22:51,351 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:22:51,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2024-11-12 13:22:51,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60dcd33a7/b3bdbab18ff64119beee4c261e7a5195/FLAG95e8fee9f [2024-11-12 13:22:51,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60dcd33a7/b3bdbab18ff64119beee4c261e7a5195 [2024-11-12 13:22:51,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:22:51,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:22:51,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:22:51,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:22:51,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:22:51,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf3dbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51, skipping insertion in model container [2024-11-12 13:22:51,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:22:51,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:22:51,798 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:22:51,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:22:51,886 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:22:51,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51 WrapperNode [2024-11-12 13:22:51,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:22:51,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:22:51,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:22:51,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:22:51,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,937 INFO L138 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 126 [2024-11-12 13:22:51,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:22:51,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:22:51,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:22:51,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:22:51,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,979 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2024-11-12 13:22:51,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:51,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:22:51,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:22:51,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:22:51,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:22:51,999 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (1/1) ... [2024-11-12 13:22:52,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:22:52,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:22:52,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:22:52,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:22:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 13:22:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 13:22:52,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:22:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 13:22:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:22:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:22:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:22:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:22:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:22:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:22:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:22:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:22:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:22:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:22:52,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:22:52,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:22:52,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:22:52,549 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2024-11-12 13:22:52,550 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:22:52,568 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:22:52,569 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 13:22:52,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:22:52 BoogieIcfgContainer [2024-11-12 13:22:52,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:22:52,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:22:52,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:22:52,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:22:52,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:22:51" (1/3) ... [2024-11-12 13:22:52,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d87d8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:22:52, skipping insertion in model container [2024-11-12 13:22:52,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:22:51" (2/3) ... [2024-11-12 13:22:52,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d87d8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:22:52, skipping insertion in model container [2024-11-12 13:22:52,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:22:52" (3/3) ... [2024-11-12 13:22:52,580 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513.i [2024-11-12 13:22:52,596 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:22:52,597 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-11-12 13:22:52,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:22:52,659 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;@7554f709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:22:52,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-12 13:22:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:22:52,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:52,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:22:52,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:52,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash 28740643, now seen corresponding path program 1 times [2024-11-12 13:22:52,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:52,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963035758] [2024-11-12 13:22:52,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:52,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:52,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963035758] [2024-11-12 13:22:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963035758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:52,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:52,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:22:52,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650479826] [2024-11-12 13:22:52,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:52,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:22:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:52,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:22:52,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:22:52,865 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:52,883 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2024-11-12 13:22:52,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:22:52,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-12 13:22:52,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:52,892 INFO L225 Difference]: With dead ends: 132 [2024-11-12 13:22:52,893 INFO L226 Difference]: Without dead ends: 130 [2024-11-12 13:22:52,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:22:52,897 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:52,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:22:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-12 13:22:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-12 13:22:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2024-11-12 13:22:52,934 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 5 [2024-11-12 13:22:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:52,935 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2024-11-12 13:22:52,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2024-11-12 13:22:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:22:52,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:52,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:22:52,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:22:52,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:52,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash 889570808, now seen corresponding path program 1 times [2024-11-12 13:22:52,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:52,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770633927] [2024-11-12 13:22:52,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:52,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:52,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:52,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770633927] [2024-11-12 13:22:52,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770633927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:52,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:52,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:22:52,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254444125] [2024-11-12 13:22:52,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:52,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:22:52,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:52,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:22:52,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:52,990 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:53,126 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2024-11-12 13:22:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:22:53,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:22:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:53,128 INFO L225 Difference]: With dead ends: 176 [2024-11-12 13:22:53,128 INFO L226 Difference]: Without dead ends: 175 [2024-11-12 13:22:53,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:53,130 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:53,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:22:53,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-12 13:22:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2024-11-12 13:22:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2024-11-12 13:22:53,150 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 6 [2024-11-12 13:22:53,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:53,151 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2024-11-12 13:22:53,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2024-11-12 13:22:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:22:53,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:53,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:22:53,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:22:53,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:53,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash 889570732, now seen corresponding path program 1 times [2024-11-12 13:22:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:53,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593514167] [2024-11-12 13:22:53,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:53,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:53,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:53,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593514167] [2024-11-12 13:22:53,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593514167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:53,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:53,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:22:53,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431751795] [2024-11-12 13:22:53,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:53,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:22:53,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:53,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:22:53,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:53,226 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:53,339 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2024-11-12 13:22:53,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:22:53,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:22:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:53,342 INFO L225 Difference]: With dead ends: 143 [2024-11-12 13:22:53,342 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 13:22:53,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:53,343 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 10 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:53,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 232 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:22:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 13:22:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2024-11-12 13:22:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2024-11-12 13:22:53,358 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 6 [2024-11-12 13:22:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:53,359 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2024-11-12 13:22:53,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2024-11-12 13:22:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:22:53,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:53,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:22:53,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:22:53,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:53,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2024-11-12 13:22:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:53,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119861931] [2024-11-12 13:22:53,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:53,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-11-12 13:22:53,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:53,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119861931] [2024-11-12 13:22:53,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119861931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:53,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:53,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:22:53,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278522352] [2024-11-12 13:22:53,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:53,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:22:53,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:53,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:22:53,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:53,454 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:53,570 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2024-11-12 13:22:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:22:53,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:22:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:53,572 INFO L225 Difference]: With dead ends: 145 [2024-11-12 13:22:53,572 INFO L226 Difference]: Without dead ends: 145 [2024-11-12 13:22:53,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:53,575 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 45 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:53,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 154 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:22:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-12 13:22:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2024-11-12 13:22:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 80 states have (on average 1.9125) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2024-11-12 13:22:53,587 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 6 [2024-11-12 13:22:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:53,587 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2024-11-12 13:22:53,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2024-11-12 13:22:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:22:53,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:53,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:22:53,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:22:53,588 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:53,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2024-11-12 13:22:53,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:53,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081900717] [2024-11-12 13:22:53,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:53,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:53,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081900717] [2024-11-12 13:22:53,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081900717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:53,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:53,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:22:53,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905389485] [2024-11-12 13:22:53,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:53,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:22:53,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:53,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:22:53,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:53,718 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:53,808 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2024-11-12 13:22:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:22:53,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:22:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:53,810 INFO L225 Difference]: With dead ends: 137 [2024-11-12 13:22:53,810 INFO L226 Difference]: Without dead ends: 137 [2024-11-12 13:22:53,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:53,812 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:53,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 175 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:22:53,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-12 13:22:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-12 13:22:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-11-12 13:22:53,822 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2024-11-12 13:22:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:53,822 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-12 13:22:53,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2024-11-12 13:22:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:22:53,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:53,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:53,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:22:53,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:53,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659887, now seen corresponding path program 1 times [2024-11-12 13:22:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:53,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696662335] [2024-11-12 13:22:53,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:53,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696662335] [2024-11-12 13:22:53,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696662335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:53,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:53,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:22:53,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974957662] [2024-11-12 13:22:53,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:53,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:22:53,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:22:53,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:53,917 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:53,998 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2024-11-12 13:22:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:22:53,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 13:22:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:54,004 INFO L225 Difference]: With dead ends: 133 [2024-11-12 13:22:54,004 INFO L226 Difference]: Without dead ends: 133 [2024-11-12 13:22:54,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:54,005 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 18 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:54,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 169 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:22:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-12 13:22:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-12 13:22:54,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2024-11-12 13:22:54,018 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2024-11-12 13:22:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:54,018 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2024-11-12 13:22:54,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2024-11-12 13:22:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:22:54,018 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:54,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:54,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:22:54,019 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:54,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:54,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659886, now seen corresponding path program 1 times [2024-11-12 13:22:54,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:54,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479447735] [2024-11-12 13:22:54,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:54,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:54,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:54,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479447735] [2024-11-12 13:22:54,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479447735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:54,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:54,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:22:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562461893] [2024-11-12 13:22:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:54,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:22:54,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:54,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:22:54,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:54,149 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:54,236 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2024-11-12 13:22:54,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:22:54,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 13:22:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:54,238 INFO L225 Difference]: With dead ends: 130 [2024-11-12 13:22:54,238 INFO L226 Difference]: Without dead ends: 130 [2024-11-12 13:22:54,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:22:54,239 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:54,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 180 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:22:54,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-12 13:22:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-12 13:22:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2024-11-12 13:22:54,248 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 11 [2024-11-12 13:22:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:54,249 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2024-11-12 13:22:54,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2024-11-12 13:22:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:22:54,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:54,253 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:54,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:22:54,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:54,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash -967503371, now seen corresponding path program 1 times [2024-11-12 13:22:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:54,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141956703] [2024-11-12 13:22:54,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:54,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:54,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141956703] [2024-11-12 13:22:54,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141956703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:54,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:54,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:22:54,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696889194] [2024-11-12 13:22:54,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:54,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:22:54,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:54,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:22:54,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:22:54,369 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:54,475 INFO L93 Difference]: Finished difference Result 198 states and 233 transitions. [2024-11-12 13:22:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:22:54,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-12 13:22:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:54,477 INFO L225 Difference]: With dead ends: 198 [2024-11-12 13:22:54,477 INFO L226 Difference]: Without dead ends: 198 [2024-11-12 13:22:54,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:22:54,479 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 89 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:54,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 252 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:22:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-12 13:22:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 130. [2024-11-12 13:22:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2024-11-12 13:22:54,486 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2024-11-12 13:22:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:54,486 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2024-11-12 13:22:54,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2024-11-12 13:22:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:22:54,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:54,489 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:54,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:22:54,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:54,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:54,490 INFO L85 PathProgramCache]: Analyzing trace with hash -967503447, now seen corresponding path program 1 times [2024-11-12 13:22:54,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:54,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484004033] [2024-11-12 13:22:54,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:54,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:54,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:54,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484004033] [2024-11-12 13:22:54,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484004033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:54,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:54,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:22:54,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587596333] [2024-11-12 13:22:54,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:54,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:22:54,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:22:54,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:22:54,600 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:54,745 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2024-11-12 13:22:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:22:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-12 13:22:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:54,747 INFO L225 Difference]: With dead ends: 123 [2024-11-12 13:22:54,749 INFO L226 Difference]: Without dead ends: 123 [2024-11-12 13:22:54,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:22:54,750 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 48 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:54,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 169 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:22:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-12 13:22:54,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-12 13:22:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.654320987654321) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2024-11-12 13:22:54,755 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2024-11-12 13:22:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:54,755 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2024-11-12 13:22:54,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2024-11-12 13:22:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:22:54,757 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:54,757 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:54,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:22:54,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:54,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash -967503446, now seen corresponding path program 1 times [2024-11-12 13:22:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:54,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354826798] [2024-11-12 13:22:54,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:54,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:54,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:54,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354826798] [2024-11-12 13:22:54,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354826798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:54,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:54,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:22:54,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173588107] [2024-11-12 13:22:54,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:54,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:22:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:54,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:22:54,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:22:54,897 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:55,072 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2024-11-12 13:22:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:22:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-12 13:22:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:55,073 INFO L225 Difference]: With dead ends: 185 [2024-11-12 13:22:55,073 INFO L226 Difference]: Without dead ends: 185 [2024-11-12 13:22:55,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:22:55,074 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 79 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:55,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 177 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:22:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-12 13:22:55,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 162. [2024-11-12 13:22:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 122 states have (on average 1.680327868852459) internal successors, (205), 161 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2024-11-12 13:22:55,078 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 18 [2024-11-12 13:22:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:55,079 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2024-11-12 13:22:55,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2024-11-12 13:22:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:22:55,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:55,080 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:55,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:22:55,080 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:55,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash 199814016, now seen corresponding path program 1 times [2024-11-12 13:22:55,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:55,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380892698] [2024-11-12 13:22:55,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:55,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:55,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380892698] [2024-11-12 13:22:55,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380892698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:55,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:55,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:22:55,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711443806] [2024-11-12 13:22:55,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:55,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:22:55,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:55,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:22:55,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:22:55,158 INFO L87 Difference]: Start difference. First operand 162 states and 205 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:55,279 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2024-11-12 13:22:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:22:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-11-12 13:22:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:55,280 INFO L225 Difference]: With dead ends: 187 [2024-11-12 13:22:55,281 INFO L226 Difference]: Without dead ends: 187 [2024-11-12 13:22:55,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:22:55,282 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 78 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:55,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 329 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:22:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-12 13:22:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 163. [2024-11-12 13:22:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2024-11-12 13:22:55,286 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 23 [2024-11-12 13:22:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:55,286 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2024-11-12 13:22:55,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2024-11-12 13:22:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:22:55,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:55,287 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:55,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:22:55,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:55,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:55,289 INFO L85 PathProgramCache]: Analyzing trace with hash 198674982, now seen corresponding path program 1 times [2024-11-12 13:22:55,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:55,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387459580] [2024-11-12 13:22:55,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:55,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:55,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387459580] [2024-11-12 13:22:55,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387459580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:55,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:55,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:22:55,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343961721] [2024-11-12 13:22:55,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:55,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:22:55,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:55,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:22:55,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:22:55,525 INFO L87 Difference]: Start difference. First operand 163 states and 206 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:55,674 INFO L93 Difference]: Finished difference Result 175 states and 219 transitions. [2024-11-12 13:22:55,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:22:55,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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-11-12 13:22:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:55,677 INFO L225 Difference]: With dead ends: 175 [2024-11-12 13:22:55,677 INFO L226 Difference]: Without dead ends: 175 [2024-11-12 13:22:55,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:22:55,678 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 6 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:55,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 407 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:22:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-12 13:22:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2024-11-12 13:22:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.646153846153846) internal successors, (214), 169 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2024-11-12 13:22:55,684 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 23 [2024-11-12 13:22:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:55,684 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2024-11-12 13:22:55,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2024-11-12 13:22:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:22:55,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:55,686 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:55,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:22:55,687 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:55,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:55,687 INFO L85 PathProgramCache]: Analyzing trace with hash -165115758, now seen corresponding path program 1 times [2024-11-12 13:22:55,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:55,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61707639] [2024-11-12 13:22:55,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:55,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:56,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:56,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61707639] [2024-11-12 13:22:56,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61707639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:56,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:56,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:22:56,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28291563] [2024-11-12 13:22:56,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:56,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:22:56,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:56,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:22:56,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:22:56,103 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:56,471 INFO L93 Difference]: Finished difference Result 189 states and 237 transitions. [2024-11-12 13:22:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:22:56,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-12 13:22:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:56,473 INFO L225 Difference]: With dead ends: 189 [2024-11-12 13:22:56,473 INFO L226 Difference]: Without dead ends: 189 [2024-11-12 13:22:56,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:22:56,474 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 34 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:56,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 429 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:22:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-12 13:22:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2024-11-12 13:22:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 176 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2024-11-12 13:22:56,480 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 26 [2024-11-12 13:22:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:56,482 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2024-11-12 13:22:56,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2024-11-12 13:22:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-12 13:22:56,483 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:56,483 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:56,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:22:56,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:56,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:56,484 INFO L85 PathProgramCache]: Analyzing trace with hash -165115757, now seen corresponding path program 1 times [2024-11-12 13:22:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:56,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485300753] [2024-11-12 13:22:56,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:56,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:56,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485300753] [2024-11-12 13:22:56,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485300753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:56,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:56,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:22:56,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485583608] [2024-11-12 13:22:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:56,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:22:56,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:56,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:22:56,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:22:56,946 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:57,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:57,341 INFO L93 Difference]: Finished difference Result 188 states and 233 transitions. [2024-11-12 13:22:57,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:22:57,342 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-12 13:22:57,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:57,343 INFO L225 Difference]: With dead ends: 188 [2024-11-12 13:22:57,343 INFO L226 Difference]: Without dead ends: 188 [2024-11-12 13:22:57,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:22:57,344 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 37 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:57,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 322 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:22:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-12 13:22:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 177. [2024-11-12 13:22:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 176 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 222 transitions. [2024-11-12 13:22:57,348 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 222 transitions. Word has length 26 [2024-11-12 13:22:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:57,349 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 222 transitions. [2024-11-12 13:22:57,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 222 transitions. [2024-11-12 13:22:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-12 13:22:57,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:57,350 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:57,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:22:57,351 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash -823622550, now seen corresponding path program 1 times [2024-11-12 13:22:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:57,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552150456] [2024-11-12 13:22:57,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:57,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:57,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552150456] [2024-11-12 13:22:57,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552150456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:57,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:22:57,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507274508] [2024-11-12 13:22:57,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:57,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:22:57,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:57,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:22:57,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:22:57,600 INFO L87 Difference]: Start difference. First operand 177 states and 222 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:57,749 INFO L93 Difference]: Finished difference Result 179 states and 223 transitions. [2024-11-12 13:22:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:22:57,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-12 13:22:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:57,751 INFO L225 Difference]: With dead ends: 179 [2024-11-12 13:22:57,751 INFO L226 Difference]: Without dead ends: 179 [2024-11-12 13:22:57,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:22:57,754 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 10 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:57,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 417 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:22:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-12 13:22:57,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2024-11-12 13:22:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 176 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 221 transitions. [2024-11-12 13:22:57,759 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 221 transitions. Word has length 27 [2024-11-12 13:22:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:57,759 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 221 transitions. [2024-11-12 13:22:57,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 221 transitions. [2024-11-12 13:22:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:22:57,761 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:57,761 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:57,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:22:57,762 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:57,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:57,763 INFO L85 PathProgramCache]: Analyzing trace with hash 237551634, now seen corresponding path program 1 times [2024-11-12 13:22:57,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:57,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343342253] [2024-11-12 13:22:57,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:57,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:57,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:57,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343342253] [2024-11-12 13:22:57,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343342253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:57,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:57,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:22:57,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302476105] [2024-11-12 13:22:57,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:57,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:22:57,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:57,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:22:57,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:22:57,998 INFO L87 Difference]: Start difference. First operand 177 states and 221 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:58,205 INFO L93 Difference]: Finished difference Result 190 states and 234 transitions. [2024-11-12 13:22:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:22:58,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-12 13:22:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:58,207 INFO L225 Difference]: With dead ends: 190 [2024-11-12 13:22:58,207 INFO L226 Difference]: Without dead ends: 190 [2024-11-12 13:22:58,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:22:58,208 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 31 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:58,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 480 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:22:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-12 13:22:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 179. [2024-11-12 13:22:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 223 transitions. [2024-11-12 13:22:58,212 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 223 transitions. Word has length 28 [2024-11-12 13:22:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:58,212 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 223 transitions. [2024-11-12 13:22:58,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2024-11-12 13:22:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-12 13:22:58,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:58,213 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:58,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 13:22:58,214 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:58,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1225833714, now seen corresponding path program 1 times [2024-11-12 13:22:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:58,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636981150] [2024-11-12 13:22:58,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:58,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:58,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636981150] [2024-11-12 13:22:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636981150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:58,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:58,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:22:58,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187638881] [2024-11-12 13:22:58,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:58,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:22:58,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:58,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:22:58,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:22:58,444 INFO L87 Difference]: Start difference. First operand 179 states and 223 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:58,677 INFO L93 Difference]: Finished difference Result 182 states and 226 transitions. [2024-11-12 13:22:58,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:22:58,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-12 13:22:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:58,679 INFO L225 Difference]: With dead ends: 182 [2024-11-12 13:22:58,679 INFO L226 Difference]: Without dead ends: 182 [2024-11-12 13:22:58,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:22:58,679 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 11 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:58,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 511 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:22:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-12 13:22:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2024-11-12 13:22:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.6) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2024-11-12 13:22:58,684 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 29 [2024-11-12 13:22:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:58,684 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2024-11-12 13:22:58,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2024-11-12 13:22:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:22:58,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:58,686 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:58,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 13:22:58,687 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:58,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:58,687 INFO L85 PathProgramCache]: Analyzing trace with hash 653860756, now seen corresponding path program 1 times [2024-11-12 13:22:58,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:58,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763918161] [2024-11-12 13:22:58,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:58,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:22:58,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:58,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763918161] [2024-11-12 13:22:58,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763918161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:22:58,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:22:58,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:22:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595353295] [2024-11-12 13:22:58,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:22:58,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:22:58,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:22:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:22:58,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:22:58,733 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:22:58,917 INFO L93 Difference]: Finished difference Result 244 states and 311 transitions. [2024-11-12 13:22:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:22:58,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-12 13:22:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:22:58,919 INFO L225 Difference]: With dead ends: 244 [2024-11-12 13:22:58,919 INFO L226 Difference]: Without dead ends: 244 [2024-11-12 13:22:58,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:22:58,920 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 64 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:22:58,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 233 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:22:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-12 13:22:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 184. [2024-11-12 13:22:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2024-11-12 13:22:58,924 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 30 [2024-11-12 13:22:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:22:58,924 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2024-11-12 13:22:58,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:22:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2024-11-12 13:22:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:22:58,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:22:58,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:22:58,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:22:58,925 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:22:58,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:22:58,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1294968215, now seen corresponding path program 1 times [2024-11-12 13:22:58,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:22:58,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992203541] [2024-11-12 13:22:58,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:58,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:22:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:22:59,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:22:59,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992203541] [2024-11-12 13:22:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992203541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:22:59,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513125964] [2024-11-12 13:22:59,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:22:59,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:22:59,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:22:59,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:22:59,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 13:22:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:22:59,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-12 13:22:59,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:22:59,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:22:59,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:22:59,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:22:59,776 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-11-12 13:22:59,781 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-11-12 13:22:59,817 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:22:59,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:22:59,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:22:59,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:22:59,940 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-11-12 13:22:59,946 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 27 treesize of output 15 [2024-11-12 13:23:00,313 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-12 13:23:00,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 36 [2024-11-12 13:23:00,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:00,328 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 15 treesize of output 15 [2024-11-12 13:23:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:00,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:23:00,958 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-11-12 13:23:00,962 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 49 [2024-11-12 13:23:00,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2024-11-12 13:23:01,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (and (or .cse0 (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select .cse2 (select v_arrayElimArr_1 4)) 0) 0) (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (or .cse0 (forall ((v_arrayElimCell_15 Int) (v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_15) 0) 0))) (forall ((v_arrayElimCell_15 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse3 v_arrayElimCell_15) 0) 0)))) (or (not .cse0) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))))) is different from false [2024-11-12 13:23:01,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:01,362 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 23 treesize of output 29 [2024-11-12 13:23:01,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:01,371 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 30 treesize of output 30 [2024-11-12 13:23:01,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-12 13:23:01,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:01,397 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 47 treesize of output 39 [2024-11-12 13:23:01,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:23:01,419 INFO L349 Elim1Store]: treesize reduction 16, result has 42.9 percent of original size [2024-11-12 13:23:01,419 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 37 treesize of output 36 [2024-11-12 13:23:01,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-12 13:23:01,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:01,442 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 23 treesize of output 29 [2024-11-12 13:23:01,445 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:23:01,451 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-12 13:23:01,452 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 16 treesize of output 11 [2024-11-12 13:23:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513125964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:23:01,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:23:01,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 42 [2024-11-12 13:23:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245908088] [2024-11-12 13:23:01,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:23:01,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-12 13:23:01,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:23:01,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-12 13:23:01,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1475, Unknown=14, NotChecked=78, Total=1722 [2024-11-12 13:23:01,527 INFO L87 Difference]: Start difference. First operand 184 states and 235 transitions. Second operand has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 42 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:23:03,048 INFO L93 Difference]: Finished difference Result 197 states and 248 transitions. [2024-11-12 13:23:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 13:23:03,048 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 42 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-12 13:23:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:23:03,049 INFO L225 Difference]: With dead ends: 197 [2024-11-12 13:23:03,049 INFO L226 Difference]: Without dead ends: 197 [2024-11-12 13:23:03,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=352, Invalid=2500, Unknown=14, NotChecked=104, Total=2970 [2024-11-12 13:23:03,051 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 69 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:23:03,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1444 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1411 Invalid, 0 Unknown, 85 Unchecked, 1.0s Time] [2024-11-12 13:23:03,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-12 13:23:03,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 186. [2024-11-12 13:23:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 237 transitions. [2024-11-12 13:23:03,055 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 237 transitions. Word has length 32 [2024-11-12 13:23:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:23:03,055 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 237 transitions. [2024-11-12 13:23:03,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 42 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 237 transitions. [2024-11-12 13:23:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:23:03,056 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:23:03,056 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:23:03,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 13:23:03,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:03,261 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:23:03,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:23:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1489307653, now seen corresponding path program 1 times [2024-11-12 13:23:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:23:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532491744] [2024-11-12 13:23:03,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:23:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:03,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:23:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532491744] [2024-11-12 13:23:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532491744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:23:03,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637235745] [2024-11-12 13:23:03,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:03,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:03,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:23:03,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:23:03,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 13:23:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:03,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 13:23:03,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:23:03,821 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:23:03,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 20 treesize of output 27 [2024-11-12 13:23:03,912 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-11-12 13:23:04,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:04,014 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 30 [2024-11-12 13:23:04,161 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-12 13:23:04,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2024-11-12 13:23:04,319 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-11-12 13:23:04,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 44 [2024-11-12 13:23:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:04,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:23:04,651 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 88 treesize of output 80 [2024-11-12 13:23:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:05,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637235745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:23:05,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:23:05,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 32 [2024-11-12 13:23:05,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761053921] [2024-11-12 13:23:05,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:23:05,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-12 13:23:05,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:23:05,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-12 13:23:05,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 13:23:05,461 INFO L87 Difference]: Start difference. First operand 186 states and 237 transitions. Second operand has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:23:06,436 INFO L93 Difference]: Finished difference Result 188 states and 238 transitions. [2024-11-12 13:23:06,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:23:06,437 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-12 13:23:06,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:23:06,438 INFO L225 Difference]: With dead ends: 188 [2024-11-12 13:23:06,438 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 13:23:06,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=1106, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 13:23:06,439 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:23:06,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 806 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 13:23:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 13:23:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-12 13:23:06,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 170 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 221 transitions. [2024-11-12 13:23:06,444 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 221 transitions. Word has length 33 [2024-11-12 13:23:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:23:06,444 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 221 transitions. [2024-11-12 13:23:06,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 33 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 221 transitions. [2024-11-12 13:23:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:23:06,445 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:23:06,445 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:23:06,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 13:23:06,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-12 13:23:06,650 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:23:06,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:23:06,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679628, now seen corresponding path program 1 times [2024-11-12 13:23:06,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:23:06,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671382891] [2024-11-12 13:23:06,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:06,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:23:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:06,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:23:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671382891] [2024-11-12 13:23:06,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671382891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:23:06,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802194820] [2024-11-12 13:23:06,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:06,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:06,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:23:06,971 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:23:06,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 13:23:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:07,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 13:23:07,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:23:07,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:23:07,132 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 13:23:07,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-12 13:23:07,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:23:07,153 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:23:07,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:23:07,189 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-11-12 13:23:07,195 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-11-12 13:23:07,226 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:23:07,227 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-12 13:23:07,232 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 24 treesize of output 11 [2024-11-12 13:23:07,300 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 25 treesize of output 13 [2024-11-12 13:23:07,305 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 7 treesize of output 3 [2024-11-12 13:23:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:07,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:23:07,397 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_624) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)))) (forall ((v_ArrVal_624 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_624) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 4)))) is different from false [2024-11-12 13:23:07,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:07,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-12 13:23:07,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:07,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-12 13:23:07,417 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 52 treesize of output 44 [2024-11-12 13:23:07,420 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 82 treesize of output 70 [2024-11-12 13:23:07,431 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 11 treesize of output 9 [2024-11-12 13:23:07,434 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 9 treesize of output 7 [2024-11-12 13:23:07,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:07,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-12 13:23:07,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:23:07,444 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 18 treesize of output 10 [2024-11-12 13:23:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-12 13:23:07,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802194820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:23:07,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:23:07,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2024-11-12 13:23:07,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068699195] [2024-11-12 13:23:07,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:23:07,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:23:07,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:23:07,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:23:07,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2024-11-12 13:23:07,564 INFO L87 Difference]: Start difference. First operand 171 states and 221 transitions. Second operand has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:23:08,104 INFO L93 Difference]: Finished difference Result 176 states and 222 transitions. [2024-11-12 13:23:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:23:08,104 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-12 13:23:08,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:23:08,105 INFO L225 Difference]: With dead ends: 176 [2024-11-12 13:23:08,105 INFO L226 Difference]: Without dead ends: 176 [2024-11-12 13:23:08,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=436, Unknown=1, NotChecked=44, Total=600 [2024-11-12 13:23:08,107 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 139 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:23:08,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 714 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 868 Invalid, 0 Unknown, 108 Unchecked, 0.4s Time] [2024-11-12 13:23:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-12 13:23:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2024-11-12 13:23:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 170 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2024-11-12 13:23:08,110 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 37 [2024-11-12 13:23:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:23:08,110 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2024-11-12 13:23:08,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2024-11-12 13:23:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-12 13:23:08,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:23:08,111 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:23:08,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 13:23:08,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:08,312 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:23:08,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:23:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679629, now seen corresponding path program 1 times [2024-11-12 13:23:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:23:08,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171744121] [2024-11-12 13:23:08,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:08,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:23:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:08,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:23:08,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171744121] [2024-11-12 13:23:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171744121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:23:08,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532518026] [2024-11-12 13:23:08,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:08,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:08,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:23:08,548 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:23:08,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 13:23:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:08,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 13:23:08,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:23:08,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:23:08,710 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 13:23:08,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-12 13:23:08,731 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 13:23:08,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 13:23:08,778 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-11-12 13:23:08,806 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:23:08,806 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-12 13:23:08,863 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 25 treesize of output 13 [2024-11-12 13:23:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:08,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:23:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532518026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:23:08,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:23:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2024-11-12 13:23:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933161541] [2024-11-12 13:23:08,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:23:08,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:23:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:23:08,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:23:08,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:23:08,885 INFO L87 Difference]: Start difference. First operand 171 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:09,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:23:09,155 INFO L93 Difference]: Finished difference Result 175 states and 221 transitions. [2024-11-12 13:23:09,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:23:09,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-12 13:23:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:23:09,156 INFO L225 Difference]: With dead ends: 175 [2024-11-12 13:23:09,156 INFO L226 Difference]: Without dead ends: 175 [2024-11-12 13:23:09,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:23:09,157 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 47 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:23:09,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 329 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:23:09,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-12 13:23:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2024-11-12 13:23:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 170 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2024-11-12 13:23:09,160 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 37 [2024-11-12 13:23:09,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:23:09,161 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2024-11-12 13:23:09,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2024-11-12 13:23:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:23:09,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:23:09,162 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:23:09,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 13:23:09,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:09,363 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:23:09,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:23:09,363 INFO L85 PathProgramCache]: Analyzing trace with hash 507133380, now seen corresponding path program 1 times [2024-11-12 13:23:09,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:23:09,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557632417] [2024-11-12 13:23:09,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:09,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:23:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:09,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:23:09,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557632417] [2024-11-12 13:23:09,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557632417] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:23:09,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170577749] [2024-11-12 13:23:09,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:09,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:09,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:23:09,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:23:09,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 13:23:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:09,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 13:23:09,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:23:09,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:23:09,733 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-12 13:23:09,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-12 13:23:09,746 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 13:23:09,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 13:23:09,773 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-11-12 13:23:09,804 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2024-11-12 13:23:09,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2024-11-12 13:23:09,816 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-11-12 13:23:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:09,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:23:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:09,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170577749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:23:09,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:23:09,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2024-11-12 13:23:09,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044573421] [2024-11-12 13:23:09,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:23:09,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 13:23:09,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:23:09,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 13:23:09,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:23:09,965 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:23:10,246 INFO L93 Difference]: Finished difference Result 171 states and 216 transitions. [2024-11-12 13:23:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:23:10,246 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 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 40 [2024-11-12 13:23:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:23:10,247 INFO L225 Difference]: With dead ends: 171 [2024-11-12 13:23:10,247 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 13:23:10,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:23:10,248 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 85 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:23:10,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 504 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:23:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 13:23:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2024-11-12 13:23:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.6589147286821706) internal successors, (214), 166 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 214 transitions. [2024-11-12 13:23:10,251 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 214 transitions. Word has length 40 [2024-11-12 13:23:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:23:10,252 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 214 transitions. [2024-11-12 13:23:10,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 214 transitions. [2024-11-12 13:23:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:23:10,252 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:23:10,253 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:23:10,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-12 13:23:10,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-12 13:23:10,457 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:23:10,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:23:10,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299147, now seen corresponding path program 1 times [2024-11-12 13:23:10,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:23:10,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317784376] [2024-11-12 13:23:10,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:10,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:23:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-12 13:23:10,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:23:10,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317784376] [2024-11-12 13:23:10,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317784376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:23:10,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:23:10,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:23:10,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993442991] [2024-11-12 13:23:10,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:23:10,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:23:10,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:23:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:23:10,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:23:10,543 INFO L87 Difference]: Start difference. First operand 167 states and 214 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:23:10,697 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2024-11-12 13:23:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:23:10,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-12 13:23:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:23:10,698 INFO L225 Difference]: With dead ends: 166 [2024-11-12 13:23:10,699 INFO L226 Difference]: Without dead ends: 166 [2024-11-12 13:23:10,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:23:10,699 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 19 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:23:10,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 306 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:23:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-12 13:23:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-12 13:23:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 165 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2024-11-12 13:23:10,702 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 41 [2024-11-12 13:23:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:23:10,703 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2024-11-12 13:23:10,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2024-11-12 13:23:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-12 13:23:10,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:23:10,703 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:23:10,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 13:23:10,704 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:23:10,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:23:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299146, now seen corresponding path program 1 times [2024-11-12 13:23:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:23:10,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76165928] [2024-11-12 13:23:10,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:10,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:23:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:11,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:23:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76165928] [2024-11-12 13:23:11,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76165928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:23:11,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105509929] [2024-11-12 13:23:11,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:11,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:11,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:23:11,110 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:23:11,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 13:23:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:11,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-12 13:23:11,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:23:11,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:23:11,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:23:11,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:23:11,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2024-11-12 13:23:11,429 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 35 treesize of output 11 [2024-11-12 13:23:11,571 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 25 treesize of output 13 [2024-11-12 13:23:11,576 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 7 treesize of output 3 [2024-11-12 13:23:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:11,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:23:11,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105509929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:23:11,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:23:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2024-11-12 13:23:11,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360804158] [2024-11-12 13:23:11,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:23:11,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:23:11,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:23:11,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:23:11,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:23:11,615 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:23:11,869 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2024-11-12 13:23:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 13:23:11,870 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-12 13:23:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:23:11,871 INFO L225 Difference]: With dead ends: 186 [2024-11-12 13:23:11,871 INFO L226 Difference]: Without dead ends: 186 [2024-11-12 13:23:11,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-11-12 13:23:11,872 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 57 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:23:11,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 486 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:23:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-12 13:23:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2024-11-12 13:23:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.627906976744186) internal successors, (210), 165 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2024-11-12 13:23:11,876 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 41 [2024-11-12 13:23:11,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:23:11,876 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2024-11-12 13:23:11,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2024-11-12 13:23:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-12 13:23:11,877 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:23:11,877 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:23:11,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 13:23:12,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:12,078 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:23:12,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:23:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash -716785192, now seen corresponding path program 1 times [2024-11-12 13:23:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:23:12,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586316681] [2024-11-12 13:23:12,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:12,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:23:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:12,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:23:12,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586316681] [2024-11-12 13:23:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586316681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:23:12,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089798779] [2024-11-12 13:23:12,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:12,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:12,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:23:12,365 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:23:12,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 13:23:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:12,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 13:23:12,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:23:12,597 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-11-12 13:23:12,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:23:12,629 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 27 treesize of output 11 [2024-11-12 13:23:12,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-12 13:23:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:12,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:23:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:12,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089798779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:23:12,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:23:12,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-11-12 13:23:12,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25798119] [2024-11-12 13:23:12,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:23:12,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:23:12,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:23:12,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:23:12,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:23:12,841 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:23:13,262 INFO L93 Difference]: Finished difference Result 185 states and 211 transitions. [2024-11-12 13:23:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:23:13,263 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-12 13:23:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:23:13,263 INFO L225 Difference]: With dead ends: 185 [2024-11-12 13:23:13,263 INFO L226 Difference]: Without dead ends: 185 [2024-11-12 13:23:13,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 13:23:13,264 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 171 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:23:13,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 776 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:23:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-12 13:23:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 166. [2024-11-12 13:23:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.62015503875969) internal successors, (209), 165 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2024-11-12 13:23:13,268 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 45 [2024-11-12 13:23:13,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:23:13,268 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2024-11-12 13:23:13,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2024-11-12 13:23:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:23:13,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:23:13,269 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:23:13,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 13:23:13,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:13,470 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:23:13,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:23:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash 829868235, now seen corresponding path program 1 times [2024-11-12 13:23:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:23:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511885058] [2024-11-12 13:23:13,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:23:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:14,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:23:14,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511885058] [2024-11-12 13:23:14,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511885058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:23:14,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707548698] [2024-11-12 13:23:14,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:14,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:14,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:23:14,351 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:23:14,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 13:23:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:14,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-12 13:23:14,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:23:14,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:23:14,522 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 13:23:14,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 13:23:14,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:23:14,631 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-12 13:23:14,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-12 13:23:14,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-12 13:23:14,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-12 13:23:14,790 INFO L349 Elim1Store]: treesize reduction 72, result has 33.3 percent of original size [2024-11-12 13:23:14,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 48 [2024-11-12 13:23:14,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2024-11-12 13:23:14,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-11-12 13:23:15,027 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 13:23:15,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 59 [2024-11-12 13:23:15,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-12 13:23:15,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 13:23:15,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2024-11-12 13:23:15,738 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:15,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:23:16,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-12 13:23:16,081 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1372 Int) (v_ArrVal_1371 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1371) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1372) (select .cse0 .cse1)) 1) (= (select .cse0 0) |c_ULTIMATE.start_main_~data~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (forall ((v_ArrVal_1372 Int) (v_ArrVal_1371 (Array Int Int))) (= (let ((.cse2 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1371) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1372) (select .cse2 .cse1))) 1))))) is different from false [2024-11-12 13:23:16,094 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)))) (and (or (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (forall ((v_ArrVal_1372 Int) (v_ArrVal_1371 (Array Int Int))) (= (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1371) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1372) (select .cse0 .cse1))) 1))) (forall ((v_ArrVal_1372 Int) (v_ArrVal_1371 (Array Int Int))) (let ((.cse3 (select (store .cse2 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1371) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (store |c_#valid| (select .cse3 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1372) (select .cse3 .cse1)) 1) (= (select .cse3 0) |c_ULTIMATE.start_main_~data~0#1.base|)))))) is different from false [2024-11-12 13:23:16,122 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (or (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (forall ((v_ArrVal_1372 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1371) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1372) (select .cse0 .cse1))) 1))) (forall ((v_ArrVal_1372 Int) (v_ArrVal_1368 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1368) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1371) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_1372) (select .cse2 .cse1)) 1) (= |c_ULTIMATE.start_main_~data~0#1.base| (select .cse2 0))))))) is different from false [2024-11-12 13:23:20,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:20,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 102 [2024-11-12 13:23:20,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:20,805 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 210 treesize of output 212 [2024-11-12 13:23:20,817 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:23:20,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:20,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2024-11-12 13:23:20,832 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:23:20,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2024-11-12 13:23:20,863 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 8 treesize of output 4 [2024-11-12 13:23:20,881 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:23:20,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:20,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 89 [2024-11-12 13:23:23,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:23,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 75 [2024-11-12 13:23:23,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:23:23,751 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 132 treesize of output 131 [2024-11-12 13:23:23,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-11-12 13:23:23,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-11-12 13:23:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-12 13:23:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707548698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:23:39,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:23:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 21] total 51 [2024-11-12 13:23:39,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137472182] [2024-11-12 13:23:39,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:23:39,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-12 13:23:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:23:39,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-12 13:23:39,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=2069, Unknown=8, NotChecked=288, Total=2652 [2024-11-12 13:23:39,198 INFO L87 Difference]: Start difference. First operand 166 states and 209 transitions. Second operand has 52 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 52 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:40,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-12 13:23:47,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-12 13:23:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:23:50,837 INFO L93 Difference]: Finished difference Result 208 states and 257 transitions. [2024-11-12 13:23:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 13:23:50,838 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 52 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-12 13:23:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:23:50,838 INFO L225 Difference]: With dead ends: 208 [2024-11-12 13:23:50,838 INFO L226 Difference]: Without dead ends: 208 [2024-11-12 13:23:50,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=660, Invalid=3126, Unknown=8, NotChecked=366, Total=4160 [2024-11-12 13:23:50,840 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 135 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 2403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 466 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:23:50,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1230 Invalid, 2403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1900 Invalid, 0 Unknown, 466 Unchecked, 10.4s Time] [2024-11-12 13:23:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-12 13:23:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 164. [2024-11-12 13:23:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 127 states have (on average 1.6062992125984252) internal successors, (204), 163 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2024-11-12 13:23:50,846 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 48 [2024-11-12 13:23:50,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:23:50,846 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2024-11-12 13:23:50,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 52 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:23:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2024-11-12 13:23:50,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-12 13:23:50,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:23:50,847 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:23:50,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-12 13:23:51,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-12 13:23:51,048 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:23:51,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:23:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash 829868236, now seen corresponding path program 1 times [2024-11-12 13:23:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:23:51,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972324804] [2024-11-12 13:23:51,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:23:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:52,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:23:52,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972324804] [2024-11-12 13:23:52,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972324804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:23:52,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440167961] [2024-11-12 13:23:52,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:23:52,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:23:52,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:23:52,251 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:23:52,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 13:23:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:23:52,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-12 13:23:52,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:23:52,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 13:23:52,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:23:52,498 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-12 13:23:52,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-12 13:23:52,533 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 13:23:52,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 13:23:52,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:23:52,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:23:52,796 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-12 13:23:52,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-12 13:23:52,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-12 13:23:52,889 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 32 [2024-11-12 13:23:52,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:23:52,935 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 32 [2024-11-12 13:23:52,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:23:52,977 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-12 13:23:52,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-12 13:23:52,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-12 13:23:53,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:23:53,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-12 13:23:53,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 13:23:53,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2024-11-12 13:23:53,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-12 13:23:53,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-12 13:23:53,264 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 25 treesize of output 13 [2024-11-12 13:23:53,268 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 7 treesize of output 3 [2024-11-12 13:23:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:23:53,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:23:53,448 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1532 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1532) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1532) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1531) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0)))))) is different from false [2024-11-12 13:23:53,456 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1528 Int) (v_ArrVal_1532 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1528)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1532) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1528 Int) (v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (Array Int Int)) (v_ArrVal_1527 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1528)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1532) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1527)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1531) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1)))))) is different from false [2024-11-12 13:23:53,470 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1528 Int) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1532 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1528)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1532) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1525 (Array Int Int)) (v_ArrVal_1532 (Array Int Int)) (v_ArrVal_1531 (Array Int Int)) (v_ArrVal_1527 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1525) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1528)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1532) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1526) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1527)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1531) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0)))))) is different from false [2024-11-12 13:24:01,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:01,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2024-11-12 13:24:02,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:02,010 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 97 treesize of output 96 [2024-11-12 13:24:02,018 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 29 treesize of output 25 [2024-11-12 13:24:02,025 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 13 treesize of output 9 [2024-11-12 13:24:02,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:02,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 96 [2024-11-12 13:24:02,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:02,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 76 [2024-11-12 13:24:02,142 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:02,143 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 267 treesize of output 266 [2024-11-12 13:24:02,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:02,166 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 451 treesize of output 438 [2024-11-12 13:24:02,176 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 49 treesize of output 45 [2024-11-12 13:24:02,184 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 45 treesize of output 41 [2024-11-12 13:24:02,192 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 25 treesize of output 21 [2024-11-12 13:24:02,201 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 21 treesize of output 17 [2024-11-12 13:24:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-12 13:24:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440167961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:02,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:02,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 14] total 37 [2024-11-12 13:24:02,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403104829] [2024-11-12 13:24:02,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:02,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-12 13:24:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:02,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-12 13:24:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1029, Unknown=8, NotChecked=204, Total=1406 [2024-11-12 13:24:02,872 INFO L87 Difference]: Start difference. First operand 164 states and 204 transitions. Second operand has 38 states, 37 states have (on average 3.675675675675676) internal successors, (136), 38 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:24:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:04,764 INFO L93 Difference]: Finished difference Result 278 states and 336 transitions. [2024-11-12 13:24:04,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 13:24:04,764 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.675675675675676) internal successors, (136), 38 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-12 13:24:04,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:04,765 INFO L225 Difference]: With dead ends: 278 [2024-11-12 13:24:04,766 INFO L226 Difference]: Without dead ends: 278 [2024-11-12 13:24:04,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=365, Invalid=1895, Unknown=8, NotChecked=282, Total=2550 [2024-11-12 13:24:04,767 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 488 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 2415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 707 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:04,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 885 Invalid, 2415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1659 Invalid, 0 Unknown, 707 Unchecked, 1.3s Time] [2024-11-12 13:24:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-12 13:24:04,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 175. [2024-11-12 13:24:04,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.6231884057971016) internal successors, (224), 174 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:24:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 224 transitions. [2024-11-12 13:24:04,771 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 224 transitions. Word has length 48 [2024-11-12 13:24:04,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:04,771 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 224 transitions. [2024-11-12 13:24:04,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.675675675675676) internal successors, (136), 38 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:24:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 224 transitions. [2024-11-12 13:24:04,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 13:24:04,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:04,772 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:04,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 13:24:04,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-12 13:24:04,977 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:24:04,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:04,977 INFO L85 PathProgramCache]: Analyzing trace with hash -43889214, now seen corresponding path program 1 times [2024-11-12 13:24:04,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:04,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360043791] [2024-11-12 13:24:04,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:04,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:05,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360043791] [2024-11-12 13:24:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360043791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:05,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423892050] [2024-11-12 13:24:05,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:05,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:05,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:05,386 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:24:05,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-12 13:24:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:05,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-12 13:24:05,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:05,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:24:05,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:24:05,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2024-11-12 13:24:06,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:06,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 62 [2024-11-12 13:24:06,016 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 51 treesize of output 35 [2024-11-12 13:24:06,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2024-11-12 13:24:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:06,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:24:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423892050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:24:06,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:24:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [13] total 32 [2024-11-12 13:24:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480393660] [2024-11-12 13:24:06,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:24:06,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 13:24:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:06,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 13:24:06,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2024-11-12 13:24:06,240 INFO L87 Difference]: Start difference. First operand 175 states and 224 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:24:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:24:06,966 INFO L93 Difference]: Finished difference Result 227 states and 272 transitions. [2024-11-12 13:24:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 13:24:06,967 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-12 13:24:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:24:06,968 INFO L225 Difference]: With dead ends: 227 [2024-11-12 13:24:06,968 INFO L226 Difference]: Without dead ends: 227 [2024-11-12 13:24:06,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2024-11-12 13:24:06,969 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 108 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:24:06,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 624 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:24:06,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-12 13:24:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 192. [2024-11-12 13:24:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 155 states have (on average 1.6580645161290322) internal successors, (257), 191 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:24:06,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 257 transitions. [2024-11-12 13:24:06,973 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 257 transitions. Word has length 49 [2024-11-12 13:24:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:24:06,973 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 257 transitions. [2024-11-12 13:24:06,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:24:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 257 transitions. [2024-11-12 13:24:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-12 13:24:06,974 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:24:06,974 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:24:06,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-12 13:24:07,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-12 13:24:07,179 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-12 13:24:07,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:24:07,179 INFO L85 PathProgramCache]: Analyzing trace with hash -43888410, now seen corresponding path program 1 times [2024-11-12 13:24:07,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:24:07,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471001157] [2024-11-12 13:24:07,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:07,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:24:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:24:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471001157] [2024-11-12 13:24:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471001157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:24:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630073065] [2024-11-12 13:24:07,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:24:07,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:24:07,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:24:07,879 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:24:07,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-12 13:24:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:24:08,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-12 13:24:08,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:24:08,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 13:24:08,081 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 13:24:08,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 13:24:08,140 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-12 13:24:08,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-12 13:24:08,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:24:08,254 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-12 13:24:08,255 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 51 [2024-11-12 13:24:08,480 INFO L349 Elim1Store]: treesize reduction 31, result has 27.9 percent of original size [2024-11-12 13:24:08,480 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 39 [2024-11-12 13:24:08,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-12 13:24:08,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-12 13:24:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:08,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:24:09,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-12 13:24:09,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:24:09,204 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 650 treesize of output 642 [2024-11-12 13:24:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:24:09,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630073065] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:24:09,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:24:09,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2024-11-12 13:24:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222043370] [2024-11-12 13:24:09,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:24:09,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-12 13:24:09,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:24:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-12 13:24:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1407, Unknown=0, NotChecked=0, Total=1560 [2024-11-12 13:24:09,542 INFO L87 Difference]: Start difference. First operand 192 states and 257 transitions. Second operand has 40 states, 39 states have (on average 3.2051282051282053) internal successors, (125), 40 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)