./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 07:41:16,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:41:16,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:41:16,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:41:16,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:41:16,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:41:16,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:41:16,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:41:16,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:41:16,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:41:16,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:41:16,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:41:16,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:41:16,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:41:16,857 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:41:16,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:41:16,857 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:41:16,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:41:16,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:41:16,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:41:16,859 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:41:16,859 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:41:16,860 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:41:16,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:41:16,860 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:41:16,860 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:41:16,861 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:41:16,861 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:41:16,861 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:41:16,862 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:41:16,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:41:16,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:41:16,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:41:16,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:41:16,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:41:16,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:41:16,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:41:16,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:41:16,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:41:16,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:41:16,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:41:16,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:41:16,865 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-09 07:41:17,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:41:17,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:41:17,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:41:17,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:41:17,234 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:41:17,235 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-09 07:41:18,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:41:18,874 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:41:18,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2024-11-09 07:41:18,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811f139bb/9b2dda3486fd41d3beac7bce6218833e/FLAG266320f73 [2024-11-09 07:41:19,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/811f139bb/9b2dda3486fd41d3beac7bce6218833e [2024-11-09 07:41:19,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:41:19,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:41:19,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:41:19,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:41:19,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:41:19,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0d678c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19, skipping insertion in model container [2024-11-09 07:41:19,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:41:19,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:41:19,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:41:19,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:41:19,599 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:41:19,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19 WrapperNode [2024-11-09 07:41:19,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:41:19,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:41:19,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:41:19,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:41:19,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,642 INFO L138 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2024-11-09 07:41:19,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:41:19,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:41:19,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:41:19,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:41:19,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,665 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-09 07:41:19,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:41:19,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:41:19,692 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:41:19,692 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:41:19,693 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (1/1) ... [2024-11-09 07:41:19,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:41:19,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:19,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:41:19,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:41:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 07:41:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 07:41:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:41:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:41:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:41:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:41:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:41:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:41:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:41:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:41:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:41:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:41:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:41:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:41:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:41:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:41:19,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:41:19,949 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:41:19,951 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:41:19,997 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 07:41:20,295 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-09 07:41:20,295 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:41:20,316 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:41:20,316 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:41:20,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:41:20 BoogieIcfgContainer [2024-11-09 07:41:20,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:41:20,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:41:20,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:41:20,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:41:20,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:41:19" (1/3) ... [2024-11-09 07:41:20,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74679788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:41:20, skipping insertion in model container [2024-11-09 07:41:20,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:41:19" (2/3) ... [2024-11-09 07:41:20,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74679788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:41:20, skipping insertion in model container [2024-11-09 07:41:20,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:41:20" (3/3) ... [2024-11-09 07:41:20,327 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_flag.i [2024-11-09 07:41:20,340 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:41:20,340 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2024-11-09 07:41:20,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:41:20,388 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;@2ebc4ba1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:41:20,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2024-11-09 07:41:20,393 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-09 07:41:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:41:20,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:20,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:41:20,405 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-09 07:41:20,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-09 07:41:20,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:20,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209690797] [2024-11-09 07:41:20,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:20,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:20,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209690797] [2024-11-09 07:41:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209690797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:20,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:20,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:41:20,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977383041] [2024-11-09 07:41:20,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:20,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:41:20,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:20,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:41:20,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:41:20,688 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-09 07:41:20,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:20,784 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2024-11-09 07:41:20,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:20,786 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-09 07:41:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:20,792 INFO L225 Difference]: With dead ends: 105 [2024-11-09 07:41:20,792 INFO L226 Difference]: Without dead ends: 98 [2024-11-09 07:41:20,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:41:20,797 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-09 07:41:20,797 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-09 07:41:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-09 07:41:20,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-09 07:41:20,827 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-09 07:41:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2024-11-09 07:41:20,829 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 4 [2024-11-09 07:41:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:20,830 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2024-11-09 07:41:20,831 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-09 07:41:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2024-11-09 07:41:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:41:20,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:20,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:41:20,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:41:20,832 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-09 07:41:20,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:20,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-09 07:41:20,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:20,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601661350] [2024-11-09 07:41:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:20,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:20,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:20,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601661350] [2024-11-09 07:41:20,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601661350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:20,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:20,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:41:20,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712485732] [2024-11-09 07:41:20,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:20,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:41:20,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:20,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:41:20,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:41:20,896 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-09 07:41:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:20,944 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2024-11-09 07:41:20,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:41:20,945 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-09 07:41:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:20,946 INFO L225 Difference]: With dead ends: 97 [2024-11-09 07:41:20,946 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 07:41:20,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:41:20,947 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 65 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:20,947 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.0s Time] [2024-11-09 07:41:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 07:41:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 07:41:20,952 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-09 07:41:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2024-11-09 07:41:20,953 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 4 [2024-11-09 07:41:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:20,954 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2024-11-09 07:41:20,954 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-09 07:41:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2024-11-09 07:41:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:41:20,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:20,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:20,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:41:20,955 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-09 07:41:20,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304377, now seen corresponding path program 1 times [2024-11-09 07:41:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:20,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532058504] [2024-11-09 07:41:20,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:20,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:21,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:21,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532058504] [2024-11-09 07:41:21,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532058504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:21,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:21,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:41:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763050557] [2024-11-09 07:41:21,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:21,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:41:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:21,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:41:21,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:21,013 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-09 07:41:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:21,133 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2024-11-09 07:41:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:41:21,133 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-09 07:41:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:21,135 INFO L225 Difference]: With dead ends: 93 [2024-11-09 07:41:21,137 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 07:41:21,137 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-09 07:41:21,138 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-09 07:41:21,139 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-09 07:41:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 07:41:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-09 07:41:21,147 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-09 07:41:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-11-09 07:41:21,150 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 9 [2024-11-09 07:41:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:21,150 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-11-09 07:41:21,150 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-09 07:41:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-11-09 07:41:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:41:21,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:21,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:21,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:41:21,152 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-09 07:41:21,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304378, now seen corresponding path program 1 times [2024-11-09 07:41:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:21,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220875383] [2024-11-09 07:41:21,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:21,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:21,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:21,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220875383] [2024-11-09 07:41:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220875383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:21,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:21,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:41:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811866735] [2024-11-09 07:41:21,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:21,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:41:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:21,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:41:21,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:21,268 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-09 07:41:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:21,411 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2024-11-09 07:41:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:41:21,412 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-09 07:41:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:21,413 INFO L225 Difference]: With dead ends: 114 [2024-11-09 07:41:21,413 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 07:41:21,413 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-09 07:41:21,414 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-09 07:41:21,414 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-09 07:41:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 07:41:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2024-11-09 07:41:21,419 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-09 07:41:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2024-11-09 07:41:21,420 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 9 [2024-11-09 07:41:21,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:21,420 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2024-11-09 07:41:21,420 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-09 07:41:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2024-11-09 07:41:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:41:21,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:21,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:21,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:41:21,422 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-09 07:41:21,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1348173030, now seen corresponding path program 1 times [2024-11-09 07:41:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317596620] [2024-11-09 07:41:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:21,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:21,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317596620] [2024-11-09 07:41:21,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317596620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:21,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:21,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:41:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859041829] [2024-11-09 07:41:21,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:21,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:41:21,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:21,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:41:21,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:41:21,572 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-09 07:41:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:21,681 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2024-11-09 07:41:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:41:21,681 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-09 07:41:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:21,683 INFO L225 Difference]: With dead ends: 127 [2024-11-09 07:41:21,685 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 07:41:21,686 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-09 07:41:21,687 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-09 07:41:21,687 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-09 07:41:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 07:41:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2024-11-09 07:41:21,701 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-09 07:41:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2024-11-09 07:41:21,703 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 17 [2024-11-09 07:41:21,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:21,706 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2024-11-09 07:41:21,706 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-09 07:41:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2024-11-09 07:41:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:41:21,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:21,707 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-09 07:41:21,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:41:21,708 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-09 07:41:21,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:21,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1496225836, now seen corresponding path program 1 times [2024-11-09 07:41:21,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:21,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697181421] [2024-11-09 07:41:21,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:21,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:21,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697181421] [2024-11-09 07:41:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697181421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:21,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:21,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:41:21,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241618072] [2024-11-09 07:41:21,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:21,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:41:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:21,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:41:21,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:41:21,807 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-09 07:41:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:21,908 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2024-11-09 07:41:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:41:21,913 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-09 07:41:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:21,914 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:41:21,914 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:41:21,914 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-09 07:41:21,915 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-09 07:41:21,915 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-09 07:41:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:41:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2024-11-09 07:41:21,927 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-09 07:41:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2024-11-09 07:41:21,928 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 19 [2024-11-09 07:41:21,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:21,929 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2024-11-09 07:41:21,929 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-09 07:41:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2024-11-09 07:41:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:41:21,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:21,930 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-09 07:41:21,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:41:21,930 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-09 07:41:21,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1636948777, now seen corresponding path program 1 times [2024-11-09 07:41:21,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:21,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023883611] [2024-11-09 07:41:21,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:21,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:22,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023883611] [2024-11-09 07:41:22,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023883611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:22,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:22,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:41:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012790524] [2024-11-09 07:41:22,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:22,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:41:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:22,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:41:22,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:41:22,111 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-09 07:41:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:22,337 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2024-11-09 07:41:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:41:22,338 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-09 07:41:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:22,338 INFO L225 Difference]: With dead ends: 130 [2024-11-09 07:41:22,338 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 07:41:22,338 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-09 07:41:22,339 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 44 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:22,339 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.2s Time] [2024-11-09 07:41:22,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 07:41:22,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2024-11-09 07:41:22,343 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-09 07:41:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2024-11-09 07:41:22,344 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 19 [2024-11-09 07:41:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:22,344 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2024-11-09 07:41:22,344 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-09 07:41:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2024-11-09 07:41:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:41:22,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:22,345 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-09 07:41:22,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:41:22,346 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-09 07:41:22,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:22,346 INFO L85 PathProgramCache]: Analyzing trace with hash 893457297, now seen corresponding path program 1 times [2024-11-09 07:41:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:22,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937892973] [2024-11-09 07:41:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:22,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:22,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:22,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937892973] [2024-11-09 07:41:22,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937892973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:22,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:22,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:41:22,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634875083] [2024-11-09 07:41:22,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:22,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:41:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:41:22,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:22,488 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-09 07:41:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:22,655 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2024-11-09 07:41:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:41:22,655 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-09 07:41:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:22,656 INFO L225 Difference]: With dead ends: 151 [2024-11-09 07:41:22,657 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 07:41:22,657 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-09 07:41:22,657 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:22,658 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.2s Time] [2024-11-09 07:41:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 07:41:22,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2024-11-09 07:41:22,671 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-09 07:41:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2024-11-09 07:41:22,672 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 22 [2024-11-09 07:41:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:22,672 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2024-11-09 07:41:22,672 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-09 07:41:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2024-11-09 07:41:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:41:22,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:22,679 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-09 07:41:22,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:41:22,679 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-09 07:41:22,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608044, now seen corresponding path program 1 times [2024-11-09 07:41:22,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:22,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834916581] [2024-11-09 07:41:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:22,913 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-09 07:41:22,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834916581] [2024-11-09 07:41:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834916581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:22,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:22,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:41:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139640924] [2024-11-09 07:41:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:22,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:41:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:41:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:41:22,915 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-09 07:41:23,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:23,070 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2024-11-09 07:41:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:41:23,071 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-09 07:41:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:23,072 INFO L225 Difference]: With dead ends: 123 [2024-11-09 07:41:23,072 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 07:41:23,072 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-09 07:41:23,072 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-09 07:41:23,073 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-09 07:41:23,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 07:41:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2024-11-09 07:41:23,075 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-09 07:41:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2024-11-09 07:41:23,076 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 22 [2024-11-09 07:41:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:23,076 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2024-11-09 07:41:23,076 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-09 07:41:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2024-11-09 07:41:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:41:23,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:23,077 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-09 07:41:23,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:41:23,077 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-09 07:41:23,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:23,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608043, now seen corresponding path program 1 times [2024-11-09 07:41:23,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:23,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609103724] [2024-11-09 07:41:23,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:23,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:23,343 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-09 07:41:23,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:23,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609103724] [2024-11-09 07:41:23,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609103724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:23,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:23,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:41:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898319851] [2024-11-09 07:41:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:23,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:41:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:41:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:41:23,345 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-09 07:41:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:23,612 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2024-11-09 07:41:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:41:23,612 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-09 07:41:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:23,616 INFO L225 Difference]: With dead ends: 112 [2024-11-09 07:41:23,616 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 07:41:23,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:41:23,617 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 11 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:23,617 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.2s Time] [2024-11-09 07:41:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 07:41:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2024-11-09 07:41:23,624 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-09 07:41:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2024-11-09 07:41:23,624 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 22 [2024-11-09 07:41:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:23,625 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2024-11-09 07:41:23,625 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-09 07:41:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2024-11-09 07:41:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:41:23,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:23,625 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-09 07:41:23,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:41:23,626 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-09 07:41:23,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:23,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1076428849, now seen corresponding path program 1 times [2024-11-09 07:41:23,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:23,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684141875] [2024-11-09 07:41:23,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:23,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:23,993 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-09 07:41:23,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:23,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684141875] [2024-11-09 07:41:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684141875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:23,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:23,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:41:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586960418] [2024-11-09 07:41:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:23,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:41:23,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:41:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:41:23,999 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-09 07:41:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:24,250 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-11-09 07:41:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:41:24,251 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-09 07:41:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:24,252 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:41:24,255 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:41:24,255 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-09 07:41:24,256 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:24,256 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.2s Time] [2024-11-09 07:41:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:41:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2024-11-09 07:41:24,262 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-09 07:41:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2024-11-09 07:41:24,263 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 25 [2024-11-09 07:41:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:24,263 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2024-11-09 07:41:24,263 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-09 07:41:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2024-11-09 07:41:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:41:24,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:24,264 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-09 07:41:24,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:41:24,264 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-09 07:41:24,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2019367435, now seen corresponding path program 1 times [2024-11-09 07:41:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:24,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432781094] [2024-11-09 07:41:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:24,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:24,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432781094] [2024-11-09 07:41:24,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432781094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:24,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571932135] [2024-11-09 07:41:24,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:24,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:24,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:24,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:24,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:41:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:24,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:41:24,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:24,664 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-09 07:41:24,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:41:24,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571932135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:24,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:41:24,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2024-11-09 07:41:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795722778] [2024-11-09 07:41:24,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:24,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:41:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:24,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:41:24,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:41:24,666 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-09 07:41:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:24,853 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2024-11-09 07:41:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:41:24,857 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-09 07:41:24,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:24,858 INFO L225 Difference]: With dead ends: 110 [2024-11-09 07:41:24,858 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 07:41:24,858 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-09 07:41:24,858 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:24,859 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.2s Time] [2024-11-09 07:41:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 07:41:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2024-11-09 07:41:24,860 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-09 07:41:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-11-09 07:41:24,861 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 30 [2024-11-09 07:41:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:24,861 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-11-09 07:41:24,861 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-09 07:41:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-11-09 07:41:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:41:24,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:24,862 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-09 07:41:24,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:41:25,066 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-09 07:41:25,067 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-09 07:41:25,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1318302857, now seen corresponding path program 1 times [2024-11-09 07:41:25,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:25,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650182630] [2024-11-09 07:41:25,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:25,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650182630] [2024-11-09 07:41:25,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650182630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:25,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445587507] [2024-11-09 07:41:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:25,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:25,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:25,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:25,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:41:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:25,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:41:25,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:25,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:25,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445587507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:25,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:25,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-11-09 07:41:25,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435635058] [2024-11-09 07:41:25,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:25,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:41:25,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:25,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:41:25,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:41:25,341 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-09 07:41:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:25,453 INFO L93 Difference]: Finished difference Result 230 states and 270 transitions. [2024-11-09 07:41:25,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:41:25,454 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-09 07:41:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:25,455 INFO L225 Difference]: With dead ends: 230 [2024-11-09 07:41:25,455 INFO L226 Difference]: Without dead ends: 230 [2024-11-09 07:41:25,455 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-09 07:41:25,456 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-09 07:41:25,456 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-09 07:41:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-09 07:41:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 139. [2024-11-09 07:41:25,458 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-09 07:41:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2024-11-09 07:41:25,459 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 30 [2024-11-09 07:41:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:25,459 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2024-11-09 07:41:25,459 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-09 07:41:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2024-11-09 07:41:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:41:25,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:25,460 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-09 07:41:25,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:41:25,660 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-09 07:41:25,661 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-09 07:41:25,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash 864219972, now seen corresponding path program 1 times [2024-11-09 07:41:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:25,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081266677] [2024-11-09 07:41:25,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:25,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081266677] [2024-11-09 07:41:25,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081266677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401521777] [2024-11-09 07:41:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:25,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:25,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:25,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:25,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:41:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:26,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:41:26,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:26,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:41:26,118 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:41:26,119 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-09 07:41:26,155 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-09 07:41:26,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:26,160 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-09 07:41:26,170 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-09 07:41:26,191 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-09 07:41:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:26,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:26,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:26,359 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-09 07:41:26,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:26,367 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-09 07:41:26,372 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-09 07:41:26,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:26,460 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-09 07:41:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:26,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401521777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:26,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:26,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2024-11-09 07:41:26,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919503406] [2024-11-09 07:41:26,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:26,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:41:26,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:26,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:41:26,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=231, Unknown=22, NotChecked=0, Total=306 [2024-11-09 07:41:26,542 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-09 07:41:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:26,956 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2024-11-09 07:41:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:41:26,956 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-09 07:41:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:26,957 INFO L225 Difference]: With dead ends: 233 [2024-11-09 07:41:26,957 INFO L226 Difference]: Without dead ends: 233 [2024-11-09 07:41:26,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=381, Unknown=23, NotChecked=0, Total=506 [2024-11-09 07:41:26,958 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 186 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:26,958 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.3s Time] [2024-11-09 07:41:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-09 07:41:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 155. [2024-11-09 07:41:26,961 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-09 07:41:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2024-11-09 07:41:26,961 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 32 [2024-11-09 07:41:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:26,962 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2024-11-09 07:41:26,962 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-09 07:41:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2024-11-09 07:41:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:41:26,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:26,962 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-09 07:41:26,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:41:27,166 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-09 07:41:27,167 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-09 07:41:27,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash 864210937, now seen corresponding path program 1 times [2024-11-09 07:41:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:27,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545021186] [2024-11-09 07:41:27,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:27,633 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-09 07:41:27,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545021186] [2024-11-09 07:41:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545021186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681128626] [2024-11-09 07:41:27,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:27,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:27,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:27,635 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:27,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:41:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:27,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 07:41:27,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:27,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:41:27,775 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-09 07:41:27,832 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-09 07:41:27,913 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:41:27,914 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-09 07:41:27,990 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-09 07:41:27,994 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-09 07:41:27,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:28,052 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 07:41:28,052 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-09 07:41:28,056 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-09 07:41:28,101 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-09 07:41:28,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:28,108 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-09 07:41:28,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:28,115 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-09 07:41:28,123 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-09 07:41:28,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:28,262 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-09 07:41:28,284 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-09 07:41:28,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681128626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:28,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:28,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-11-09 07:41:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067702188] [2024-11-09 07:41:28,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:28,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 07:41:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:28,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 07:41:28,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=513, Unknown=5, NotChecked=94, Total=702 [2024-11-09 07:41:28,286 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-09 07:41:28,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:28,932 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2024-11-09 07:41:28,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:41:28,933 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-09 07:41:28,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:28,934 INFO L225 Difference]: With dead ends: 220 [2024-11-09 07:41:28,934 INFO L226 Difference]: Without dead ends: 220 [2024-11-09 07:41:28,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1005, Unknown=5, NotChecked=134, Total=1332 [2024-11-09 07:41:28,935 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:28,935 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.4s Time] [2024-11-09 07:41:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-09 07:41:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 168. [2024-11-09 07:41:28,938 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-09 07:41:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 196 transitions. [2024-11-09 07:41:28,939 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 196 transitions. Word has length 32 [2024-11-09 07:41:28,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:28,939 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 196 transitions. [2024-11-09 07:41:28,939 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-09 07:41:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2024-11-09 07:41:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:41:28,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:28,940 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-09 07:41:28,958 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-09 07:41:29,144 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-09 07:41:29,145 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-09 07:41:29,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash 864210938, now seen corresponding path program 1 times [2024-11-09 07:41:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:29,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656259256] [2024-11-09 07:41:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:29,625 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-09 07:41:29,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:29,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656259256] [2024-11-09 07:41:29,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656259256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:29,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186141526] [2024-11-09 07:41:29,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:29,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:29,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:29,629 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:29,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:41:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:29,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:41:29,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:29,793 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:41:29,794 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-09 07:41:29,807 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-09 07:41:29,855 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-09 07:41:29,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:41:30,028 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:41:30,028 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-09 07:41:30,035 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-09 07:41:30,163 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-09 07:41:30,168 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-09 07:41:30,220 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-09 07:41:30,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:30,426 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-09 07:41:30,461 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-09 07:41:30,470 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-09 07:41:30,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:30,476 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-09 07:41:30,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:30,481 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-09 07:41:30,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:30,488 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-09 07:41:30,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:30,499 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-09 07:41:30,518 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-09 07:41:30,521 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-09 07:41:30,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:30,526 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-09 07:41:30,530 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:30,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:30,532 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-09 07:41:30,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:30,660 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-09 07:41:30,697 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-09 07:41:30,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186141526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:30,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:30,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-11-09 07:41:30,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185987679] [2024-11-09 07:41:30,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:30,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 07:41:30,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:30,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 07:41:30,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=565, Unknown=3, NotChecked=150, Total=812 [2024-11-09 07:41:30,699 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-09 07:41:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:31,459 INFO L93 Difference]: Finished difference Result 227 states and 259 transitions. [2024-11-09 07:41:31,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:41:31,459 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-09 07:41:31,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:31,460 INFO L225 Difference]: With dead ends: 227 [2024-11-09 07:41:31,460 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 07:41:31,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=208, Invalid=1207, Unknown=3, NotChecked=222, Total=1640 [2024-11-09 07:41:31,461 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-09 07:41:31,461 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-09 07:41:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 07:41:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 163. [2024-11-09 07:41:31,464 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-09 07:41:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2024-11-09 07:41:31,465 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 32 [2024-11-09 07:41:31,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:31,465 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2024-11-09 07:41:31,465 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-09 07:41:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2024-11-09 07:41:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:41:31,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:31,465 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:41:31,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:41:31,665 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-09 07:41:31,666 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-09 07:41:31,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash 568395342, now seen corresponding path program 1 times [2024-11-09 07:41:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:31,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527264676] [2024-11-09 07:41:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:31,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:32,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:32,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:32,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527264676] [2024-11-09 07:41:32,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527264676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:32,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804058653] [2024-11-09 07:41:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:32,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:32,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:32,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:32,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:41:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:32,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 07:41:32,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:32,401 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-09 07:41:32,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:32,493 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-09 07:41:32,507 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:41:32,508 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-09 07:41:32,559 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-09 07:41:32,571 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-09 07:41:32,615 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-09 07:41:32,674 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-09 07:41:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:32,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:32,748 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-09 07:41:32,752 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-09 07:41:35,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:35,546 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-09 07:41:35,559 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-09 07:41:35,559 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-09 07:41:35,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:41:35,573 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:41:35,573 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-09 07:41:35,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:35,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804058653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:35,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:35,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 33 [2024-11-09 07:41:35,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335620099] [2024-11-09 07:41:35,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:35,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:41:35,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:35,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:41:35,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=774, Unknown=16, NotChecked=118, Total=1056 [2024-11-09 07:41:35,587 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-09 07:41:36,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:36,177 INFO L93 Difference]: Finished difference Result 236 states and 277 transitions. [2024-11-09 07:41:36,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:41:36,177 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-09 07:41:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:36,178 INFO L225 Difference]: With dead ends: 236 [2024-11-09 07:41:36,178 INFO L226 Difference]: Without dead ends: 236 [2024-11-09 07:41:36,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=221, Invalid=961, Unknown=16, NotChecked=134, Total=1332 [2024-11-09 07:41:36,179 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 210 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-09 07:41:36,179 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-09 07:41:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-09 07:41:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 163. [2024-11-09 07:41:36,182 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-09 07:41:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 189 transitions. [2024-11-09 07:41:36,183 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 189 transitions. Word has length 32 [2024-11-09 07:41:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:36,183 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 189 transitions. [2024-11-09 07:41:36,183 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-09 07:41:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 189 transitions. [2024-11-09 07:41:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:41:36,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:36,184 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-09 07:41:36,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:41:36,387 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-09 07:41:36,388 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-09 07:41:36,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:36,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1851586532, now seen corresponding path program 1 times [2024-11-09 07:41:36,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:36,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066801241] [2024-11-09 07:41:36,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:36,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:36,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:36,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066801241] [2024-11-09 07:41:36,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066801241] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:36,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582175572] [2024-11-09 07:41:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:36,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:36,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:36,785 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:36,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:41:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:36,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 07:41:36,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:36,903 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-09 07:41:36,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:36,959 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-09 07:41:36,972 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:41:36,972 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-09 07:41:36,999 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-09 07:41:37,001 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-09 07:41:37,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-09 07:41:37,057 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-09 07:41:37,084 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-09 07:41:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:37,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:37,102 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-09 07:41:37,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:37,322 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-09 07:41:37,335 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-09 07:41:37,335 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-09 07:41:37,339 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-09 07:41:37,349 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:41:37,349 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-09 07:41:37,366 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-09 07:41:37,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582175572] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:37,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:37,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 33 [2024-11-09 07:41:37,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407634482] [2024-11-09 07:41:37,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:37,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:41:37,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:37,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:41:37,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=833, Unknown=11, NotChecked=60, Total=1056 [2024-11-09 07:41:37,369 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-09 07:41:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:38,139 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2024-11-09 07:41:38,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:41:38,140 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-09 07:41:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:38,141 INFO L225 Difference]: With dead ends: 246 [2024-11-09 07:41:38,141 INFO L226 Difference]: Without dead ends: 246 [2024-11-09 07:41:38,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=1027, Unknown=11, NotChecked=68, Total=1332 [2024-11-09 07:41:38,142 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-09 07:41:38,142 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-09 07:41:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-09 07:41:38,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 181. [2024-11-09 07:41:38,144 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-09 07:41:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2024-11-09 07:41:38,144 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 32 [2024-11-09 07:41:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:38,145 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2024-11-09 07:41:38,145 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-09 07:41:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2024-11-09 07:41:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:41:38,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:38,145 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-09 07:41:38,159 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-09 07:41:38,346 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-09 07:41:38,346 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-09 07:41:38,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1555761902, now seen corresponding path program 1 times [2024-11-09 07:41:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:38,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672378290] [2024-11-09 07:41:38,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:38,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672378290] [2024-11-09 07:41:38,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672378290] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622314196] [2024-11-09 07:41:38,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:38,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:38,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:38,560 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:38,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:41:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:38,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:41:38,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:38,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:41:38,684 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:41:38,684 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-09 07:41:38,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:38,698 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-09 07:41:38,706 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-09 07:41:38,710 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-09 07:41:38,724 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-09 07:41:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:38,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:38,758 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-09 07:41:38,761 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-09 07:41:38,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:38,822 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-09 07:41:38,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:38,834 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-09 07:41:38,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-11-09 07:41:38,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:38,934 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-09 07:41:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:39,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622314196] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:39,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:39,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2024-11-09 07:41:39,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095396323] [2024-11-09 07:41:39,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:39,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:41:39,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:39,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:41:39,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=187, Unknown=10, NotChecked=58, Total=306 [2024-11-09 07:41:39,036 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-09 07:41:39,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:39,622 INFO L93 Difference]: Finished difference Result 255 states and 294 transitions. [2024-11-09 07:41:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:41:39,622 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-09 07:41:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:39,623 INFO L225 Difference]: With dead ends: 255 [2024-11-09 07:41:39,623 INFO L226 Difference]: Without dead ends: 255 [2024-11-09 07:41:39,624 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-09 07:41:39,624 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 102 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:39,625 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.5s Time] [2024-11-09 07:41:39,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-09 07:41:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 181. [2024-11-09 07:41:39,629 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-09 07:41:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 207 transitions. [2024-11-09 07:41:39,629 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 207 transitions. Word has length 32 [2024-11-09 07:41:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:39,630 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 207 transitions. [2024-11-09 07:41:39,630 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-09 07:41:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 207 transitions. [2024-11-09 07:41:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:41:39,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:39,631 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-09 07:41:39,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:41:39,831 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-09 07:41:39,832 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-09 07:41:39,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1554334102, now seen corresponding path program 1 times [2024-11-09 07:41:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:39,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966354296] [2024-11-09 07:41:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:39,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966354296] [2024-11-09 07:41:40,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966354296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037498604] [2024-11-09 07:41:40,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:40,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:40,054 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:40,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:41:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:40,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 07:41:40,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:40,176 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-09 07:41:40,200 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:41:40,200 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-09 07:41:40,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:40,230 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-09 07:41:40,234 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-09 07:41:40,253 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-09 07:41:40,284 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-09 07:41:40,308 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-09 07:41:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:41:40,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:40,351 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-09 07:41:40,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:40,456 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-09 07:41:40,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:40,465 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-09 07:41:40,469 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-09 07:41:40,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:40,567 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-09 07:41:40,624 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-09 07:41:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037498604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:40,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2024-11-09 07:41:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706207057] [2024-11-09 07:41:40,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:40,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:41:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:40,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:41:40,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=482, Unknown=21, NotChecked=46, Total=650 [2024-11-09 07:41:40,628 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-09 07:41:41,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:41,377 INFO L93 Difference]: Finished difference Result 284 states and 327 transitions. [2024-11-09 07:41:41,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 07:41:41,377 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-09 07:41:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:41,378 INFO L225 Difference]: With dead ends: 284 [2024-11-09 07:41:41,378 INFO L226 Difference]: Without dead ends: 284 [2024-11-09 07:41:41,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=1070, Unknown=24, NotChecked=70, Total=1406 [2024-11-09 07:41:41,379 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:41,380 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.5s Time] [2024-11-09 07:41:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-09 07:41:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 181. [2024-11-09 07:41:41,383 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-09 07:41:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2024-11-09 07:41:41,384 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 35 [2024-11-09 07:41:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:41,384 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2024-11-09 07:41:41,384 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-09 07:41:41,384 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2024-11-09 07:41:41,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:41:41,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:41,385 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-09 07:41:41,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 07:41:41,588 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-09 07:41:41,589 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-09 07:41:41,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:41,590 INFO L85 PathProgramCache]: Analyzing trace with hash 181894197, now seen corresponding path program 1 times [2024-11-09 07:41:41,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:41,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642582340] [2024-11-09 07:41:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:41,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:41,697 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-09 07:41:41,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:41,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642582340] [2024-11-09 07:41:41,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642582340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:41,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048124396] [2024-11-09 07:41:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:41,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:41,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:41,700 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:41,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:41:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:41,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:41:41,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:41,870 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-09 07:41:41,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:41,923 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-09 07:41:41,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048124396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:41,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:41,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-11-09 07:41:41,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922425057] [2024-11-09 07:41:41,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:41,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:41:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:41,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:41:41,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:41:41,925 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-09 07:41:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:42,071 INFO L93 Difference]: Finished difference Result 302 states and 351 transitions. [2024-11-09 07:41:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 07:41:42,072 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-09 07:41:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:42,072 INFO L225 Difference]: With dead ends: 302 [2024-11-09 07:41:42,073 INFO L226 Difference]: Without dead ends: 302 [2024-11-09 07:41:42,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:41:42,075 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-09 07:41:42,075 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-09 07:41:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-09 07:41:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2024-11-09 07:41:42,078 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-09 07:41:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 304 transitions. [2024-11-09 07:41:42,079 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 304 transitions. Word has length 38 [2024-11-09 07:41:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:42,079 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 304 transitions. [2024-11-09 07:41:42,079 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-09 07:41:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 304 transitions. [2024-11-09 07:41:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 07:41:42,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:42,079 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-09 07:41:42,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 07:41:42,280 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-09 07:41:42,280 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-09 07:41:42,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1142228604, now seen corresponding path program 1 times [2024-11-09 07:41:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:42,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660306679] [2024-11-09 07:41:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:42,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:42,716 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-09 07:41:42,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:42,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660306679] [2024-11-09 07:41:42,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660306679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:42,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341494582] [2024-11-09 07:41:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:42,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:42,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:42,719 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:42,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:41:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:42,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 07:41:42,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:42,925 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:41:42,926 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-09 07:41:42,966 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-09 07:41:42,969 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-09 07:41:43,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:41:43,083 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-09 07:41:43,086 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-09 07:41:43,088 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-09 07:41:43,171 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-09 07:41:43,174 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-09 07:41:43,271 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-09 07:41:43,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:43,449 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-09 07:41:43,464 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-09 07:41:43,509 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-09 07:41:43,524 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-09 07:41:43,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:43,533 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-09 07:41:43,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:43,538 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-09 07:41:43,549 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-09 07:41:43,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:43,553 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-09 07:41:43,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:43,562 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-09 07:41:43,566 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-09 07:41:43,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:43,576 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-09 07:41:43,577 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:41:43,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:43,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:41:43,580 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-09 07:41:43,588 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 07:41:43,589 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-09 07:41:43,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:43,683 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-09 07:41:43,705 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-09 07:41:43,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341494582] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:43,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:43,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2024-11-09 07:41:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308488203] [2024-11-09 07:41:43,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:43,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:41:43,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:41:43,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=787, Unknown=3, NotChecked=174, Total=1056 [2024-11-09 07:41:43,707 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-09 07:41:44,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:44,700 INFO L93 Difference]: Finished difference Result 266 states and 324 transitions. [2024-11-09 07:41:44,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:41:44,701 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-09 07:41:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:44,702 INFO L225 Difference]: With dead ends: 266 [2024-11-09 07:41:44,703 INFO L226 Difference]: Without dead ends: 266 [2024-11-09 07:41:44,704 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-09 07:41:44,705 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 243 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:44,706 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.6s Time] [2024-11-09 07:41:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-09 07:41:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 249. [2024-11-09 07:41:44,709 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-09 07:41:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 306 transitions. [2024-11-09 07:41:44,710 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 306 transitions. Word has length 40 [2024-11-09 07:41:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:44,710 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 306 transitions. [2024-11-09 07:41:44,710 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-09 07:41:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 306 transitions. [2024-11-09 07:41:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:41:44,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:44,711 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-09 07:41:44,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:41:44,911 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-09 07:41:44,912 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-09 07:41:44,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:44,913 INFO L85 PathProgramCache]: Analyzing trace with hash 504664918, now seen corresponding path program 1 times [2024-11-09 07:41:44,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:44,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561952753] [2024-11-09 07:41:44,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:44,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:45,205 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-09 07:41:45,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561952753] [2024-11-09 07:41:45,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561952753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270426624] [2024-11-09 07:41:45,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:45,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:45,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:45,207 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:45,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:41:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:45,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 07:41:45,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:45,406 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:41:45,406 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-09 07:41:45,437 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-09 07:41:45,518 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:41:45,518 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-09 07:41:45,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:45,660 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-09 07:41:45,688 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-09 07:41:45,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:45,735 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-09 07:41:45,742 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-09 07:41:45,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:45,775 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-09 07:41:45,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:45,780 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-09 07:41:45,783 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-09 07:41:45,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:45,920 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-09 07:41:46,003 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-09 07:41:46,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270426624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:41:46,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:41:46,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 13] total 34 [2024-11-09 07:41:46,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133656030] [2024-11-09 07:41:46,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:41:46,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 07:41:46,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:46,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 07:41:46,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=856, Unknown=10, NotChecked=122, Total=1122 [2024-11-09 07:41:46,004 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-09 07:41:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:46,487 INFO L93 Difference]: Finished difference Result 269 states and 326 transitions. [2024-11-09 07:41:46,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:41:46,488 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-09 07:41:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:46,489 INFO L225 Difference]: With dead ends: 269 [2024-11-09 07:41:46,489 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 07:41:46,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1139, Unknown=10, NotChecked=142, Total=1482 [2024-11-09 07:41:46,490 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:41:46,490 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.4s Time] [2024-11-09 07:41:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 07:41:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 254. [2024-11-09 07:41:46,494 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-09 07:41:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 311 transitions. [2024-11-09 07:41:46,495 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 311 transitions. Word has length 43 [2024-11-09 07:41:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:46,495 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 311 transitions. [2024-11-09 07:41:46,495 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-09 07:41:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 311 transitions. [2024-11-09 07:41:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:41:46,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:46,496 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-09 07:41:46,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 07:41:46,700 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-09 07:41:46,701 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-09 07:41:46,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:46,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1985636438, now seen corresponding path program 1 times [2024-11-09 07:41:46,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:46,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345442578] [2024-11-09 07:41:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:46,789 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-09 07:41:46,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:46,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345442578] [2024-11-09 07:41:46,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345442578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:41:46,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:41:46,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:41:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441810166] [2024-11-09 07:41:46,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:41:46,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:41:46,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:41:46,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:41:46,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:41:46,791 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-09 07:41:46,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:41:46,891 INFO L93 Difference]: Finished difference Result 252 states and 308 transitions. [2024-11-09 07:41:46,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:41:46,891 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-09 07:41:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:41:46,892 INFO L225 Difference]: With dead ends: 252 [2024-11-09 07:41:46,892 INFO L226 Difference]: Without dead ends: 252 [2024-11-09 07:41:46,892 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-09 07:41:46,893 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-09 07:41:46,893 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-09 07:41:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-09 07:41:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-11-09 07:41:46,898 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-09 07:41:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 308 transitions. [2024-11-09 07:41:46,899 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 308 transitions. Word has length 45 [2024-11-09 07:41:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:41:46,900 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 308 transitions. [2024-11-09 07:41:46,900 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-09 07:41:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 308 transitions. [2024-11-09 07:41:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:41:46,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:41:46,901 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-09 07:41:46,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:41:46,901 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-09 07:41:46,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:41:46,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1853693705, now seen corresponding path program 2 times [2024-11-09 07:41:46,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:41:46,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654622163] [2024-11-09 07:41:46,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:41:46,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:41:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:41:47,418 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-09 07:41:47,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:41:47,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654622163] [2024-11-09 07:41:47,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654622163] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:41:47,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786385485] [2024-11-09 07:41:47,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:41:47,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:41:47,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:41:47,422 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:41:47,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 07:41:47,532 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:41:47,532 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:41:47,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 07:41:47,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:41:47,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:41:47,642 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:41:47,642 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-09 07:41:47,677 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-09 07:41:47,687 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-09 07:41:47,712 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-09 07:41:47,773 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-09 07:41:47,794 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-09 07:41:47,807 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:41:47,807 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-09 07:41:47,838 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-09 07:41:47,842 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-09 07:41:47,865 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-09 07:41:47,927 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-09 07:41:47,984 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-09 07:41:47,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:41:52,147 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-09 07:41:52,515 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-09 07:41:52,771 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:41:52,771 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-09 07:41:59,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:59,814 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-09 07:41:59,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:41:59,846 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-09 07:41:59,856 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-09 07:41:59,865 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-09 07:42:04,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:42:04,222 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-09 07:42:04,438 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-09 07:42:04,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786385485] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:42:04,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:42:04,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 41 [2024-11-09 07:42:04,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785671603] [2024-11-09 07:42:04,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:42:04,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 07:42:04,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:42:04,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 07:42:04,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1229, Unknown=54, NotChecked=150, Total=1640 [2024-11-09 07:42:04,440 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-09 07:42:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:42:15,441 INFO L93 Difference]: Finished difference Result 435 states and 530 transitions. [2024-11-09 07:42:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:42:15,445 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-09 07:42:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:42:15,447 INFO L225 Difference]: With dead ends: 435 [2024-11-09 07:42:15,447 INFO L226 Difference]: Without dead ends: 435 [2024-11-09 07:42:15,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=342, Invalid=1866, Unknown=56, NotChecked=186, Total=2450 [2024-11-09 07:42:15,448 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 327 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:42:15,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 774 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 872 Invalid, 0 Unknown, 343 Unchecked, 2.1s Time] [2024-11-09 07:42:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-09 07:42:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 318. [2024-11-09 07:42:15,454 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-09 07:42:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 387 transitions. [2024-11-09 07:42:15,455 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 387 transitions. Word has length 45 [2024-11-09 07:42:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:42:15,456 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 387 transitions. [2024-11-09 07:42:15,456 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-09 07:42:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 387 transitions. [2024-11-09 07:42:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 07:42:15,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:42:15,456 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-09 07:42:15,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:42:15,657 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-09 07:42:15,657 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-09 07:42:15,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:42:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1853684670, now seen corresponding path program 2 times [2024-11-09 07:42:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:42:15,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494994450] [2024-11-09 07:42:15,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:42:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:42:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:42:16,930 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-09 07:42:16,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:42:16,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494994450] [2024-11-09 07:42:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494994450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:42:16,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024559996] [2024-11-09 07:42:16,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:42:16,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:42:16,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:42:16,932 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:42:16,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 07:42:17,086 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:42:17,086 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:42:17,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 07:42:17,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:42:17,384 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:42:17,384 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-09 07:42:17,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:42:17,935 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:42:17,936 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-09 07:42:18,035 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:42:18,035 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-09 07:42:18,138 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-09 07:42:18,138 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-09 07:42:18,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:42:18,333 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:42:18,333 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-09 07:42:18,497 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-09 07:42:18,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:42:18,833 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:42:18,833 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-09 07:42:18,843 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-09 07:42:19,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:42:19,410 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-09 07:42:19,604 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-09 07:42:19,778 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-09 07:42:19,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:42:19,997 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-09 07:42:21,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:42:21,640 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-09 07:42:21,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:42:21,669 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-09 07:42:21,680 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-09 07:42:21,691 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-09 07:42:22,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:42:22,132 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-09 07:42:22,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:42:22,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:42:22,148 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-09 07:42:22,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-09 07:42:53,046 WARN L286 SmtUtils]: Spent 27.94s on a formula simplification that was a NOOP. DAG size: 2739 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 07:42:53,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:42:53,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 37 select indices, 37 select index equivalence classes, 0 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 666 case distinctions, treesize of input 1158 treesize of output 6396