./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 023d838f 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:11:27,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:11:27,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:11:27,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:11:27,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:11:27,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:11:27,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:11:27,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:11:27,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:11:27,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:11:27,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:11:27,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:11:27,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:11:27,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:11:27,764 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:11:27,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:11:27,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:11:27,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:11:27,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:11:27,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:11:27,765 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:11:27,768 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:11:27,768 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:11:27,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:11:27,769 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:11:27,769 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:11:27,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:11:27,769 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:11:27,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:11:27,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:11:27,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:11:27,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:11:27,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:11:27,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:11:27,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:11:27,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:11:27,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:11:27,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:11:27,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:11:27,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:11:27,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:11:27,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:11:27,772 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-10 15:11:27,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:11:27,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:11:27,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:11:27,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:11:27,975 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:11:27,975 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-10 15:11:29,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:11:29,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:11:29,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2024-11-10 15:11:29,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9e6b239/7880a91be0944425bcefa5e111b3d9af/FLAGcba2ad709 [2024-11-10 15:11:29,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9e6b239/7880a91be0944425bcefa5e111b3d9af [2024-11-10 15:11:29,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:11:29,786 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:11:29,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:11:29,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:11:29,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:11:29,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:11:29" (1/1) ... [2024-11-10 15:11:29,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7dbb4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:29, skipping insertion in model container [2024-11-10 15:11:29,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:11:29" (1/1) ... [2024-11-10 15:11:29,824 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:11:30,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:11:30,095 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:11:30,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:11:30,221 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:11:30,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30 WrapperNode [2024-11-10 15:11:30,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:11:30,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:11:30,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:11:30,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:11:30,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,279 INFO L138 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2024-11-10 15:11:30,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:11:30,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:11:30,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:11:30,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:11:30,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,320 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-10 15:11:30,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:11:30,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:11:30,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:11:30,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:11:30,343 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (1/1) ... [2024-11-10 15:11:30,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:11:30,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:11:30,380 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-10 15:11:30,390 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-10 15:11:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:11:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 15:11:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:11:30,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 15:11:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:11:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:11:30,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:11:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 15:11:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:11:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 15:11:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:11:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 15:11:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 15:11:30,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:11:30,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:11:30,545 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:11:30,547 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:11:30,836 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2024-11-10 15:11:30,836 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:11:30,847 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:11:30,847 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:11:30,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:11:30 BoogieIcfgContainer [2024-11-10 15:11:30,847 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:11:30,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:11:30,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:11:30,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:11:30,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:11:29" (1/3) ... [2024-11-10 15:11:30,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f22492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:11:30, skipping insertion in model container [2024-11-10 15:11:30,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:11:30" (2/3) ... [2024-11-10 15:11:30,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f22492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:11:30, skipping insertion in model container [2024-11-10 15:11:30,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:11:30" (3/3) ... [2024-11-10 15:11:30,853 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513.i [2024-11-10 15:11:30,864 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:11:30,865 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-11-10 15:11:30,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:11:30,899 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;@7e813572, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:11:30,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-10 15:11:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 139 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-10 15:11:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:11:30,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:30,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:11:30,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:30,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1236121949, now seen corresponding path program 1 times [2024-11-10 15:11:30,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441291415] [2024-11-10 15:11:30,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:30,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:31,015 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-10 15:11:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:31,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441291415] [2024-11-10 15:11:31,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441291415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:31,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:31,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:11:31,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991187609] [2024-11-10 15:11:31,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:31,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 15:11:31,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:31,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 15:11:31,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 15:11:31,043 INFO L87 Difference]: Start difference. First operand has 140 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 139 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-10 15:11:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:31,061 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2024-11-10 15:11:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 15:11:31,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-10 15:11:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:31,070 INFO L225 Difference]: With dead ends: 140 [2024-11-10 15:11:31,071 INFO L226 Difference]: Without dead ends: 137 [2024-11-10 15:11:31,072 INFO L431 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-10 15:11:31,076 INFO L432 NwaCegarLoop]: 148 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, 148 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-10 15:11:31,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:11:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-10 15:11:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-10 15:11:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 136 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-10 15:11:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2024-11-10 15:11:31,114 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 6 [2024-11-10 15:11:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:31,116 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2024-11-10 15:11:31,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-10 15:11:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2024-11-10 15:11:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:11:31,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:31,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:11:31,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:11:31,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:31,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:31,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1236121980, now seen corresponding path program 1 times [2024-11-10 15:11:31,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:31,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315250978] [2024-11-10 15:11:31,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:31,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:31,218 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-10 15:11:31,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:31,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315250978] [2024-11-10 15:11:31,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315250978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:31,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:31,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:11:31,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681951355] [2024-11-10 15:11:31,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:31,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:11:31,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:31,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:11:31,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:31,221 INFO L87 Difference]: Start difference. First operand 137 states and 145 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-10 15:11:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:31,397 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2024-11-10 15:11:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:11:31,398 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-10 15:11:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:31,399 INFO L225 Difference]: With dead ends: 145 [2024-11-10 15:11:31,401 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 15:11:31,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:31,402 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 46 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:31,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 162 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:11:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 15:11:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2024-11-10 15:11:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 80 states have (on average 1.8875) internal successors, (151), 138 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:31,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2024-11-10 15:11:31,417 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 6 [2024-11-10 15:11:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:31,418 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2024-11-10 15:11:31,418 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-10 15:11:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2024-11-10 15:11:31,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:11:31,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:31,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:11:31,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:11:31,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:31,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:31,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1236121981, now seen corresponding path program 1 times [2024-11-10 15:11:31,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:31,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575476650] [2024-11-10 15:11:31,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:31,486 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-10 15:11:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:31,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575476650] [2024-11-10 15:11:31,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575476650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:31,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:31,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:11:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207349705] [2024-11-10 15:11:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:31,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:11:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:11:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:31,488 INFO L87 Difference]: Start difference. First operand 139 states and 151 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-10 15:11:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:31,557 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2024-11-10 15:11:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:11:31,558 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-10 15:11:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:31,559 INFO L225 Difference]: With dead ends: 137 [2024-11-10 15:11:31,559 INFO L226 Difference]: Without dead ends: 137 [2024-11-10 15:11:31,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:31,560 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 21 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 189 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-10 15:11:31,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 189 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-10 15:11:31,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-10 15:11:31,565 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-10 15:11:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2024-11-10 15:11:31,566 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2024-11-10 15:11:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:31,566 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2024-11-10 15:11:31,566 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-10 15:11:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2024-11-10 15:11:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:11:31,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:31,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:11:31,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:11:31,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:31,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:31,571 INFO L85 PathProgramCache]: Analyzing trace with hash -335018088, now seen corresponding path program 1 times [2024-11-10 15:11:31,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:31,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848444353] [2024-11-10 15:11:31,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:31,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:31,587 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-10 15:11:31,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:31,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848444353] [2024-11-10 15:11:31,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848444353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:31,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:31,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:11:31,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931105365] [2024-11-10 15:11:31,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:31,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:11:31,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:31,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:11:31,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:31,590 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:31,671 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2024-11-10 15:11:31,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:11:31,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:11:31,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:31,673 INFO L225 Difference]: With dead ends: 187 [2024-11-10 15:11:31,673 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 15:11:31,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:31,675 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 45 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:31,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 194 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 15:11:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 140. [2024-11-10 15:11:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 83 states have (on average 1.8433734939759037) internal successors, (153), 139 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-10 15:11:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2024-11-10 15:11:31,685 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 7 [2024-11-10 15:11:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:31,685 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2024-11-10 15:11:31,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2024-11-10 15:11:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 15:11:31,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:31,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:11:31,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:11:31,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:31,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:31,690 INFO L85 PathProgramCache]: Analyzing trace with hash -335013544, now seen corresponding path program 1 times [2024-11-10 15:11:31,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:31,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388247636] [2024-11-10 15:11:31,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:31,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:31,725 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-10 15:11:31,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:31,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388247636] [2024-11-10 15:11:31,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388247636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:31,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:31,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:11:31,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117179243] [2024-11-10 15:11:31,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:31,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:11:31,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:31,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:11:31,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:31,728 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:31,768 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2024-11-10 15:11:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:11:31,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 15:11:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:31,769 INFO L225 Difference]: With dead ends: 146 [2024-11-10 15:11:31,769 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 15:11:31,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:31,770 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:31,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 235 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:11:31,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 15:11:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-10 15:11:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 88 states have (on average 1.7840909090909092) internal successors, (157), 144 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2024-11-10 15:11:31,775 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 7 [2024-11-10 15:11:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:31,775 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2024-11-10 15:11:31,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2024-11-10 15:11:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:11:31,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:31,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:11:31,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:11:31,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:31,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1158769457, now seen corresponding path program 1 times [2024-11-10 15:11:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:31,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677113255] [2024-11-10 15:11:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:31,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:31,834 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-10 15:11:31,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:31,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677113255] [2024-11-10 15:11:31,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677113255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:31,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:31,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:11:31,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202102442] [2024-11-10 15:11:31,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:31,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:11:31,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:31,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:11:31,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:31,836 INFO L87 Difference]: Start difference. First operand 145 states and 157 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-10 15:11:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:31,899 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2024-11-10 15:11:31,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:11:31,899 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-10 15:11:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:31,900 INFO L225 Difference]: With dead ends: 141 [2024-11-10 15:11:31,900 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 15:11:31,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:31,905 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 19 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:31,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 179 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 15:11:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-10 15:11:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 88 states have (on average 1.7386363636363635) internal successors, (153), 140 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-10 15:11:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2024-11-10 15:11:31,912 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 11 [2024-11-10 15:11:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:31,912 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2024-11-10 15:11:31,912 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-10 15:11:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2024-11-10 15:11:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:11:31,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:31,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:11:31,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:11:31,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:31,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:31,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1158769458, now seen corresponding path program 1 times [2024-11-10 15:11:31,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:31,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014281060] [2024-11-10 15:11:31,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:31,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:31,967 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-10 15:11:31,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:31,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014281060] [2024-11-10 15:11:31,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014281060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:31,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:31,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:11:31,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309142581] [2024-11-10 15:11:31,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:31,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:11:31,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:31,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:11:31,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:31,972 INFO L87 Difference]: Start difference. First operand 141 states and 153 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-10 15:11:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:32,035 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2024-11-10 15:11:32,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:11:32,035 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-10 15:11:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:32,036 INFO L225 Difference]: With dead ends: 138 [2024-11-10 15:11:32,036 INFO L226 Difference]: Without dead ends: 138 [2024-11-10 15:11:32,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:11:32,037 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:32,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 193 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-10 15:11:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-10 15:11:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.7045454545454546) 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-10 15:11:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2024-11-10 15:11:32,059 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 11 [2024-11-10 15:11:32,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:32,059 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2024-11-10 15:11:32,059 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-10 15:11:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2024-11-10 15:11:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:11:32,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:32,064 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:11:32,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:11:32,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:32,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:32,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1098958627, now seen corresponding path program 1 times [2024-11-10 15:11:32,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:32,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393656263] [2024-11-10 15:11:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:32,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:32,112 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-10 15:11:32,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:32,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393656263] [2024-11-10 15:11:32,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393656263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:32,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:32,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:11:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976247974] [2024-11-10 15:11:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:32,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:11:32,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:11:32,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:11:32,114 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:32,195 INFO L93 Difference]: Finished difference Result 211 states and 246 transitions. [2024-11-10 15:11:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:11:32,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 15:11:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:32,196 INFO L225 Difference]: With dead ends: 211 [2024-11-10 15:11:32,196 INFO L226 Difference]: Without dead ends: 211 [2024-11-10 15:11:32,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:11:32,198 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 93 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:32,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 269 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-10 15:11:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 138. [2024-11-10 15:11:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.6818181818181819) internal successors, (148), 137 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2024-11-10 15:11:32,207 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 19 [2024-11-10 15:11:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:32,207 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2024-11-10 15:11:32,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2024-11-10 15:11:32,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:11:32,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:32,208 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:11:32,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 15:11:32,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:32,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:32,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1098963171, now seen corresponding path program 1 times [2024-11-10 15:11:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:32,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003365873] [2024-11-10 15:11:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:32,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:32,287 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-10 15:11:32,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:32,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003365873] [2024-11-10 15:11:32,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003365873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:32,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:32,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:11:32,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756497316] [2024-11-10 15:11:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:32,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:11:32,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:32,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:11:32,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:11:32,292 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:32,418 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2024-11-10 15:11:32,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:11:32,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 15:11:32,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:32,419 INFO L225 Difference]: With dead ends: 132 [2024-11-10 15:11:32,419 INFO L226 Difference]: Without dead ends: 132 [2024-11-10 15:11:32,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:11:32,419 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 40 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:32,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 232 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:32,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-10 15:11:32,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-10 15:11:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 90 states have (on average 1.5888888888888888) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2024-11-10 15:11:32,425 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 19 [2024-11-10 15:11:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:32,425 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2024-11-10 15:11:32,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,426 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2024-11-10 15:11:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 15:11:32,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:32,426 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:11:32,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 15:11:32,427 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:32,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1098963172, now seen corresponding path program 1 times [2024-11-10 15:11:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:32,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100918046] [2024-11-10 15:11:32,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:32,531 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-10 15:11:32,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:32,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100918046] [2024-11-10 15:11:32,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100918046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:32,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:32,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:11:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199386495] [2024-11-10 15:11:32,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:32,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:11:32,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:32,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:11:32,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:11:32,533 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:32,671 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2024-11-10 15:11:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:11:32,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 15:11:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:32,672 INFO L225 Difference]: With dead ends: 197 [2024-11-10 15:11:32,673 INFO L226 Difference]: Without dead ends: 197 [2024-11-10 15:11:32,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:11:32,673 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 81 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:32,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 196 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-10 15:11:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 174. [2024-11-10 15:11:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 134 states have (on average 1.6194029850746268) internal successors, (217), 173 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 217 transitions. [2024-11-10 15:11:32,677 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 217 transitions. Word has length 19 [2024-11-10 15:11:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:32,677 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 217 transitions. [2024-11-10 15:11:32,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 217 transitions. [2024-11-10 15:11:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:11:32,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:32,678 INFO L215 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] [2024-11-10 15:11:32,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 15:11:32,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:32,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash -854980246, now seen corresponding path program 1 times [2024-11-10 15:11:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226825751] [2024-11-10 15:11:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:32,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:32,749 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-10 15:11:32,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:32,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226825751] [2024-11-10 15:11:32,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226825751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:32,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:32,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:11:32,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146322305] [2024-11-10 15:11:32,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:32,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:11:32,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:32,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:11:32,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:11:32,752 INFO L87 Difference]: Start difference. First operand 174 states and 217 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:32,828 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2024-11-10 15:11:32,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:11:32,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 15:11:32,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:32,829 INFO L225 Difference]: With dead ends: 199 [2024-11-10 15:11:32,829 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 15:11:32,830 INFO L431 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-10 15:11:32,830 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 83 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:32,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 269 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 15:11:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 175. [2024-11-10 15:11:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 135 states have (on average 1.614814814814815) internal successors, (218), 174 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 218 transitions. [2024-11-10 15:11:32,834 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 218 transitions. Word has length 24 [2024-11-10 15:11:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:32,834 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 218 transitions. [2024-11-10 15:11:32,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 218 transitions. [2024-11-10 15:11:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 15:11:32,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:32,835 INFO L215 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] [2024-11-10 15:11:32,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:11:32,835 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:32,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash -851717174, now seen corresponding path program 1 times [2024-11-10 15:11:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:32,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228967999] [2024-11-10 15:11:32,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:32,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-10 15:11:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:32,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228967999] [2024-11-10 15:11:32,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228967999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:32,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:32,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:11:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706771733] [2024-11-10 15:11:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:32,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:11:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:32,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:11:32,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:11:32,997 INFO L87 Difference]: Start difference. First operand 175 states and 218 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:33,084 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2024-11-10 15:11:33,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:11:33,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-10 15:11:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:33,086 INFO L225 Difference]: With dead ends: 188 [2024-11-10 15:11:33,086 INFO L226 Difference]: Without dead ends: 188 [2024-11-10 15:11:33,086 INFO L431 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-10 15:11:33,087 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 6 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:33,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 369 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-10 15:11:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2024-11-10 15:11:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 143 states have (on average 1.5874125874125875) internal successors, (227), 182 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 227 transitions. [2024-11-10 15:11:33,091 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 227 transitions. Word has length 24 [2024-11-10 15:11:33,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:33,091 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 227 transitions. [2024-11-10 15:11:33,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:33,091 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 227 transitions. [2024-11-10 15:11:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:11:33,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:33,092 INFO L215 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-10 15:11:33,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:11:33,092 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:33,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:33,093 INFO L85 PathProgramCache]: Analyzing trace with hash -648189399, now seen corresponding path program 1 times [2024-11-10 15:11:33,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:33,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773433140] [2024-11-10 15:11:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:33,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:33,451 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-10 15:11:33,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:33,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773433140] [2024-11-10 15:11:33,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773433140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:33,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:33,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:11:33,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756417146] [2024-11-10 15:11:33,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:33,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:11:33,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:33,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:11:33,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:11:33,453 INFO L87 Difference]: Start difference. First operand 183 states and 227 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-10 15:11:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:33,776 INFO L93 Difference]: Finished difference Result 203 states and 249 transitions. [2024-11-10 15:11:33,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:11:33,777 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-10 15:11:33,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:33,778 INFO L225 Difference]: With dead ends: 203 [2024-11-10 15:11:33,778 INFO L226 Difference]: Without dead ends: 203 [2024-11-10 15:11:33,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-10 15:11:33,778 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 37 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:33,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 396 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:11:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-10 15:11:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2024-11-10 15:11:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 191 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 238 transitions. [2024-11-10 15:11:33,781 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 238 transitions. Word has length 29 [2024-11-10 15:11:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:33,782 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 238 transitions. [2024-11-10 15:11:33,782 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-10 15:11:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 238 transitions. [2024-11-10 15:11:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 15:11:33,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:33,783 INFO L215 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-10 15:11:33,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 15:11:33,783 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:33,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash -648189400, now seen corresponding path program 1 times [2024-11-10 15:11:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:33,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752969557] [2024-11-10 15:11:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:34,107 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-10 15:11:34,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:34,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752969557] [2024-11-10 15:11:34,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752969557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:34,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:34,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:11:34,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951110147] [2024-11-10 15:11:34,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:34,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:11:34,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:34,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:11:34,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:11:34,108 INFO L87 Difference]: Start difference. First operand 192 states and 238 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 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-10 15:11:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:34,430 INFO L93 Difference]: Finished difference Result 204 states and 251 transitions. [2024-11-10 15:11:34,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 15:11:34,430 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 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-10 15:11:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:34,431 INFO L225 Difference]: With dead ends: 204 [2024-11-10 15:11:34,431 INFO L226 Difference]: Without dead ends: 204 [2024-11-10 15:11:34,431 INFO L431 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-10 15:11:34,432 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 46 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:34,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 342 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:11:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-10 15:11:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2024-11-10 15:11:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 191 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-10 15:11:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 237 transitions. [2024-11-10 15:11:34,435 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 237 transitions. Word has length 29 [2024-11-10 15:11:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:34,435 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 237 transitions. [2024-11-10 15:11:34,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 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-10 15:11:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 237 transitions. [2024-11-10 15:11:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:11:34,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:34,437 INFO L215 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] [2024-11-10 15:11:34,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:11:34,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:34,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:34,438 INFO L85 PathProgramCache]: Analyzing trace with hash -139824577, now seen corresponding path program 1 times [2024-11-10 15:11:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:34,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021274826] [2024-11-10 15:11:34,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:34,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:34,616 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-10 15:11:34,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:34,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021274826] [2024-11-10 15:11:34,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021274826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:34,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:34,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:11:34,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315274556] [2024-11-10 15:11:34,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:34,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:11:34,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:34,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:11:34,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:11:34,618 INFO L87 Difference]: Start difference. First operand 192 states and 237 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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-10 15:11:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:34,764 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2024-11-10 15:11:34,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 15:11:34,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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 31 [2024-11-10 15:11:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:34,765 INFO L225 Difference]: With dead ends: 194 [2024-11-10 15:11:34,765 INFO L226 Difference]: Without dead ends: 194 [2024-11-10 15:11:34,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:11:34,766 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 15 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:34,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 506 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-10 15:11:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2024-11-10 15:11:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 152 states have (on average 1.5526315789473684) internal successors, (236), 191 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 236 transitions. [2024-11-10 15:11:34,769 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 236 transitions. Word has length 31 [2024-11-10 15:11:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:34,769 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 236 transitions. [2024-11-10 15:11:34,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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-10 15:11:34,769 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 236 transitions. [2024-11-10 15:11:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:11:34,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:34,770 INFO L215 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] [2024-11-10 15:11:34,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:11:34,770 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:34,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash -139756026, now seen corresponding path program 1 times [2024-11-10 15:11:34,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:34,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307285351] [2024-11-10 15:11:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:34,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:34,924 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-10 15:11:34,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:34,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307285351] [2024-11-10 15:11:34,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307285351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:34,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:34,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:11:34,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467006135] [2024-11-10 15:11:34,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:34,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:11:34,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:34,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:11:34,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:11:34,925 INFO L87 Difference]: Start difference. First operand 192 states and 236 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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-10 15:11:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:35,080 INFO L93 Difference]: Finished difference Result 205 states and 249 transitions. [2024-11-10 15:11:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:11:35,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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 31 [2024-11-10 15:11:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:35,082 INFO L225 Difference]: With dead ends: 205 [2024-11-10 15:11:35,082 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 15:11:35,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-10 15:11:35,082 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 36 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:35,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 463 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 15:11:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2024-11-10 15:11:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 154 states have (on average 1.5454545454545454) internal successors, (238), 193 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 238 transitions. [2024-11-10 15:11:35,085 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 238 transitions. Word has length 31 [2024-11-10 15:11:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:35,085 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 238 transitions. [2024-11-10 15:11:35,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 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-10 15:11:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 238 transitions. [2024-11-10 15:11:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:11:35,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:35,086 INFO L215 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] [2024-11-10 15:11:35,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 15:11:35,086 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:35,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:35,086 INFO L85 PathProgramCache]: Analyzing trace with hash -37469531, now seen corresponding path program 1 times [2024-11-10 15:11:35,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:35,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449903165] [2024-11-10 15:11:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:35,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:35,330 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-10 15:11:35,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:35,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449903165] [2024-11-10 15:11:35,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449903165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:35,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:35,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 15:11:35,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500010802] [2024-11-10 15:11:35,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:35,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:11:35,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:35,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:11:35,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:11:35,333 INFO L87 Difference]: Start difference. First operand 194 states and 238 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:35,538 INFO L93 Difference]: Finished difference Result 197 states and 241 transitions. [2024-11-10 15:11:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:11:35,539 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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-10 15:11:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:35,540 INFO L225 Difference]: With dead ends: 197 [2024-11-10 15:11:35,540 INFO L226 Difference]: Without dead ends: 197 [2024-11-10 15:11:35,540 INFO L431 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-10 15:11:35,540 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 17 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:35,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 531 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:11:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-10 15:11:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-11-10 15:11:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 155 states have (on average 1.5419354838709678) internal successors, (239), 194 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 239 transitions. [2024-11-10 15:11:35,544 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 239 transitions. Word has length 32 [2024-11-10 15:11:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:35,544 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 239 transitions. [2024-11-10 15:11:35,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 239 transitions. [2024-11-10 15:11:35,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:11:35,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:35,545 INFO L215 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-10 15:11:35,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:11:35,545 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:35,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:35,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1161555484, now seen corresponding path program 1 times [2024-11-10 15:11:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:35,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621833156] [2024-11-10 15:11:35,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:35,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:35,586 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-10 15:11:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:35,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621833156] [2024-11-10 15:11:35,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621833156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:35,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:11:35,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:11:35,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943974055] [2024-11-10 15:11:35,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:35,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:11:35,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:35,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:11:35,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:11:35,588 INFO L87 Difference]: Start difference. First operand 195 states and 239 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:35,724 INFO L93 Difference]: Finished difference Result 263 states and 330 transitions. [2024-11-10 15:11:35,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:11:35,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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-10 15:11:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:35,725 INFO L225 Difference]: With dead ends: 263 [2024-11-10 15:11:35,725 INFO L226 Difference]: Without dead ends: 263 [2024-11-10 15:11:35,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:11:35,726 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 68 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:35,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 257 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:11:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-10 15:11:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 201. [2024-11-10 15:11:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 163 states have (on average 1.5460122699386503) internal successors, (252), 200 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 252 transitions. [2024-11-10 15:11:35,729 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 252 transitions. Word has length 33 [2024-11-10 15:11:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:35,729 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 252 transitions. [2024-11-10 15:11:35,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 252 transitions. [2024-11-10 15:11:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:11:35,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:35,730 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-11-10 15:11:35,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 15:11:35,730 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:35,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:35,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1261079570, now seen corresponding path program 1 times [2024-11-10 15:11:35,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:35,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124402991] [2024-11-10 15:11:35,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:35,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:11:36,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:36,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124402991] [2024-11-10 15:11:36,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124402991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:11:36,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017004172] [2024-11-10 15:11:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:36,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:11:36,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:11:36,151 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-10 15:11:36,153 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-10 15:11:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:36,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-10 15:11:36,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:11:36,273 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-10 15:11:36,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:11:36,290 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-10 15:11:36,294 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-10 15:11:36,347 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:11:36,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-10 15:11:36,368 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:11:36,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-10 15:11:36,423 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 23 [2024-11-10 15:11:36,442 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:11:36,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2024-11-10 15:11:36,654 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-10 15:11:36,862 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2024-11-10 15:11:36,863 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 95 treesize of output 99 [2024-11-10 15:11:36,915 INFO L349 Elim1Store]: treesize reduction 16, result has 78.1 percent of original size [2024-11-10 15:11:36,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 114 [2024-11-10 15:11:36,962 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2024-11-10 15:11:36,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 85 [2024-11-10 15:11:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:11:37,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:11:37,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-10 15:11:37,552 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-10 15:11:37,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (let ((.cse2 (not .cse0))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse1 v_arrayElimCell_20) 0) 0) (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (or .cse2 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse3 v_arrayElimCell_20) 0) 0) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_ArrVal_419 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse4 (select (store v_ArrVal_419 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|) 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_419) .cse4) 0) 0) (= .cse4 |ULTIMATE.start_main_~lItem~0#1.base|)))) (or .cse0 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int) (v_ArrVal_422 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_20) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_20 Int)) (or (forall ((v_ArrVal_422 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (= (select (select .cse5 v_arrayElimCell_20) 0) 0) (= (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_20))))) (or .cse2 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |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-10 15:11:41,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-10 15:11:41,840 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 102 treesize of output 98 [2024-11-10 15:11:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:11:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017004172] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:11:41,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:11:41,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 39 [2024-11-10 15:11:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218533858] [2024-11-10 15:11:41,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:11:41,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 15:11:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:41,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 15:11:41,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1249, Unknown=5, NotChecked=72, Total=1482 [2024-11-10 15:11:41,847 INFO L87 Difference]: Start difference. First operand 201 states and 252 transitions. Second operand has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 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-10 15:11:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:42,856 INFO L93 Difference]: Finished difference Result 209 states and 260 transitions. [2024-11-10 15:11:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:11:42,857 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 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 37 [2024-11-10 15:11:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:42,858 INFO L225 Difference]: With dead ends: 209 [2024-11-10 15:11:42,858 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 15:11:42,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=235, Invalid=1744, Unknown=5, NotChecked=86, Total=2070 [2024-11-10 15:11:42,859 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 47 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:42,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1601 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1428 Invalid, 0 Unknown, 80 Unchecked, 0.7s Time] [2024-11-10 15:11:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 15:11:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2024-11-10 15:11:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 167 states have (on average 1.532934131736527) internal successors, (256), 204 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 256 transitions. [2024-11-10 15:11:42,862 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 256 transitions. Word has length 37 [2024-11-10 15:11:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:42,863 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 256 transitions. [2024-11-10 15:11:42,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 39 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-10 15:11:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 256 transitions. [2024-11-10 15:11:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:11:42,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:42,864 INFO L215 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] [2024-11-10 15:11:42,877 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-10 15:11:43,067 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-10 15:11:43,068 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:43,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:43,068 INFO L85 PathProgramCache]: Analyzing trace with hash -105171399, now seen corresponding path program 1 times [2024-11-10 15:11:43,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:43,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918782603] [2024-11-10 15:11:43,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:43,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:43,360 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-10 15:11:43,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918782603] [2024-11-10 15:11:43,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918782603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:11:43,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343718029] [2024-11-10 15:11:43,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:43,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:11:43,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:11:43,362 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-10 15:11:43,363 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-10 15:11:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:43,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 15:11:43,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:11:43,513 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-10 15:11:43,556 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-10 15:11:43,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:11:43,598 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 41 treesize of output 31 [2024-11-10 15:11:43,661 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-10 15:11:43,662 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-10 15:11:43,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:11:51,849 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-10 15:11:51,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343718029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:11:51,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:11:51,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2024-11-10 15:11:51,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972336067] [2024-11-10 15:11:51,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:11:51,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 15:11:51,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:51,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 15:11:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=278, Unknown=2, NotChecked=0, Total=342 [2024-11-10 15:11:51,851 INFO L87 Difference]: Start difference. First operand 205 states and 256 transitions. Second operand has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:52,430 INFO L93 Difference]: Finished difference Result 229 states and 257 transitions. [2024-11-10 15:11:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 15:11:52,431 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 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 38 [2024-11-10 15:11:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:52,432 INFO L225 Difference]: With dead ends: 229 [2024-11-10 15:11:52,432 INFO L226 Difference]: Without dead ends: 229 [2024-11-10 15:11:52,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=198, Invalid=730, Unknown=2, NotChecked=0, Total=930 [2024-11-10 15:11:52,432 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 155 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:52,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 821 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:11:52,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-10 15:11:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 205. [2024-11-10 15:11:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 167 states have (on average 1.526946107784431) internal successors, (255), 204 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2024-11-10 15:11:52,437 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 38 [2024-11-10 15:11:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:52,437 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2024-11-10 15:11:52,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2024-11-10 15:11:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:11:52,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:52,438 INFO L215 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] [2024-11-10 15:11:52,450 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-10 15:11:52,642 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-10 15:11:52,644 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:52,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash -105171398, now seen corresponding path program 1 times [2024-11-10 15:11:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:52,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418071395] [2024-11-10 15:11:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:52,901 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-10 15:11:52,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:52,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418071395] [2024-11-10 15:11:52,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418071395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:11:52,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395442459] [2024-11-10 15:11:52,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:52,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:11:52,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:11:52,904 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-10 15:11:52,905 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-10 15:11:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:52,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 15:11:52,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:11:53,029 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-10 15:11:53,077 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-10 15:11:53,083 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-10 15:11:53,108 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-10 15:11:53,113 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-10 15:11:53,220 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-10 15:11:53,224 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-10 15:11:53,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-10 15:11:53,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:11:53,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395442459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:11:53,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:11:53,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 17 [2024-11-10 15:11:53,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922834037] [2024-11-10 15:11:53,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:11:53,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:11:53,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:11:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:11:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-10 15:11:53,240 INFO L87 Difference]: Start difference. First operand 205 states and 255 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:11:53,459 INFO L93 Difference]: Finished difference Result 228 states and 256 transitions. [2024-11-10 15:11:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:11:53,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-10 15:11:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:11:53,461 INFO L225 Difference]: With dead ends: 228 [2024-11-10 15:11:53,461 INFO L226 Difference]: Without dead ends: 228 [2024-11-10 15:11:53,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-11-10 15:11:53,461 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 77 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:11:53,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 475 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:11:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-10 15:11:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 205. [2024-11-10 15:11:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 167 states have (on average 1.5209580838323353) internal successors, (254), 204 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 254 transitions. [2024-11-10 15:11:53,464 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 254 transitions. Word has length 38 [2024-11-10 15:11:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:11:53,464 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 254 transitions. [2024-11-10 15:11:53,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:11:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 254 transitions. [2024-11-10 15:11:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 15:11:53,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:11:53,465 INFO L215 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:11:53,478 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-10 15:11:53,665 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-10 15:11:53,666 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:11:53,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:11:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash -716759356, now seen corresponding path program 1 times [2024-11-10 15:11:53,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:11:53,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906621621] [2024-11-10 15:11:53,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:53,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:11:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:11:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:11:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906621621] [2024-11-10 15:11:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906621621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:11:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853412075] [2024-11-10 15:11:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:11:53,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:11:53,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:11:53,969 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-10 15:11:53,970 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-10 15:11:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:11:54,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 15:11:54,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:11:54,146 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-10 15:11:54,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:11:54,239 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 46 treesize of output 36 [2024-11-10 15:11:54,483 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~item2~0#1.base_28| Int) (|v_ULTIMATE.start_main_~data~0#1.base_48| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item2~0#1.base_28|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_48| 0) |v_ULTIMATE.start_main_~item2~0#1.base_28| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item2~0#1.base_28| 1) |v_ULTIMATE.start_main_~data~0#1.base_48|) 0))) is different from true [2024-11-10 15:11:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-10 15:11:54,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:11:54,625 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 48 treesize of output 44 [2024-11-10 15:12:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:12:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853412075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:12:07,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:12:07,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 29 [2024-11-10 15:12:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587523142] [2024-11-10 15:12:07,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:12:07,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:12:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:12:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:12:07,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=720, Unknown=3, NotChecked=54, Total=870 [2024-11-10 15:12:07,087 INFO L87 Difference]: Start difference. First operand 205 states and 254 transitions. Second operand has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:12:08,204 INFO L93 Difference]: Finished difference Result 208 states and 256 transitions. [2024-11-10 15:12:08,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 15:12:08,204 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-10 15:12:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:12:08,205 INFO L225 Difference]: With dead ends: 208 [2024-11-10 15:12:08,205 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 15:12:08,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=167, Invalid=1240, Unknown=3, NotChecked=72, Total=1482 [2024-11-10 15:12:08,207 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 14 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 15:12:08,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 998 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1329 Invalid, 0 Unknown, 149 Unchecked, 0.8s Time] [2024-11-10 15:12:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 15:12:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-10 15:12:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 147 states have (on average 1.5850340136054422) internal successors, (233), 184 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2024-11-10 15:12:08,210 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 39 [2024-11-10 15:12:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:12:08,210 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2024-11-10 15:12:08,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 30 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2024-11-10 15:12:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:12:08,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:12:08,211 INFO L215 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] [2024-11-10 15:12:08,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 15:12:08,411 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-10 15:12:08,411 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:12:08,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:12:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1603023053, now seen corresponding path program 1 times [2024-11-10 15:12:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:12:08,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390990222] [2024-11-10 15:12:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:12:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:08,471 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-10 15:12:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:12:08,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390990222] [2024-11-10 15:12:08,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390990222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:12:08,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:12:08,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:12:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438188425] [2024-11-10 15:12:08,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:12:08,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:12:08,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:12:08,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:12:08,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:12:08,473 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:12:08,636 INFO L93 Difference]: Finished difference Result 184 states and 231 transitions. [2024-11-10 15:12:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:12:08,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-10 15:12:08,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:12:08,637 INFO L225 Difference]: With dead ends: 184 [2024-11-10 15:12:08,637 INFO L226 Difference]: Without dead ends: 184 [2024-11-10 15:12:08,637 INFO L431 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-10 15:12:08,638 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 20 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:12:08,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 329 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:12:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-10 15:12:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-10 15:12:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 147 states have (on average 1.5714285714285714) internal successors, (231), 183 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 231 transitions. [2024-11-10 15:12:08,640 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 231 transitions. Word has length 42 [2024-11-10 15:12:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:12:08,641 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 231 transitions. [2024-11-10 15:12:08,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 231 transitions. [2024-11-10 15:12:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:12:08,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:12:08,641 INFO L215 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] [2024-11-10 15:12:08,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 15:12:08,641 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:12:08,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:12:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1603023052, now seen corresponding path program 1 times [2024-11-10 15:12:08,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:12:08,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170980751] [2024-11-10 15:12:08,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:08,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:12:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:08,877 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-10 15:12:08,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:12:08,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170980751] [2024-11-10 15:12:08,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170980751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:12:08,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581561316] [2024-11-10 15:12:08,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:08,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:12:08,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:12:08,879 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-10 15:12:08,880 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-10 15:12:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:08,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 15:12:08,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:12:09,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 15:12:09,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:12:09,065 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-10 15:12:09,156 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 23 treesize of output 15 [2024-11-10 15:12:09,158 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 26 treesize of output 14 [2024-11-10 15:12:09,164 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-10 15:12:09,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:12:09,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:09,229 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 31 treesize of output 35 [2024-11-10 15:12:09,406 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-10 15:12:09,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581561316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:12:09,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:12:09,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2024-11-10 15:12:09,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617099719] [2024-11-10 15:12:09,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:12:09,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 15:12:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:12:09,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 15:12:09,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2024-11-10 15:12:09,411 INFO L87 Difference]: Start difference. First operand 184 states and 231 transitions. Second operand has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:12:10,097 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2024-11-10 15:12:10,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 15:12:10,097 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-10 15:12:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:12:10,098 INFO L225 Difference]: With dead ends: 207 [2024-11-10 15:12:10,098 INFO L226 Difference]: Without dead ends: 207 [2024-11-10 15:12:10,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=1642, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 15:12:10,099 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 285 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:12:10,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 891 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:12:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-10 15:12:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 184. [2024-11-10 15:12:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 147 states have (on average 1.564625850340136) internal successors, (230), 183 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 230 transitions. [2024-11-10 15:12:10,102 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 230 transitions. Word has length 42 [2024-11-10 15:12:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:12:10,102 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 230 transitions. [2024-11-10 15:12:10,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.0) internal successors, (108), 28 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 230 transitions. [2024-11-10 15:12:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 15:12:10,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:12:10,102 INFO L215 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] [2024-11-10 15:12:10,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:12:10,306 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,SelfDestructingSolverStorable23 [2024-11-10 15:12:10,306 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:12:10,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:12:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1667943142, now seen corresponding path program 1 times [2024-11-10 15:12:10,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:12:10,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403765461] [2024-11-10 15:12:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:12:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:10,441 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-10 15:12:10,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:12:10,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403765461] [2024-11-10 15:12:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403765461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:12:10,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228360961] [2024-11-10 15:12:10,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:10,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:12:10,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:12:10,444 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-10 15:12:10,455 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-10 15:12:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:10,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 15:12:10,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:12:10,569 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-10 15:12:10,588 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:12:10,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:12:10,624 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-10 15:12:10,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:12:10,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:12:10,684 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2024-11-10 15:12:10,684 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 58 treesize of output 40 [2024-11-10 15:12:10,752 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-10 15:12:10,752 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 15 [2024-11-10 15:12:10,754 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-10 15:12:10,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:12:10,900 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-10 15:12:10,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228360961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:12:10,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:12:10,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-10 15:12:10,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668996259] [2024-11-10 15:12:10,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:12:10,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 15:12:10,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:12:10,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 15:12:10,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-10 15:12:10,902 INFO L87 Difference]: Start difference. First operand 184 states and 230 transitions. Second operand has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:14,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:12:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:12:15,375 INFO L93 Difference]: Finished difference Result 182 states and 227 transitions. [2024-11-10 15:12:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:12:15,376 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-10 15:12:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:12:15,376 INFO L225 Difference]: With dead ends: 182 [2024-11-10 15:12:15,376 INFO L226 Difference]: Without dead ends: 182 [2024-11-10 15:12:15,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2024-11-10 15:12:15,377 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 113 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:12:15,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 608 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 518 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-11-10 15:12:15,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-10 15:12:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2024-11-10 15:12:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 143 states have (on average 1.5734265734265733) internal successors, (225), 179 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2024-11-10 15:12:15,380 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 43 [2024-11-10 15:12:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:12:15,380 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2024-11-10 15:12:15,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2024-11-10 15:12:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:12:15,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:12:15,380 INFO L215 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-10 15:12:15,395 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-10 15:12:15,584 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-10 15:12:15,585 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:12:15,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:12:15,585 INFO L85 PathProgramCache]: Analyzing trace with hash 81650854, now seen corresponding path program 1 times [2024-11-10 15:12:15,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:12:15,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126004178] [2024-11-10 15:12:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:15,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:12:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:15,865 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-10 15:12:15,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:12:15,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126004178] [2024-11-10 15:12:15,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126004178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:12:15,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231596260] [2024-11-10 15:12:15,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:15,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:12:15,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:12:15,867 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-10 15:12:15,868 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-10 15:12:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:15,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 15:12:15,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:12:16,047 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-10 15:12:16,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:12:16,066 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-10 15:12:16,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 15:12:16,124 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-10 15:12:16,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:12:16,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231596260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:12:16,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:12:16,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2024-11-10 15:12:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749638964] [2024-11-10 15:12:16,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:12:16,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 15:12:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:12:16,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 15:12:16,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-10 15:12:16,125 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:12:16,227 INFO L93 Difference]: Finished difference Result 202 states and 228 transitions. [2024-11-10 15:12:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:12:16,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-10 15:12:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:12:16,228 INFO L225 Difference]: With dead ends: 202 [2024-11-10 15:12:16,228 INFO L226 Difference]: Without dead ends: 202 [2024-11-10 15:12:16,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-10 15:12:16,229 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 61 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:12:16,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 528 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:12:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-10 15:12:16,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2024-11-10 15:12:16,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 143 states have (on average 1.5664335664335665) 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-10 15:12:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2024-11-10 15:12:16,232 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 45 [2024-11-10 15:12:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:12:16,232 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2024-11-10 15:12:16,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2024-11-10 15:12:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 15:12:16,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:12:16,232 INFO L215 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] [2024-11-10 15:12:16,245 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-10 15:12:16,433 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-10 15:12:16,433 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:12:16,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:12:16,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1763790768, now seen corresponding path program 1 times [2024-11-10 15:12:16,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:12:16,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040887166] [2024-11-10 15:12:16,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:16,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:12:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:16,637 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-10 15:12:16,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:12:16,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040887166] [2024-11-10 15:12:16,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040887166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:12:16,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088313926] [2024-11-10 15:12:16,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:16,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:12:16,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:12:16,640 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-10 15:12:16,645 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-10 15:12:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:16,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 15:12:16,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:12:16,849 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-10 15:12:16,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:12:16,873 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-10 15:12:16,921 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-10 15:12:16,931 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-10 15:12:16,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:12:17,063 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-10 15:12:17,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088313926] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:12:17,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:12:17,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2024-11-10 15:12:17,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52021095] [2024-11-10 15:12:17,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:12:17,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 15:12:17,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:12:17,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 15:12:17,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-10 15:12:17,065 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 19 states, 18 states have (on average 5.388888888888889) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:12:17,506 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2024-11-10 15:12:17,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:12:17,506 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.388888888888889) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-10 15:12:17,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:12:17,511 INFO L225 Difference]: With dead ends: 199 [2024-11-10 15:12:17,511 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 15:12:17,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 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-10 15:12:17,511 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 190 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:12:17,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 686 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:12:17,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 15:12:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2024-11-10 15:12:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 179 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-10 15:12:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 223 transitions. [2024-11-10 15:12:17,517 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 223 transitions. Word has length 46 [2024-11-10 15:12:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:12:17,517 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 223 transitions. [2024-11-10 15:12:17,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.388888888888889) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 223 transitions. [2024-11-10 15:12:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 15:12:17,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:12:17,518 INFO L215 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, 1, 1] [2024-11-10 15:12:17,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 15:12:17,722 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-10 15:12:17,723 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:12:17,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:12:17,723 INFO L85 PathProgramCache]: Analyzing trace with hash -465062722, now seen corresponding path program 1 times [2024-11-10 15:12:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:12:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111424859] [2024-11-10 15:12:17,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:12:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:18,513 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-10 15:12:18,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:12:18,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111424859] [2024-11-10 15:12:18,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111424859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:12:18,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572799291] [2024-11-10 15:12:18,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:18,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:12:18,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:12:18,515 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-10 15:12:18,517 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-10 15:12:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:18,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-10 15:12:18,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:12:18,654 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-10 15:12:18,671 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:12:18,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:12:18,737 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-10 15:12:18,787 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2024-11-10 15:12:18,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2024-11-10 15:12:18,828 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 26 treesize of output 19 [2024-11-10 15:12:18,851 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 26 treesize of output 19 [2024-11-10 15:12:18,893 INFO L349 Elim1Store]: treesize reduction 84, result has 30.0 percent of original size [2024-11-10 15:12:18,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 48 [2024-11-10 15:12:19,008 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 34 treesize of output 25 [2024-11-10 15:12:19,052 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 37 treesize of output 28 [2024-11-10 15:12:19,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:12:19,117 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2024-11-10 15:12:19,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 87 [2024-11-10 15:12:19,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:12:19,673 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 15:12:19,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 45 [2024-11-10 15:12:19,677 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 7 treesize of output 3 [2024-11-10 15:12:19,925 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-10 15:12:19,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2024-11-10 15:12:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:12:20,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:12:20,484 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-10 15:12:21,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:21,850 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 198 treesize of output 129 [2024-11-10 15:12:21,854 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:12:21,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:21,861 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 52 treesize of output 51 [2024-11-10 15:12:21,867 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 19 treesize of output 15 [2024-11-10 15:12:22,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:22,018 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 302 treesize of output 192 [2024-11-10 15:12:22,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:12:22,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:22,033 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 1396 treesize of output 1386 [2024-11-10 15:12:22,045 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 241 treesize of output 225 [2024-11-10 15:12:22,054 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-10 15:12:22,065 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-10 15:12:22,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:22,078 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 54 treesize of output 54 [2024-11-10 15:12:28,287 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-10 15:12:28,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572799291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:12:28,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:12:28,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 23] total 55 [2024-11-10 15:12:28,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603547986] [2024-11-10 15:12:28,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:12:28,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-11-10 15:12:28,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:12:28,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-11-10 15:12:28,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=2714, Unknown=3, NotChecked=0, Total=3080 [2024-11-10 15:12:28,290 INFO L87 Difference]: Start difference. First operand 180 states and 223 transitions. Second operand has 56 states, 55 states have (on average 2.618181818181818) internal successors, (144), 56 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:12:31,740 INFO L93 Difference]: Finished difference Result 223 states and 272 transitions. [2024-11-10 15:12:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 15:12:31,741 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.618181818181818) internal successors, (144), 56 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-10 15:12:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:12:31,744 INFO L225 Difference]: With dead ends: 223 [2024-11-10 15:12:31,744 INFO L226 Difference]: Without dead ends: 223 [2024-11-10 15:12:31,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=647, Invalid=3771, Unknown=4, NotChecked=0, Total=4422 [2024-11-10 15:12:31,745 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 150 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 2504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:12:31,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1431 Invalid, 2504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2471 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 15:12:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-10 15:12:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 177. [2024-11-10 15:12:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 140 states have (on average 1.55) internal successors, (217), 176 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 217 transitions. [2024-11-10 15:12:31,752 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 217 transitions. Word has length 51 [2024-11-10 15:12:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:12:31,752 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 217 transitions. [2024-11-10 15:12:31,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.618181818181818) internal successors, (144), 56 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 217 transitions. [2024-11-10 15:12:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-10 15:12:31,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:12:31,752 INFO L215 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, 1, 1] [2024-11-10 15:12:31,768 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-10 15:12:31,953 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-10 15:12:31,953 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:12:31,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:12:31,954 INFO L85 PathProgramCache]: Analyzing trace with hash -465062721, now seen corresponding path program 1 times [2024-11-10 15:12:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:12:31,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403679192] [2024-11-10 15:12:31,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:12:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:32,910 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-10 15:12:32,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:12:32,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403679192] [2024-11-10 15:12:32,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403679192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:12:32,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126568558] [2024-11-10 15:12:32,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:32,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:12:32,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:12:32,915 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-10 15:12:32,916 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-10 15:12:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:33,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-10 15:12:33,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:12:33,077 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-10 15:12:33,081 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-10 15:12:33,121 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:12:33,122 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-10 15:12:33,141 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:12:33,141 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-10 15:12:33,229 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-10 15:12:33,232 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-10 15:12:33,293 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:12:33,294 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-10 15:12:33,322 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-10 15:12:33,322 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-10 15:12:33,384 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-10 15:12:33,390 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-10 15:12:33,427 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-10 15:12:33,432 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-10 15:12:33,486 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-10 15:12:33,486 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 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-10 15:12:33,507 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-10 15:12:33,508 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-10 15:12:33,623 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-10 15:12:33,635 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-10 15:12:33,681 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 37 treesize of output 28 [2024-11-10 15:12:33,697 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-10 15:12:33,775 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:12:33,775 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 82 treesize of output 69 [2024-11-10 15:12:33,781 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 27 treesize of output 22 [2024-11-10 15:12:33,920 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 19 treesize of output 7 [2024-11-10 15:12:34,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:34,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 54 treesize of output 26 [2024-11-10 15:12:34,130 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-10 15:12:34,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:12:34,333 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1652 Int)) (<= (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1652)))) (store .cse0 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse1 |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|) .cse3) 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| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1655) |c_ULTIMATE.start_main_~data~0#1.base|) .cse3)))) (forall ((v_ArrVal_1652 Int)) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1652)))) (store .cse4 |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse1 |c_ULTIMATE.start_main_~item~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1.base|) .cse3) 4))))) is different from false [2024-11-10 15:12:34,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1648 (Array Int Int)) (v_ArrVal_1655 (Array Int Int)) (v_ArrVal_1652 Int) (v_ArrVal_1649 (Array Int Int))) (<= (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1649))) (let ((.cse0 (store (select .cse1 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1652))) (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| .cse0) |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select (store .cse1 |c_ULTIMATE.start_main_~data~0#1.base| .cse0) |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse2 |c_ULTIMATE.start_main_~item~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1.base|) .cse3) 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_1648) |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_1655) |c_ULTIMATE.start_main_~data~0#1.base|) .cse3)))) (forall ((v_ArrVal_1652 Int) (v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1649))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| v_ArrVal_1652))) (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| .cse4) |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select (store .cse5 |c_ULTIMATE.start_main_~data~0#1.base| .cse4) |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse2 |c_ULTIMATE.start_main_~item~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1.base|) .cse3) 4))))) is different from false [2024-11-10 15:12:42,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:42,980 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 96 treesize of output 67 [2024-11-10 15:12:42,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:42,995 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 268 treesize of output 270 [2024-11-10 15:12:43,002 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 33 treesize of output 29 [2024-11-10 15:12:43,007 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 50 treesize of output 42 [2024-11-10 15:12:43,024 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-10 15:12:43,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:43,035 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 31 treesize of output 31 [2024-11-10 15:12:43,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:43,155 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 150 treesize of output 141 [2024-11-10 15:12:43,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:43,163 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 130 treesize of output 101 [2024-11-10 15:12:43,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:43,176 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 706 treesize of output 699 [2024-11-10 15:12:43,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:43,205 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 1188 treesize of output 1182 [2024-11-10 15:12:43,215 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 53 treesize of output 49 [2024-11-10 15:12:43,221 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-10 15:12:43,226 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 68 treesize of output 60 [2024-11-10 15:12:43,233 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 90 treesize of output 82 [2024-11-10 15:12:43,256 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-10 15:12:43,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:43,289 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 39 treesize of output 39 [2024-11-10 15:12:45,338 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-10 15:12:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126568558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:12:45,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:12:45,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2024-11-10 15:12:45,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040878402] [2024-11-10 15:12:45,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:12:45,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-10 15:12:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:12:45,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-10 15:12:45,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1305, Unknown=12, NotChecked=150, Total=1640 [2024-11-10 15:12:45,341 INFO L87 Difference]: Start difference. First operand 177 states and 217 transitions. Second operand has 41 states, 40 states have (on average 3.675) internal successors, (147), 41 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:49,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 15:12:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:12:53,773 INFO L93 Difference]: Finished difference Result 293 states and 349 transitions. [2024-11-10 15:12:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:12:53,773 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.675) internal successors, (147), 41 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-10 15:12:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:12:53,774 INFO L225 Difference]: With dead ends: 293 [2024-11-10 15:12:53,774 INFO L226 Difference]: Without dead ends: 293 [2024-11-10 15:12:53,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=543, Invalid=2759, Unknown=12, NotChecked=226, Total=3540 [2024-11-10 15:12:53,775 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 499 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 511 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:12:53,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 964 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1872 Invalid, 1 Unknown, 511 Unchecked, 6.3s Time] [2024-11-10 15:12:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-10 15:12:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 189. [2024-11-10 15:12:53,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 188 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 238 transitions. [2024-11-10 15:12:53,778 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 238 transitions. Word has length 51 [2024-11-10 15:12:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:12:53,778 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 238 transitions. [2024-11-10 15:12:53,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.675) internal successors, (147), 41 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 238 transitions. [2024-11-10 15:12:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:12:53,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:12:53,779 INFO L215 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, 1, 1, 1] [2024-11-10 15:12:53,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 15:12:53,983 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-10 15:12:53,984 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:12:53,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:12:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1532044220, now seen corresponding path program 1 times [2024-11-10 15:12:53,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:12:53,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012746533] [2024-11-10 15:12:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:53,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:12:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:54,220 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-10 15:12:54,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:12:54,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012746533] [2024-11-10 15:12:54,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012746533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:12:54,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992298263] [2024-11-10 15:12:54,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:54,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:12:54,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:12:54,224 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-10 15:12:54,231 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-10 15:12:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:54,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 15:12:54,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:12:54,426 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-10 15:12:54,489 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-10 15:12:54,517 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-10 15:12:54,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:54,768 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-10 15:12:54,773 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-10 15:12:54,944 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-10 15:12:54,982 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-10 15:12:54,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:12:54,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992298263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:12:54,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:12:54,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 29 [2024-11-10 15:12:54,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913811090] [2024-11-10 15:12:54,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:12:54,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 15:12:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:12:54,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 15:12:54,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2024-11-10 15:12:54,985 INFO L87 Difference]: Start difference. First operand 189 states and 238 transitions. Second operand has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:12:55,605 INFO L93 Difference]: Finished difference Result 243 states and 288 transitions. [2024-11-10 15:12:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:12:55,605 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-10 15:12:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:12:55,606 INFO L225 Difference]: With dead ends: 243 [2024-11-10 15:12:55,606 INFO L226 Difference]: Without dead ends: 243 [2024-11-10 15:12:55,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=1241, Unknown=0, NotChecked=0, Total=1406 [2024-11-10 15:12:55,607 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 107 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:12:55,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 663 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:12:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-10 15:12:55,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 208. [2024-11-10 15:12:55,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 171 states have (on average 1.5964912280701755) internal successors, (273), 207 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 273 transitions. [2024-11-10 15:12:55,610 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 273 transitions. Word has length 52 [2024-11-10 15:12:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:12:55,610 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 273 transitions. [2024-11-10 15:12:55,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 273 transitions. [2024-11-10 15:12:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:12:55,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:12:55,611 INFO L215 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, 1, 1, 1] [2024-11-10 15:12:55,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-10 15:12:55,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:12:55,815 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:12:55,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:12:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1532042453, now seen corresponding path program 1 times [2024-11-10 15:12:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:12:55,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20250082] [2024-11-10 15:12:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:55,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:12:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:56,410 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-10 15:12:56,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:12:56,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20250082] [2024-11-10 15:12:56,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20250082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:12:56,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152762060] [2024-11-10 15:12:56,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:56,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:12:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:12:56,412 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:12:56,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:12:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:56,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 15:12:56,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:12:56,601 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-10 15:12:56,643 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-10 15:12:56,643 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-10 15:12:56,698 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-10 15:12:56,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:12:56,731 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 57 treesize of output 39 [2024-11-10 15:12:56,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:12:56,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:56,917 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 54 treesize of output 49 [2024-11-10 15:12:56,920 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 38 treesize of output 26 [2024-11-10 15:12:57,084 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-10 15:12:57,084 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 18 treesize of output 13 [2024-11-10 15:12:57,089 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-10 15:12:57,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:12:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152762060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:12:57,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 15:12:57,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 27 [2024-11-10 15:12:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479291082] [2024-11-10 15:12:57,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:12:57,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 15:12:57,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:12:57,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 15:12:57,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2024-11-10 15:12:57,090 INFO L87 Difference]: Start difference. First operand 208 states and 273 transitions. Second operand has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:12:57,875 INFO L93 Difference]: Finished difference Result 282 states and 328 transitions. [2024-11-10 15:12:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 15:12:57,875 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-10 15:12:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:12:57,876 INFO L225 Difference]: With dead ends: 282 [2024-11-10 15:12:57,876 INFO L226 Difference]: Without dead ends: 282 [2024-11-10 15:12:57,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 15:12:57,877 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 161 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:12:57,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 691 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 15:12:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-10 15:12:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 208. [2024-11-10 15:12:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 171 states have (on average 1.590643274853801) internal successors, (272), 207 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 272 transitions. [2024-11-10 15:12:57,881 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 272 transitions. Word has length 52 [2024-11-10 15:12:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:12:57,881 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 272 transitions. [2024-11-10 15:12:57,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.466666666666667) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:12:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 272 transitions. [2024-11-10 15:12:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 15:12:57,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:12:57,881 INFO L215 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, 1, 1, 1] [2024-11-10 15:12:57,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-10 15:12:58,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:12:58,082 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:12:58,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:12:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1532042452, now seen corresponding path program 1 times [2024-11-10 15:12:58,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:12:58,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977583447] [2024-11-10 15:12:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:58,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:12:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:58,721 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-10 15:12:58,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:12:58,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977583447] [2024-11-10 15:12:58,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977583447] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:12:58,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355204391] [2024-11-10 15:12:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:12:58,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:12:58,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:12:58,725 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:12:58,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 15:12:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:12:58,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-10 15:12:58,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:12:58,922 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-10 15:12:58,924 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-10 15:12:58,974 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:12:58,974 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-10 15:12:58,979 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 9 [2024-11-10 15:12:59,042 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-10 15:12:59,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:12:59,074 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 76 treesize of output 50 [2024-11-10 15:12:59,080 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 19 treesize of output 11 [2024-11-10 15:12:59,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:12:59,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:12:59,211 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 75 treesize of output 66 [2024-11-10 15:12:59,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:12:59,911 INFO L349 Elim1Store]: treesize reduction 240, result has 52.1 percent of original size [2024-11-10 15:12:59,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 203 treesize of output 378