./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/list-ext_flag.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc 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/list-ext-properties/list-ext_flag.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 3747e65f01c1fbd6eb9d2ad39b0ceed8be631bde45acb074c0903963e660faab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:39:02,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:39:02,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:39:02,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:39:02,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:39:02,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:39:02,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:39:02,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:39:02,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:39:02,840 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:39:02,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:39:02,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:39:02,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:39:02,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:39:02,842 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:39:02,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:39:02,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:39:02,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:39:02,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:39:02,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:39:02,849 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:39:02,850 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:39:02,850 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:39:02,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:39:02,851 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:39:02,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:39:02,851 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:39:02,851 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:39:02,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:39:02,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:39:02,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:39:02,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:39:02,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:39:02,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:39:02,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:39:02,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:39:02,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:39:02,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:39:02,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:39:02,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:39:02,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:39:02,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:39:02,858 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 -> 3747e65f01c1fbd6eb9d2ad39b0ceed8be631bde45acb074c0903963e660faab [2024-11-19 06:39:03,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:39:03,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:39:03,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:39:03,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:39:03,133 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:39:03,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2024-11-19 06:39:04,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:39:04,854 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:39:04,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2024-11-19 06:39:04,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d5a7177d/364b59b29b934d7bba1228cfc7d61939/FLAG2d08ab8c2 [2024-11-19 06:39:04,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d5a7177d/364b59b29b934d7bba1228cfc7d61939 [2024-11-19 06:39:04,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:39:04,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:39:04,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:39:04,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:39:04,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:39:04,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:39:04" (1/1) ... [2024-11-19 06:39:04,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55267780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:04, skipping insertion in model container [2024-11-19 06:39:04,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:39:04" (1/1) ... [2024-11-19 06:39:04,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:39:05,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:39:05,303 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:39:05,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:39:05,391 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:39:05,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05 WrapperNode [2024-11-19 06:39:05,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:39:05,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:39:05,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:39:05,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:39:05,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,443 INFO L138 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2024-11-19 06:39:05,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:39:05,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:39:05,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:39:05,445 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:39:05,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,490 INFO L175 MemorySlicer]: Split 19 memory accesses to 2 slices as follows [2, 17]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-19 06:39:05,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:39:05,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:39:05,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:39:05,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:39:05,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (1/1) ... [2024-11-19 06:39:05,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:39:05,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:05,553 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-19 06:39:05,556 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-19 06:39:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-19 06:39:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-19 06:39:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:39:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:39:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:39:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:39:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:39:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:39:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:39:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:39:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:39:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:39:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:39:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:39:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:39:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:39:05,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:39:05,676 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:39:05,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:39:05,718 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-19 06:39:06,011 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-19 06:39:06,015 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:39:06,032 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:39:06,033 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 06:39:06,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:39:06 BoogieIcfgContainer [2024-11-19 06:39:06,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:39:06,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:39:06,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:39:06,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:39:06,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:39:04" (1/3) ... [2024-11-19 06:39:06,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5596fc2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:39:06, skipping insertion in model container [2024-11-19 06:39:06,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:39:05" (2/3) ... [2024-11-19 06:39:06,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5596fc2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:39:06, skipping insertion in model container [2024-11-19 06:39:06,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:39:06" (3/3) ... [2024-11-19 06:39:06,042 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_flag.i [2024-11-19 06:39:06,057 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:39:06,057 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2024-11-19 06:39:06,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:39:06,113 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;@60f01e8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:39:06,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2024-11-19 06:39:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 105 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:39:06,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:06,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:39:06,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:06,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-19 06:39:06,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736131551] [2024-11-19 06:39:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:06,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:06,386 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-19 06:39:06,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:06,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736131551] [2024-11-19 06:39:06,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736131551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:06,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:06,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:39:06,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821860990] [2024-11-19 06:39:06,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:06,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:39:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:06,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:39:06,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:06,482 INFO L87 Difference]: Start difference. First operand has 107 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 105 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:06,611 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2024-11-19 06:39:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:39:06,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-19 06:39:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:06,622 INFO L225 Difference]: With dead ends: 105 [2024-11-19 06:39:06,622 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 06:39:06,624 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-19 06:39:06,629 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 67 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:06,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 109 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 06:39:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-19 06:39:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.962962962962963) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-11-19 06:39:06,671 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 4 [2024-11-19 06:39:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:06,672 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-11-19 06:39:06,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-11-19 06:39:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:39:06,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:06,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:39:06,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:39:06,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:06,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-19 06:39:06,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:06,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537244560] [2024-11-19 06:39:06,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:06,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:06,786 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-19 06:39:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:06,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537244560] [2024-11-19 06:39:06,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537244560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:06,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:06,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:39:06,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997555259] [2024-11-19 06:39:06,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:06,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:39:06,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:06,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:39:06,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:39:06,790 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:06,869 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-11-19 06:39:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:39:06,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-19 06:39:06,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:06,872 INFO L225 Difference]: With dead ends: 97 [2024-11-19 06:39:06,872 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 06:39:06,873 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-19 06:39:06,875 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 65 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:06,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 102 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 06:39:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 06:39:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-11-19 06:39:06,889 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 4 [2024-11-19 06:39:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:06,889 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-11-19 06:39:06,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-11-19 06:39:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:39:06,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:06,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:06,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:39:06,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:06,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304377, now seen corresponding path program 1 times [2024-11-19 06:39:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:06,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298052328] [2024-11-19 06:39:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:06,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:06,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:06,991 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-19 06:39:06,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:06,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298052328] [2024-11-19 06:39:06,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298052328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:06,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:06,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:39:06,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437075615] [2024-11-19 06:39:06,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:06,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:39:06,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:06,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:39:06,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:06,994 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:07,159 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-19 06:39:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:39:07,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:39:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:07,161 INFO L225 Difference]: With dead ends: 93 [2024-11-19 06:39:07,161 INFO L226 Difference]: Without dead ends: 93 [2024-11-19 06:39:07,161 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-19 06:39:07,162 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 110 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:07,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 64 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-19 06:39:07,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-19 06:39:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 88 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-11-19 06:39:07,180 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 9 [2024-11-19 06:39:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:07,180 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-11-19 06:39:07,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-11-19 06:39:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:39:07,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:07,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:07,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:39:07,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:07,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:07,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304378, now seen corresponding path program 1 times [2024-11-19 06:39:07,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:07,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476412149] [2024-11-19 06:39:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:07,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:07,321 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-19 06:39:07,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:07,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476412149] [2024-11-19 06:39:07,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476412149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:07,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:07,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:39:07,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334333286] [2024-11-19 06:39:07,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:07,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:39:07,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:07,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:39:07,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:07,326 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:07,490 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2024-11-19 06:39:07,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:39:07,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:39:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:07,492 INFO L225 Difference]: With dead ends: 114 [2024-11-19 06:39:07,492 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 06:39:07,493 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-19 06:39:07,494 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 119 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:07,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 97 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 06:39:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2024-11-19 06:39:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 84 states have (on average 1.5) internal successors, (126), 109 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2024-11-19 06:39:07,511 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 9 [2024-11-19 06:39:07,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:07,511 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2024-11-19 06:39:07,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2024-11-19 06:39:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:39:07,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:07,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:07,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:39:07,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:07,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1348173030, now seen corresponding path program 1 times [2024-11-19 06:39:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:07,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530348057] [2024-11-19 06:39:07,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:07,714 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-19 06:39:07,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:07,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530348057] [2024-11-19 06:39:07,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530348057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:07,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:07,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:39:07,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388663957] [2024-11-19 06:39:07,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:07,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:39:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:07,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:39:07,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:07,720 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:07,830 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2024-11-19 06:39:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:39:07,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 06:39:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:07,833 INFO L225 Difference]: With dead ends: 127 [2024-11-19 06:39:07,833 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 06:39:07,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:07,834 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 15 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:07,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 278 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 06:39:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2024-11-19 06:39:07,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 114 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2024-11-19 06:39:07,842 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 17 [2024-11-19 06:39:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:07,842 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2024-11-19 06:39:07,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2024-11-19 06:39:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:39:07,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:07,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:07,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:39:07,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:07,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1496225836, now seen corresponding path program 1 times [2024-11-19 06:39:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:07,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676049524] [2024-11-19 06:39:07,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:07,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:07,937 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-19 06:39:07,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:07,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676049524] [2024-11-19 06:39:07,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676049524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:07,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:07,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:39:07,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108259041] [2024-11-19 06:39:07,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:07,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:39:07,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:07,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:39:07,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:39:07,942 INFO L87 Difference]: Start difference. First operand 115 states and 132 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-19 06:39:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:08,050 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2024-11-19 06:39:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:39:08,055 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-19 06:39:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:08,056 INFO L225 Difference]: With dead ends: 120 [2024-11-19 06:39:08,056 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 06:39:08,056 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-19 06:39:08,057 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 114 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:08,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 103 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 06:39:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2024-11-19 06:39:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.4615384615384615) internal successors, (133), 115 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2024-11-19 06:39:08,072 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 19 [2024-11-19 06:39:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:08,072 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2024-11-19 06:39:08,073 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-19 06:39:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2024-11-19 06:39:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:39:08,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:08,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:08,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:39:08,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:08,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1636948777, now seen corresponding path program 1 times [2024-11-19 06:39:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586869070] [2024-11-19 06:39:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:08,210 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-19 06:39:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586869070] [2024-11-19 06:39:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586869070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:39:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223879645] [2024-11-19 06:39:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:08,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:39:08,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:08,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:39:08,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:08,212 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-19 06:39:08,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:08,391 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2024-11-19 06:39:08,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:39:08,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-19 06:39:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:08,393 INFO L225 Difference]: With dead ends: 130 [2024-11-19 06:39:08,393 INFO L226 Difference]: Without dead ends: 130 [2024-11-19 06:39:08,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:08,394 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 44 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:08,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 260 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:08,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-19 06:39:08,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2024-11-19 06:39:08,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 115 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2024-11-19 06:39:08,403 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 19 [2024-11-19 06:39:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:08,403 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2024-11-19 06:39:08,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-19 06:39:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2024-11-19 06:39:08,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:39:08,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:08,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:08,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:39:08,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:08,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash 893457297, now seen corresponding path program 1 times [2024-11-19 06:39:08,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:08,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926012600] [2024-11-19 06:39:08,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:08,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:08,530 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-19 06:39:08,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:08,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926012600] [2024-11-19 06:39:08,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926012600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:08,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:08,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:39:08,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137460966] [2024-11-19 06:39:08,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:08,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:08,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:08,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:08,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:08,532 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:08,664 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2024-11-19 06:39:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:39:08,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 06:39:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:08,665 INFO L225 Difference]: With dead ends: 151 [2024-11-19 06:39:08,665 INFO L226 Difference]: Without dead ends: 143 [2024-11-19 06:39:08,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:08,666 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 49 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:08,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 211 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-19 06:39:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2024-11-19 06:39:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 120 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2024-11-19 06:39:08,675 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 22 [2024-11-19 06:39:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:08,675 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2024-11-19 06:39:08,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2024-11-19 06:39:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:39:08,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:08,676 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] [2024-11-19 06:39:08,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:39:08,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:08,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608044, now seen corresponding path program 1 times [2024-11-19 06:39:08,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:08,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610637842] [2024-11-19 06:39:08,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:08,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:08,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:08,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610637842] [2024-11-19 06:39:08,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610637842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:08,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:08,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:39:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816335280] [2024-11-19 06:39:08,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:08,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:39:08,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:08,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:39:08,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:08,806 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:08,975 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2024-11-19 06:39:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:39:08,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 06:39:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:08,977 INFO L225 Difference]: With dead ends: 123 [2024-11-19 06:39:08,977 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 06:39:08,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-19 06:39:08,978 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 40 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:08,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 196 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:08,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 06:39:08,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-11-19 06:39:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.40625) internal successors, (135), 118 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2024-11-19 06:39:08,984 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 22 [2024-11-19 06:39:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:08,984 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2024-11-19 06:39:08,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2024-11-19 06:39:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:39:08,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:08,987 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] [2024-11-19 06:39:08,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:39:08,987 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:08,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608043, now seen corresponding path program 1 times [2024-11-19 06:39:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765874441] [2024-11-19 06:39:08,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:08,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:09,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:09,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765874441] [2024-11-19 06:39:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765874441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:09,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:09,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:39:09,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659256027] [2024-11-19 06:39:09,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:09,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:39:09,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:09,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:39:09,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:09,280 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:09,453 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2024-11-19 06:39:09,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:39:09,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 06:39:09,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:09,455 INFO L225 Difference]: With dead ends: 112 [2024-11-19 06:39:09,456 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 06:39:09,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-19 06:39:09,457 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 11 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:09,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 256 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 06:39:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2024-11-19 06:39:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 101 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2024-11-19 06:39:09,461 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 22 [2024-11-19 06:39:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:09,461 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2024-11-19 06:39:09,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2024-11-19 06:39:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:39:09,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:09,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:09,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:39:09,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:09,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1076428849, now seen corresponding path program 1 times [2024-11-19 06:39:09,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:09,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037558416] [2024-11-19 06:39:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:39:09,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:09,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037558416] [2024-11-19 06:39:09,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037558416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:09,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:09,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:39:09,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86106684] [2024-11-19 06:39:09,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:09,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:39:09,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:09,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:39:09,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:39:09,842 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:09,997 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-11-19 06:39:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:39:09,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-19 06:39:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:09,999 INFO L225 Difference]: With dead ends: 109 [2024-11-19 06:39:09,999 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 06:39:09,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:39:10,000 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:10,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 239 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 06:39:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2024-11-19 06:39:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.4) internal successors, (105), 90 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2024-11-19 06:39:10,003 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 25 [2024-11-19 06:39:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:10,004 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2024-11-19 06:39:10,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2024-11-19 06:39:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:39:10,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:10,006 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] [2024-11-19 06:39:10,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:39:10,007 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:10,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2019367435, now seen corresponding path program 1 times [2024-11-19 06:39:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:10,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005614747] [2024-11-19 06:39:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:10,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:10,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005614747] [2024-11-19 06:39:10,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005614747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:10,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134825286] [2024-11-19 06:39:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:10,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:10,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:10,143 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-19 06:39:10,144 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-19 06:39:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:10,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:39:10,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:39:10,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:39:10,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134825286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:10,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:39:10,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-11-19 06:39:10,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011102761] [2024-11-19 06:39:10,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:10,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:39:10,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:10,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:39:10,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:39:10,363 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:10,509 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2024-11-19 06:39:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:39:10,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 06:39:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:10,510 INFO L225 Difference]: With dead ends: 110 [2024-11-19 06:39:10,510 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 06:39:10,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:39:10,511 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 16 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:10,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 332 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 06:39:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2024-11-19 06:39:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 97 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-11-19 06:39:10,514 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 30 [2024-11-19 06:39:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:10,514 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-11-19 06:39:10,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-11-19 06:39:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:39:10,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:10,515 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] [2024-11-19 06:39:10,533 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-19 06:39:10,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 06:39:10,717 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:10,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:10,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1318302857, now seen corresponding path program 1 times [2024-11-19 06:39:10,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:10,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14715339] [2024-11-19 06:39:10,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:10,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:10,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:10,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14715339] [2024-11-19 06:39:10,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14715339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:10,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008949704] [2024-11-19 06:39:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:10,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:10,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:10,825 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-19 06:39:10,837 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-19 06:39:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:10,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:39:10,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:11,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:11,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008949704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:11,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:11,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-11-19 06:39:11,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135133144] [2024-11-19 06:39:11,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:11,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:39:11,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:11,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:39:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:39:11,043 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:11,174 INFO L93 Difference]: Finished difference Result 230 states and 270 transitions. [2024-11-19 06:39:11,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:39:11,175 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 06:39:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:11,176 INFO L225 Difference]: With dead ends: 230 [2024-11-19 06:39:11,176 INFO L226 Difference]: Without dead ends: 230 [2024-11-19 06:39:11,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:39:11,177 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 116 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:11,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 511 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-19 06:39:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 139. [2024-11-19 06:39:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 123 states have (on average 1.2926829268292683) internal successors, (159), 138 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2024-11-19 06:39:11,186 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 30 [2024-11-19 06:39:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:11,188 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2024-11-19 06:39:11,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2024-11-19 06:39:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:39:11,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:11,190 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] [2024-11-19 06:39:11,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:39:11,391 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,SelfDestructingSolverStorable12 [2024-11-19 06:39:11,392 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:11,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash 864219972, now seen corresponding path program 1 times [2024-11-19 06:39:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:11,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616838098] [2024-11-19 06:39:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:11,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616838098] [2024-11-19 06:39:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616838098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805339605] [2024-11-19 06:39:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:11,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:11,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:11,724 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-19 06:39:11,726 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-19 06:39:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:11,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 06:39:11,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:11,891 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-19 06:39:11,943 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:11,943 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-19 06:39:11,973 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 19 treesize of output 1 [2024-11-19 06:39:11,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:11,979 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-19 06:39:11,991 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 20 treesize of output 8 [2024-11-19 06:39:12,018 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-19 06:39:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:12,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:12,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:12,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-19 06:39:12,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:12,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2024-11-19 06:39:12,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-19 06:39:12,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:12,384 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 34 treesize of output 74 [2024-11-19 06:39:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:12,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805339605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:12,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:12,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2024-11-19 06:39:12,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111957679] [2024-11-19 06:39:12,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:12,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 06:39:12,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:12,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 06:39:12,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=231, Unknown=22, NotChecked=0, Total=306 [2024-11-19 06:39:12,489 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:13,000 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2024-11-19 06:39:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:39:13,001 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 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-19 06:39:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:13,002 INFO L225 Difference]: With dead ends: 233 [2024-11-19 06:39:13,002 INFO L226 Difference]: Without dead ends: 233 [2024-11-19 06:39:13,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=381, Unknown=23, NotChecked=0, Total=506 [2024-11-19 06:39:13,003 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 186 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:13,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 520 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:39:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-19 06:39:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 155. [2024-11-19 06:39:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 154 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2024-11-19 06:39:13,007 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 32 [2024-11-19 06:39:13,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:13,007 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2024-11-19 06:39:13,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2024-11-19 06:39:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:39:13,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:13,008 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] [2024-11-19 06:39:13,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:39:13,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:13,209 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:13,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:13,210 INFO L85 PathProgramCache]: Analyzing trace with hash 864210937, now seen corresponding path program 1 times [2024-11-19 06:39:13,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:13,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181615124] [2024-11-19 06:39:13,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:13,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:13,708 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-19 06:39:13,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:13,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181615124] [2024-11-19 06:39:13,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181615124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:13,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925182049] [2024-11-19 06:39:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:13,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:13,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:13,711 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-19 06:39:13,713 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-19 06:39:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:13,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 06:39:13,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:13,909 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:13,910 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-19 06:39:13,937 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 19 treesize of output 1 [2024-11-19 06:39:14,015 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:39:14,016 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 42 treesize of output 41 [2024-11-19 06:39:14,082 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 31 treesize of output 13 [2024-11-19 06:39:14,087 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-19 06:39:14,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:14,146 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 06:39:14,146 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 21 treesize of output 20 [2024-11-19 06:39:14,151 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-19 06:39:14,202 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2024-11-19 06:39:14,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:14,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-19 06:39:14,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:14,224 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 36 treesize of output 35 [2024-11-19 06:39:14,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:39:14,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:14,351 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 28 treesize of output 46 [2024-11-19 06:39:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 06:39:14,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925182049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:14,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:14,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-11-19 06:39:14,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745105973] [2024-11-19 06:39:14,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:14,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 06:39:14,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:14,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 06:39:14,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=5, NotChecked=94, Total=702 [2024-11-19 06:39:14,377 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 27 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-19 06:39:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:15,114 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2024-11-19 06:39:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:39:15,115 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 27 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-19 06:39:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:15,116 INFO L225 Difference]: With dead ends: 220 [2024-11-19 06:39:15,116 INFO L226 Difference]: Without dead ends: 220 [2024-11-19 06:39:15,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=1005, Unknown=5, NotChecked=134, Total=1332 [2024-11-19 06:39:15,117 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 382 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:15,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 540 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 784 Invalid, 0 Unknown, 389 Unchecked, 0.5s Time] [2024-11-19 06:39:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-19 06:39:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 168. [2024-11-19 06:39:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 152 states have (on average 1.2894736842105263) internal successors, (196), 167 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 196 transitions. [2024-11-19 06:39:15,124 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 196 transitions. Word has length 32 [2024-11-19 06:39:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:15,124 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 196 transitions. [2024-11-19 06:39:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 27 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-19 06:39:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2024-11-19 06:39:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:39:15,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:15,126 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] [2024-11-19 06:39:15,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:39:15,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 06:39:15,327 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:15,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:15,328 INFO L85 PathProgramCache]: Analyzing trace with hash 864210938, now seen corresponding path program 1 times [2024-11-19 06:39:15,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551784944] [2024-11-19 06:39:15,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:15,732 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-19 06:39:15,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:15,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551784944] [2024-11-19 06:39:15,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551784944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:15,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962641257] [2024-11-19 06:39:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:15,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:15,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:15,735 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-19 06:39:15,750 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-19 06:39:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:15,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 06:39:15,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:15,918 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:15,918 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-19 06:39:15,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:39:15,974 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 19 treesize of output 1 [2024-11-19 06:39:15,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:39:16,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:39:16,109 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 62 treesize of output 57 [2024-11-19 06:39:16,116 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 30 treesize of output 13 [2024-11-19 06:39:16,212 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 31 treesize of output 13 [2024-11-19 06:39:16,215 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 9 treesize of output 3 [2024-11-19 06:39:16,253 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-19 06:39:16,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:16,393 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-11-19 06:39:16,432 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2024-11-19 06:39:16,444 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_503) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_504 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_504) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2024-11-19 06:39:16,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:16,452 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 45 treesize of output 46 [2024-11-19 06:39:16,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:16,459 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 35 treesize of output 36 [2024-11-19 06:39:16,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:16,470 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 62 treesize of output 61 [2024-11-19 06:39:16,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:16,484 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 96 treesize of output 89 [2024-11-19 06:39:16,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 06:39:16,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:39:16,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:16,520 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 22 treesize of output 23 [2024-11-19 06:39:16,522 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:39:16,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:16,525 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 06:39:16,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:16,687 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 34 treesize of output 74 [2024-11-19 06:39:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 06:39:16,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962641257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:16,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:16,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-19 06:39:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783976410] [2024-11-19 06:39:16,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:16,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 06:39:16,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:16,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 06:39:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=565, Unknown=3, NotChecked=150, Total=812 [2024-11-19 06:39:16,732 INFO L87 Difference]: Start difference. First operand 168 states and 196 transitions. Second operand has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:17,587 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2024-11-19 06:39:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 06:39:17,588 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 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-19 06:39:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:17,589 INFO L225 Difference]: With dead ends: 227 [2024-11-19 06:39:17,589 INFO L226 Difference]: Without dead ends: 227 [2024-11-19 06:39:17,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=1207, Unknown=3, NotChecked=222, Total=1640 [2024-11-19 06:39:17,590 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 338 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:17,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 854 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 855 Invalid, 0 Unknown, 536 Unchecked, 0.5s Time] [2024-11-19 06:39:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-19 06:39:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 163. [2024-11-19 06:39:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 162 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2024-11-19 06:39:17,595 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 32 [2024-11-19 06:39:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:17,595 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2024-11-19 06:39:17,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2024-11-19 06:39:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:39:17,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:17,596 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] [2024-11-19 06:39:17,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:39:17,796 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,SelfDestructingSolverStorable15 [2024-11-19 06:39:17,797 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:17,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash 568395342, now seen corresponding path program 1 times [2024-11-19 06:39:17,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:17,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260412354] [2024-11-19 06:39:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:18,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:18,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260412354] [2024-11-19 06:39:18,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260412354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:18,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407651048] [2024-11-19 06:39:18,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:18,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:18,272 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-19 06:39:18,274 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-19 06:39:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:18,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 06:39:18,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:18,407 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 1 [2024-11-19 06:39:18,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:18,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 06:39:18,503 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:18,503 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-19 06:39:18,541 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 19 treesize of output 1 [2024-11-19 06:39:18,546 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 29 treesize of output 13 [2024-11-19 06:39:18,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-19 06:39:18,611 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 18 treesize of output 13 [2024-11-19 06:39:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:18,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:18,688 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2024-11-19 06:39:18,692 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_580) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2024-11-19 06:39:21,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:21,217 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 3 case distinctions, treesize of input 30 treesize of output 41 [2024-11-19 06:39:21,226 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 06:39:21,226 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 36 treesize of output 31 [2024-11-19 06:39:21,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:39:21,238 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:39:21,239 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 13 treesize of output 12 [2024-11-19 06:39:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:21,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407651048] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:21,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 33 [2024-11-19 06:39:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148169926] [2024-11-19 06:39:21,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:21,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 06:39:21,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:21,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 06:39:21,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=774, Unknown=16, NotChecked=118, Total=1056 [2024-11-19 06:39:21,261 INFO L87 Difference]: Start difference. First operand 163 states and 190 transitions. Second operand has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:21,907 INFO L93 Difference]: Finished difference Result 236 states and 277 transitions. [2024-11-19 06:39:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:39:21,908 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 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-19 06:39:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:21,909 INFO L225 Difference]: With dead ends: 236 [2024-11-19 06:39:21,909 INFO L226 Difference]: Without dead ends: 236 [2024-11-19 06:39:21,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=221, Invalid=961, Unknown=16, NotChecked=134, Total=1332 [2024-11-19 06:39:21,910 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 210 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:21,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 784 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 850 Invalid, 0 Unknown, 322 Unchecked, 0.5s Time] [2024-11-19 06:39:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-19 06:39:21,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 163. [2024-11-19 06:39:21,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 150 states have (on average 1.26) internal successors, (189), 162 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:21,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 189 transitions. [2024-11-19 06:39:21,914 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 189 transitions. Word has length 32 [2024-11-19 06:39:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:21,914 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 189 transitions. [2024-11-19 06:39:21,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 189 transitions. [2024-11-19 06:39:21,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:39:21,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:21,916 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] [2024-11-19 06:39:21,932 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-19 06:39:22,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 06:39:22,116 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:22,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:22,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1851586532, now seen corresponding path program 1 times [2024-11-19 06:39:22,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:22,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22732624] [2024-11-19 06:39:22,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:22,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:22,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:22,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22732624] [2024-11-19 06:39:22,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22732624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:22,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453224211] [2024-11-19 06:39:22,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:22,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:22,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:22,654 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-19 06:39:22,656 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-19 06:39:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:22,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 06:39:22,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:22,789 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 1 [2024-11-19 06:39:22,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:22,866 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 14 [2024-11-19 06:39:22,882 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:22,883 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-19 06:39:22,918 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 19 treesize of output 1 [2024-11-19 06:39:22,922 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 30 treesize of output 14 [2024-11-19 06:39:22,951 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 20 treesize of output 8 [2024-11-19 06:39:22,994 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 19 treesize of output 14 [2024-11-19 06:39:23,031 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 20 treesize of output 8 [2024-11-19 06:39:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:23,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:23,057 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2024-11-19 06:39:23,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:23,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2024-11-19 06:39:23,371 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 06:39:23,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2024-11-19 06:39:23,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-19 06:39:23,384 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:39:23,385 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 13 treesize of output 12 [2024-11-19 06:39:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 06:39:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453224211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:23,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 33 [2024-11-19 06:39:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918987911] [2024-11-19 06:39:23,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:23,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 06:39:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:23,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 06:39:23,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=833, Unknown=11, NotChecked=60, Total=1056 [2024-11-19 06:39:23,410 INFO L87 Difference]: Start difference. First operand 163 states and 189 transitions. Second operand has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:24,254 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2024-11-19 06:39:24,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:39:24,258 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 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-19 06:39:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:24,259 INFO L225 Difference]: With dead ends: 246 [2024-11-19 06:39:24,259 INFO L226 Difference]: Without dead ends: 246 [2024-11-19 06:39:24,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=1027, Unknown=11, NotChecked=68, Total=1332 [2024-11-19 06:39:24,260 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 247 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:24,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1064 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1197 Invalid, 0 Unknown, 167 Unchecked, 0.7s Time] [2024-11-19 06:39:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-19 06:39:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 181. [2024-11-19 06:39:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 168 states have (on average 1.2380952380952381) internal successors, (208), 180 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2024-11-19 06:39:24,267 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 32 [2024-11-19 06:39:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:24,267 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2024-11-19 06:39:24,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2024-11-19 06:39:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:39:24,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:24,268 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] [2024-11-19 06:39:24,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:39:24,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:24,473 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:24,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:24,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1555761902, now seen corresponding path program 1 times [2024-11-19 06:39:24,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:24,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127960566] [2024-11-19 06:39:24,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:24,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:24,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:24,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127960566] [2024-11-19 06:39:24,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127960566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:24,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905376941] [2024-11-19 06:39:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:24,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:24,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:24,754 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-19 06:39:24,755 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-19 06:39:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:24,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 06:39:24,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:24,907 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-19 06:39:24,921 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:24,922 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-19 06:39:24,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:24,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 06:39:24,953 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 19 treesize of output 1 [2024-11-19 06:39:24,960 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 20 treesize of output 8 [2024-11-19 06:39:24,979 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-19 06:39:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:24,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:25,028 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_731 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-11-19 06:39:25,033 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_731 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_731) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-11-19 06:39:25,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:25,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-19 06:39:25,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:25,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2024-11-19 06:39:25,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-19 06:39:25,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:25,240 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 34 treesize of output 74 [2024-11-19 06:39:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905376941] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:25,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2024-11-19 06:39:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932282660] [2024-11-19 06:39:25,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:25,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 06:39:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 06:39:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=187, Unknown=10, NotChecked=58, Total=306 [2024-11-19 06:39:25,365 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:25,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:25,843 INFO L93 Difference]: Finished difference Result 255 states and 294 transitions. [2024-11-19 06:39:25,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:39:25,843 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 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-19 06:39:25,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:25,844 INFO L225 Difference]: With dead ends: 255 [2024-11-19 06:39:25,844 INFO L226 Difference]: Without dead ends: 255 [2024-11-19 06:39:25,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=319, Unknown=10, NotChecked=78, Total=506 [2024-11-19 06:39:25,845 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 102 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:25,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 889 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 802 Invalid, 0 Unknown, 288 Unchecked, 0.4s Time] [2024-11-19 06:39:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-19 06:39:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 181. [2024-11-19 06:39:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 168 states have (on average 1.2321428571428572) internal successors, (207), 180 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 207 transitions. [2024-11-19 06:39:25,852 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 207 transitions. Word has length 32 [2024-11-19 06:39:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:25,852 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 207 transitions. [2024-11-19 06:39:25,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 207 transitions. [2024-11-19 06:39:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 06:39:25,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:25,853 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] [2024-11-19 06:39:25,871 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-19 06:39:26,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:26,058 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:26,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:26,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1554334102, now seen corresponding path program 1 times [2024-11-19 06:39:26,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:26,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397428781] [2024-11-19 06:39:26,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:26,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:26,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397428781] [2024-11-19 06:39:26,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397428781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:26,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390400882] [2024-11-19 06:39:26,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:26,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:26,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:26,333 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-19 06:39:26,334 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-19 06:39:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:26,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 06:39:26,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:26,512 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-19 06:39:26,540 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:26,540 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-19 06:39:26,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:26,579 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-19 06:39:26,585 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 19 treesize of output 1 [2024-11-19 06:39:26,611 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 20 treesize of output 8 [2024-11-19 06:39:26,652 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-19 06:39:26,688 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-19 06:39:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:26,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:26,746 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array Int Int))) (< (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2024-11-19 06:39:26,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:26,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2024-11-19 06:39:26,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:26,904 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 29 treesize of output 32 [2024-11-19 06:39:26,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-19 06:39:27,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:27,014 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 34 treesize of output 74 [2024-11-19 06:39:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 06:39:27,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390400882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:27,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:27,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2024-11-19 06:39:27,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458495558] [2024-11-19 06:39:27,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:27,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:39:27,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:27,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:39:27,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=482, Unknown=21, NotChecked=46, Total=650 [2024-11-19 06:39:27,069 INFO L87 Difference]: Start difference. First operand 181 states and 207 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:27,706 INFO L93 Difference]: Finished difference Result 284 states and 327 transitions. [2024-11-19 06:39:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 06:39:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-19 06:39:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:27,708 INFO L225 Difference]: With dead ends: 284 [2024-11-19 06:39:27,708 INFO L226 Difference]: Without dead ends: 284 [2024-11-19 06:39:27,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=1070, Unknown=24, NotChecked=70, Total=1406 [2024-11-19 06:39:27,709 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 220 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:27,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 748 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 706 Invalid, 0 Unknown, 217 Unchecked, 0.4s Time] [2024-11-19 06:39:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-19 06:39:27,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 181. [2024-11-19 06:39:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 168 states have (on average 1.2202380952380953) internal successors, (205), 180 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2024-11-19 06:39:27,714 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 35 [2024-11-19 06:39:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:27,714 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2024-11-19 06:39:27,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2024-11-19 06:39:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 06:39:27,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:27,715 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, 1] [2024-11-19 06:39:27,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:39:27,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:27,920 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:27,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:27,920 INFO L85 PathProgramCache]: Analyzing trace with hash 181894197, now seen corresponding path program 1 times [2024-11-19 06:39:27,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082546193] [2024-11-19 06:39:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:27,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:39:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:28,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082546193] [2024-11-19 06:39:28,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082546193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:28,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799689029] [2024-11-19 06:39:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:28,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:28,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:28,058 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-19 06:39:28,059 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-19 06:39:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:28,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:39:28,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:28,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799689029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:28,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-11-19 06:39:28,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815486000] [2024-11-19 06:39:28,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:28,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 06:39:28,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:28,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 06:39:28,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-19 06:39:28,390 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:28,596 INFO L93 Difference]: Finished difference Result 302 states and 351 transitions. [2024-11-19 06:39:28,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 06:39:28,596 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-19 06:39:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:28,597 INFO L225 Difference]: With dead ends: 302 [2024-11-19 06:39:28,598 INFO L226 Difference]: Without dead ends: 302 [2024-11-19 06:39:28,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-11-19 06:39:28,599 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 229 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:28,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 465 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-19 06:39:28,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2024-11-19 06:39:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 234 states have (on average 1.2991452991452992) internal successors, (304), 246 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 304 transitions. [2024-11-19 06:39:28,605 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 304 transitions. Word has length 38 [2024-11-19 06:39:28,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:28,605 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 304 transitions. [2024-11-19 06:39:28,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 304 transitions. [2024-11-19 06:39:28,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:39:28,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:28,606 INFO L215 NwaCegarLoop]: trace histogram [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-19 06:39:28,623 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-19 06:39:28,806 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,SelfDestructingSolverStorable20 [2024-11-19 06:39:28,807 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:28,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1142228604, now seen corresponding path program 1 times [2024-11-19 06:39:28,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:28,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83230741] [2024-11-19 06:39:28,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:28,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:29,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:29,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83230741] [2024-11-19 06:39:29,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83230741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:29,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656082577] [2024-11-19 06:39:29,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:29,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:29,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:29,242 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-19 06:39:29,243 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-19 06:39:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:29,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 06:39:29,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:29,426 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:29,427 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-19 06:39:29,467 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 1 [2024-11-19 06:39:29,470 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 19 treesize of output 1 [2024-11-19 06:39:29,577 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:39:29,577 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 80 treesize of output 73 [2024-11-19 06:39:29,581 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 29 treesize of output 19 [2024-11-19 06:39:29,584 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 49 treesize of output 30 [2024-11-19 06:39:29,673 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 39 treesize of output 21 [2024-11-19 06:39:29,676 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 32 treesize of output 14 [2024-11-19 06:39:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:29,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:30,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2024-11-19 06:39:30,053 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (forall ((v_ArrVal_948 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)))) (and (or (< |c_ULTIMATE.start_main_~p~0#1.offset| 1) .cse0) (or .cse0 (forall ((v_ArrVal_950 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_ArrVal_948 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (< .cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 1)) (< .cse2 0))))))) is different from false [2024-11-19 06:39:30,120 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (forall ((v_ArrVal_948 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 0)))) (and (or (forall ((v_ArrVal_950 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem10#1.base|)) .cse1) (forall ((v_ArrVal_948 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_948) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (or (< .cse2 (+ |c_ULTIMATE.start_main_#t~mem10#1.offset| 1)) (< .cse2 0)))) (or .cse1 (< |c_ULTIMATE.start_main_#t~mem10#1.offset| 1))))) is different from false [2024-11-19 06:39:30,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5)) (.cse2 (forall ((v_ArrVal_948 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_948) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 0)))) (and (or (forall ((v_ArrVal_950 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_950) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) .cse2) (forall ((v_ArrVal_948 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_948) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (< .cse3 0) (< .cse3 (+ .cse4 1))))) (or (< .cse4 1) .cse2))))) is different from false [2024-11-19 06:39:30,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:30,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 22 treesize of output 23 [2024-11-19 06:39:30,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:30,164 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 36 treesize of output 35 [2024-11-19 06:39:30,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-19 06:39:30,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:30,183 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 22 treesize of output 23 [2024-11-19 06:39:30,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:30,195 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 36 treesize of output 35 [2024-11-19 06:39:30,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:39:30,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:30,213 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 22 treesize of output 23 [2024-11-19 06:39:30,215 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:39:30,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:30,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:39:30,219 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-19 06:39:30,227 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-19 06:39:30,228 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 47 treesize of output 1 [2024-11-19 06:39:30,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:30,353 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 28 treesize of output 46 [2024-11-19 06:39:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 06:39:30,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656082577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:30,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:30,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2024-11-19 06:39:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545853694] [2024-11-19 06:39:30,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:30,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 06:39:30,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 06:39:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=787, Unknown=3, NotChecked=174, Total=1056 [2024-11-19 06:39:30,380 INFO L87 Difference]: Start difference. First operand 247 states and 304 transitions. Second operand has 33 states, 33 states have (on average 2.878787878787879) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:31,267 INFO L93 Difference]: Finished difference Result 266 states and 324 transitions. [2024-11-19 06:39:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:39:31,269 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.878787878787879) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-19 06:39:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:31,270 INFO L225 Difference]: With dead ends: 266 [2024-11-19 06:39:31,270 INFO L226 Difference]: Without dead ends: 266 [2024-11-19 06:39:31,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=1448, Unknown=3, NotChecked=240, Total=1892 [2024-11-19 06:39:31,271 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 243 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 406 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:31,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 966 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 934 Invalid, 0 Unknown, 406 Unchecked, 0.5s Time] [2024-11-19 06:39:31,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-19 06:39:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 249. [2024-11-19 06:39:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 236 states have (on average 1.2966101694915255) internal successors, (306), 248 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 306 transitions. [2024-11-19 06:39:31,276 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 306 transitions. Word has length 40 [2024-11-19 06:39:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:31,276 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 306 transitions. [2024-11-19 06:39:31,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.878787878787879) internal successors, (95), 33 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 306 transitions. [2024-11-19 06:39:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 06:39:31,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:31,277 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, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:31,294 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-19 06:39:31,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 06:39:31,477 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:31,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:31,478 INFO L85 PathProgramCache]: Analyzing trace with hash 504664918, now seen corresponding path program 1 times [2024-11-19 06:39:31,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:31,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121567191] [2024-11-19 06:39:31,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:31,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:31,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:31,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121567191] [2024-11-19 06:39:31,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121567191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:31,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342975258] [2024-11-19 06:39:31,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:31,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:31,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:31,772 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-19 06:39:31,773 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-19 06:39:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:31,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 06:39:31,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:32,001 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:32,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:39:32,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:39:32,113 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:39:32,113 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 33 treesize of output 32 [2024-11-19 06:39:32,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:32,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2024-11-19 06:39:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:32,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:32,346 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1024 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2024-11-19 06:39:32,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1024 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2024-11-19 06:39:32,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:32,398 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 21 treesize of output 22 [2024-11-19 06:39:32,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:32,404 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 35 treesize of output 36 [2024-11-19 06:39:32,406 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 20 treesize of output 18 [2024-11-19 06:39:32,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:32,583 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 44 treesize of output 84 [2024-11-19 06:39:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2024-11-19 06:39:32,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342975258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:32,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:32,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 13] total 34 [2024-11-19 06:39:32,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902425462] [2024-11-19 06:39:32,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:32,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-19 06:39:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:32,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-19 06:39:32,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=856, Unknown=10, NotChecked=122, Total=1122 [2024-11-19 06:39:32,693 INFO L87 Difference]: Start difference. First operand 249 states and 306 transitions. Second operand has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 34 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:33,123 INFO L93 Difference]: Finished difference Result 269 states and 326 transitions. [2024-11-19 06:39:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:39:33,123 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 34 states have internal predecessors, (113), 0 states have call successors, (0), 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-19 06:39:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:33,125 INFO L225 Difference]: With dead ends: 269 [2024-11-19 06:39:33,125 INFO L226 Difference]: Without dead ends: 269 [2024-11-19 06:39:33,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=1139, Unknown=10, NotChecked=142, Total=1482 [2024-11-19 06:39:33,126 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 241 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:33,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 709 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 803 Invalid, 0 Unknown, 277 Unchecked, 0.3s Time] [2024-11-19 06:39:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-19 06:39:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 254. [2024-11-19 06:39:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 241 states have (on average 1.2904564315352698) internal successors, (311), 253 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 311 transitions. [2024-11-19 06:39:33,130 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 311 transitions. Word has length 43 [2024-11-19 06:39:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:33,131 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 311 transitions. [2024-11-19 06:39:33,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 34 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 311 transitions. [2024-11-19 06:39:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:39:33,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:33,132 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:39:33,151 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-19 06:39:33,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 06:39:33,334 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:33,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:33,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1985636438, now seen corresponding path program 1 times [2024-11-19 06:39:33,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696908477] [2024-11-19 06:39:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:39:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:39:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 06:39:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:33,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696908477] [2024-11-19 06:39:33,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696908477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:39:33,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:39:33,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:39:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071076616] [2024-11-19 06:39:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:39:33,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:39:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:33,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:39:33,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:39:33,414 INFO L87 Difference]: Start difference. First operand 254 states and 311 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:33,510 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2024-11-19 06:39:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:39:33,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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-19 06:39:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:33,511 INFO L225 Difference]: With dead ends: 252 [2024-11-19 06:39:33,511 INFO L226 Difference]: Without dead ends: 252 [2024-11-19 06:39:33,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:39:33,512 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:33,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 193 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:39:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-19 06:39:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-19 06:39:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 239 states have (on average 1.288702928870293) internal successors, (308), 251 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 308 transitions. [2024-11-19 06:39:33,516 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 308 transitions. Word has length 45 [2024-11-19 06:39:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:33,516 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 308 transitions. [2024-11-19 06:39:33,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 308 transitions. [2024-11-19 06:39:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:39:33,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:33,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2024-11-19 06:39:33,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 06:39:33,517 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:33,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:33,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1853693705, now seen corresponding path program 2 times [2024-11-19 06:39:33,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:33,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332506033] [2024-11-19 06:39:33,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:39:33,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:33,543 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:39:33,543 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:39:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:34,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:34,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332506033] [2024-11-19 06:39:34,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332506033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:34,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358255821] [2024-11-19 06:39:34,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:39:34,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:34,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:34,018 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-19 06:39:34,019 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-19 06:39:34,141 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:39:34,141 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:39:34,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-19 06:39:34,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:34,223 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-19 06:39:34,253 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:34,254 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-19 06:39:34,288 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-19 06:39:34,299 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-19 06:39:34,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 06:39:34,383 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-19 06:39:34,404 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-19 06:39:34,416 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:39:34,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:39:34,448 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-19 06:39:34,453 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 19 treesize of output 1 [2024-11-19 06:39:34,476 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 20 treesize of output 8 [2024-11-19 06:39:34,541 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-19 06:39:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:34,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:39:38,087 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1176) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1179) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2024-11-19 06:39:38,351 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_33| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_33|) 0)) (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1176) |v_ULTIMATE.start_main_~t~0#1.base_33| v_ArrVal_1179) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-19 06:39:38,633 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:39:38,633 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 13 treesize of output 12 [2024-11-19 06:39:47,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:47,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2024-11-19 06:39:47,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:47,675 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 60 treesize of output 63 [2024-11-19 06:39:47,685 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 48 treesize of output 44 [2024-11-19 06:39:47,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-19 06:39:48,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:39:48,055 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 34 treesize of output 74 [2024-11-19 06:39:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-19 06:39:48,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358255821] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:39:48,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:39:48,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 41 [2024-11-19 06:39:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143644] [2024-11-19 06:39:48,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:39:48,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-19 06:39:48,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:39:48,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-19 06:39:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1231, Unknown=52, NotChecked=150, Total=1640 [2024-11-19 06:39:48,258 INFO L87 Difference]: Start difference. First operand 252 states and 308 transitions. Second operand has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:39:58,395 INFO L93 Difference]: Finished difference Result 435 states and 530 transitions. [2024-11-19 06:39:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 06:39:58,395 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 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-19 06:39:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:39:58,397 INFO L225 Difference]: With dead ends: 435 [2024-11-19 06:39:58,397 INFO L226 Difference]: Without dead ends: 435 [2024-11-19 06:39:58,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=342, Invalid=1867, Unknown=55, NotChecked=186, Total=2450 [2024-11-19 06:39:58,399 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 327 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:39:58,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 774 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 872 Invalid, 0 Unknown, 343 Unchecked, 1.8s Time] [2024-11-19 06:39:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-19 06:39:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 318. [2024-11-19 06:39:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 305 states have (on average 1.2688524590163934) internal successors, (387), 317 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 387 transitions. [2024-11-19 06:39:58,404 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 387 transitions. Word has length 45 [2024-11-19 06:39:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:39:58,405 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 387 transitions. [2024-11-19 06:39:58,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:39:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 387 transitions. [2024-11-19 06:39:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:39:58,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:39:58,406 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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] [2024-11-19 06:39:58,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-19 06:39:58,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 06:39:58,610 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2024-11-19 06:39:58,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:39:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1853684670, now seen corresponding path program 2 times [2024-11-19 06:39:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:39:58,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88339175] [2024-11-19 06:39:58,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:39:58,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:39:58,642 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:39:58,642 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:39:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:39:59,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:39:59,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88339175] [2024-11-19 06:39:59,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88339175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:39:59,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354688207] [2024-11-19 06:39:59,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:39:59,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:39:59,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:39:59,619 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:39:59,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 06:39:59,770 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:39:59,771 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:39:59,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-19 06:39:59,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:39:59,985 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:39:59,985 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-19 06:40:00,091 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-19 06:40:00,376 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 06:40:00,376 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 33 treesize of output 24 [2024-11-19 06:40:00,462 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 06:40:00,462 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 33 treesize of output 24 [2024-11-19 06:40:00,544 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-19 06:40:00,545 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-19 06:40:00,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 06:40:00,699 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 06:40:00,700 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 33 treesize of output 24 [2024-11-19 06:40:00,798 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 13 treesize of output 3 [2024-11-19 06:40:01,002 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-19 06:40:01,031 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:40:01,031 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 26 treesize of output 23 [2024-11-19 06:40:01,039 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 14 treesize of output 10 [2024-11-19 06:40:01,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:40:01,426 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 51 treesize of output 47 [2024-11-19 06:40:01,588 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-19 06:40:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:40:01,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:40:02,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-19 06:40:02,488 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1298 (Array Int Int)) (v_ArrVal_1294 (Array Int Int)) (v_subst_1 Int)) (or (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1294) v_subst_1 v_ArrVal_1298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) 1) (= |c_ULTIMATE.start_main_~a~0#1.base| v_subst_1))) (or (forall ((v_ArrVal_1298 (Array Int Int)) (v_subst_2 Int) (v_ArrVal_1294 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1294) v_subst_2 v_ArrVal_1298) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) 1)) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2024-11-19 06:40:03,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:40:03,425 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 30 treesize of output 31 [2024-11-19 06:40:03,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:40:03,446 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 180 treesize of output 173 [2024-11-19 06:40:03,455 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 35 treesize of output 31 [2024-11-19 06:40:03,462 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 38 treesize of output 30 [2024-11-19 06:40:03,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:40:03,873 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 30 treesize of output 31 [2024-11-19 06:40:03,876 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:40:03,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:40:03,889 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 46 treesize of output 45 [2024-11-19 06:40:03,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12